Calculates the optimal route(s) for deliveries with (optional) time windows and a set of vehicles. The deliveries will be distributed to a number of tours according to the and vehicle availabilities and capacities.
It calls an intelligent algorithm which fits all delivery times into their respective time windows but also results in the shortest possible overall driving time.
The number of tours will be minimized considering the given time and load volume constraints.
This is per default an asynchroneous process which only returns a Process ID. Results can then be polled (e.g. every second) via "GET /api/process/status/<process_id>/current".
The routing process can also be called synchroneously by setting the "async" parameter explicitely to false. In this case, no polling is required and results will be returned directly.
Pleas note that in this synchroneous case, the call might take a while and block the API server while waiting for the response.