Parallel solution methods contribute to efficiently address large and complex combinatorial optimization problems, vehicle routing problems in particular. Parallel exact and heuristic methods for VRP variants are increasingly being proposed, and the pace seems to increase in recent years. "New" strategies have been proposed and many of the best known solutions to classical formulations have thus been obtained. This chapter describes and discusses the main strategies used to parallelize exact and metaheuristic solution methods for vehicle routing problems. It also provides an up-to-date survey of contributions to this rapidly evolving field and points to a number of promising research directions. © Springer Science+Business Media, LLC 2008.
CITATION STYLE
Crainic, T. G. (2008). Parallel solution methods for vehicle routing problems. Operations Research/ Computer Science Interfaces Series, 43, 171–198. https://doi.org/10.1007/978-0-387-77778-8_8
Mendeley helps you to discover research relevant for your work.