Glossary · approach
VRP
The decision of which vehicles, leaving from one or more depots, visit which customers in which order.
Vehicle Routing ProblemVRPTW (with Time Windows)
VRP (Vehicle Routing Problem) is the mathematical formulation of the daily routing decision for a fleet. The decision: which vehicle goes to which customer in which order. Constraints include vehicle capacity, driver shifts, customer demand. With delivery time windows added, it becomes VRPTW — the canonical decision for last-mile delivery businesses (parcel, grocery, beverage distribution).
Örnek
5 vans, 80 customers, each with a stated time window. Which customer goes on which van in what order, so every window holds and total kilometers are minimized?
Where this term appears
- Problems From One Node to Another — How Do I Compute the Shortest Path on a Weighted Graph?
- Problems How Much Cash in Which ATM, How Often to Refill — Balancing Empty-ATM Complaints Against High Immobilisation Cost
- Problems One Vehicle, Many Stops — In What Order Should I Visit Them All to Minimize Total Distance?
- Problems Several Vehicles, Many Customers — Which Vehicle in Which Sequence, Capacity Not Exceeded, Total Distance Minimum?
- Problems Which SKU on Which Shelf, and Along What Route Should the Picker Walk?
- Problems Which Student to Which Stop, and Which Bus in Which Order?
- Problems Which Van to Which Customer, at What Time?