Beyond fifty years of vehicle routing: Insights into the history and the future
Claudia Archetti, Leandro C. Coelho, M. Grazia Speranza, Pieter Vansteenwegen
Abstract
Vehicle routing problems (VRPs) are a large class of well-studied and computationally hard combinatorial optimization problems. In the classical capacitated VRP, a fleet of homogeneous capacitated vehicles, that start and end their route at a depot, must satisfy customers’ demand at minimum cost. Many variants and extensions of this problem have been studied. In this paper, after discussing the capacitated VRP, we review the literature for the most-studied variants and extensions of the VRP and then focus on the most recent developments and trends.
Topics & Concepts
Vehicle routing problemComputer scienceOperations researchRouting (electronic design automation)HistoryEngineeringComputer networkVehicle Routing Optimization MethodsUrban and Freight Transport LogisticsTransportation and Mobility Innovations