Glossary
Vehicle Routing Problem (VRP)
The Vehicle Routing Problem (VRP) is the optimisation problem of assigning a set of deliveries to a fleet of vehicles and sequencing the stops to minimise cost while respecting constraints like capacity and time windows.
The VRP generalises the travelling salesman problem to multiple vehicles with real-world constraints: vehicle capacity, delivery time windows, driver working hours, and more. Solving it well is what separates efficient planning from wasted kilometres and missed slots.
Because the VRP is computationally hard, practical solvers use construction heuristics (such as nearest-neighbour) followed by local-search improvements (such as 2-opt and Or-opt). A TMS with a built-in VRP solver can automatically assign consignments to vehicles and drivers while respecting EU driving regulations.
Frequently asked questions
How does a VRP solver help logistics planners?
It automatically builds efficient trips — assigning consignments to vehicles and ordering stops — so planners spend less time on manual scheduling and the fleet drives fewer empty or unnecessary kilometres, all while respecting capacity, time windows, and driving-hour rules.
See Vehicle Routing Problem (VRP) in a real TMS
Transportial puts these concepts to work in one operational platform — planning, tracking, documents, and finance.