Abstract In the standard, capacitated vehicle routing problem (VRP), a homogeneous fleet of vehicles services a set of customers from a single depot. Each vehicle has a fixed capacity that cannot be exceeded and each customer has a known demand that must be satisfied. Each customer must be serviced by exactly one visit of a single vehicle and each vehicle must leave and return to the depot. There may be route-length restrictions that limit the distance traveled by each vehicle. The objective is to generate a sequence of deliveries for each vehicle so that all customers are serviced and the total distance traveled by the fleet is minimized.
The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results
1998-01-01
24 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Online Contents | 2005
|Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
British Library Online Contents | 2005
|Metaheuristics for the Generalised Periodic Electric Vehicle Routing Problem
British Library Conference Proceedings | 2019
|Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
British Library Online Contents | 2006
|Algorithms for Solving the Vehicle Routing Problem with Drones
British Library Conference Proceedings | 2018
|