definition · term 23 of 25
vehicle routing problem (VRP).
Finding routes for a fleet that serves a set of locations at least total distance or cost, within the rules.
worked examplefour vehicles, forty stopsEach stop has a time window and a demand, each vehicle a capacity. The plan assigns stops to vehicles and orders them, with the fewest kilometres that keep every window.
in plain language
The VRP and its variants, such as capacitated routing with time windows (CVRPTW) or pickup and delivery (PDPTW), are core problems of logistics. The number of possible plans grows factorially with the number of stops. Exact approaches use MIP with branch and cut; heuristics trade the bound for speed.
vehicle routing problem, on your own decision.
Bring one recurring decision. Your planners see the terms of this glossary applied to their own rules and data.
- Glossary
- all 25 terms, a to z
- Problem types
- the decisions kint solves
- Comparisons
- kint next to other approaches
- Contact
- hello@kint.pro