Optimization Problem refers to a collection of addresses that need to be visited.
The optimization problem takes into consideration all of the addresses that need to be visited and all the constraints associated with each address and depot.
It is preferable to create an optimization problem with as many orders in it as possible, so that the optimization engine is able to consider the entire problem set.
This is different from a Route, which is a sequence of addresses that need to be visited by a single vehicle and driver in a fixed time period. Solving an Optimization Problem results in a number of routes. (Possibly recurring in the future)
Click methods bellow to start simulation
|optimization_problem_id||string||An unique ID|
|state||integer||state of optimization [1 - 6]|
|parameters||Route Parameters||Route Parameters. Datatype|
|addresses||array||Route Addresses. Datatype|
|tracking_history||array||Device tracking data. Datatype|