The Vehicle Routing Problem (VRP)
The VRP is a generalisation of the TSP. It’s typical for vehicles to have some kind of capacity dimension which describes the maximum quantity that can be loaded onto a vehicle. You’ll find an extensive explanation of dimensions for general routing in the IVR layer here.
CVRP
The Capacitated Vehicle Routing Problem.
Read More »
CVRPTW
The Capacitated Vehicle Routing Problem with Time Windows.
Read More »
PDP-VRP
The Pickup and Dropoff Vehicle Routing Problem.
Read More »
General Routing
Real-world problems don’t often fit their academic definitions.
Read More »