LogisticsLab/VRP is used to solve capacitated Vechicle Routing Problems.
In the Vehicle Routing Problem, a number of demand nodes are to be served from a depot. The de-mand of each individual demand node is known and is less than or equal to the capacity of the type of vehicle used. Furthermore, the weights of the edges (e.g. distances or costs) between the nodes (depot and demand nodes) are known. The demands of the demand nodes are to be assigned to tours in considering the capacities of the vehicles. For the individual tours, the routes from the depot via the demand nodes assigned to the tours and back to the depot are to be found. The total costs or the total distance travelled of all tours is to be minimised.
Maximum distances and/or times for a tour and customer time windows can also be specified and included in the optimisation.