Using a fleet of vehicles, pick up the objects of each customer and bring them to the depot. Each vehicle can service multiple customers, but it has a limited capacity.
The Vehicle Routing Problem is one of the most challenging combinatorial optimization task. This problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. The interest in VRP is motivated by its practical relevance as well as by its considerable difficulty.
Besides the basic case, there is also a variant with time windows.
The capacity vehicle routing problem and it's time-windowed variant are defined by our platform