Solving The Vehicle Routing Problem- 1 min
Example of project - Clarke-Wright algorithm is used to solve the open version of the well-known capacitated vehicle routing problem in which vehicles are not required to return to the depot after completing service.
The vehicle routing problem, for which the Clarke-Wright algorithm has been designed, is characterized as follows. From a depot goods must be delivered in given quantities to given customers. For the transportation of the goods a number of vehicles are available, each with a certain capacity with regard to the quantities. Every vehicle that is applied in the solution must cover a route, to and from the depot, on which goods are delivered to one or more customers. The problem is to determine the allocation of the customers among routes, the sequence in which the customers shall be visited on a route, and which vehicle that shall cover a route.
Check the code out here.