Skip to main content
Book Chapter

New heuristics for the vehicle routing problem

Springer US, (2005), 279-297
DOI: 10.1007/0-387-24977-X_9
152Citations
Citations of this article
91Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter reviews some of the best metaheuristics proposed in recent years for the Vehicle Routing Problem. These are based on local search, on population search and on learning mechanisms. Comparative computational results are provided on a set of 34 benchmark instances. © 2005 Springer Science+Business Media, Inc.

Cite

CITATION STYLE

APA

Cordeau, J. F., Gendreau, M., Hertz, A., Laporte, G., & Sormany, J. S. (2005). New heuristics for the vehicle routing problem. In Logistics Systems: Design and Optimization (pp. 279–297). Springer US. https://doi.org/10.1007/0-387-24977-X_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free