This class can solve a truck routing problem with the Clarke and Wright algorithm.
It attempts to solve the problem of determining the routes of a given number of trucks with different weight and volume capacity will be dispatching deliveries to a certain number of clients distributed geographically within certain time windows.
The class takes as parameters the nodes of positions of each client, the demands of each client, a matrix of distance between nodes and the capacity of each truck.
It computes the route for each truck, as well the time and distance to drive to each customer, and the volume and weight to transport. |
