Abstract The basic problem of vehicle routing is a classical operations research problem, known to be NP-hard Leung et al., Eur J Op Res 225(2): 199–210, 2013, [64] and called the vehicle routing problem (VRP) or capacitated VRP (CVRP).It consists in determining a least-cost set of routes from a depot for a fleet of capacitated vehicles in order to meet the demands of a set of customers.
Metaheuristics for Vehicle Routing Problems
Metaheuristics ; 407-437
01.01.2016
31 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
|Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
British Library Online Contents | 2006
|