Robust Branch-Cut-and-Price algorithms for vehicle routing problems

45Citations
Citations of this article
60Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter presents techniques for constructing robust Branch-Cut-and-Price algorithms on a number of Vehicle Routing Problem variants. The word "robust" stresses the effort of controlling the worst-case complexity of the pricing subproblem, keeping it pseudo-polynomial. Besides summarizing older research on the topic, some promising new lines of investigation are also presented, specially the development of new families of cuts over large extended formulations. Computational experiments over benchmark instances from ACVRP, COVRP, CVRP and HFVRP variants are provided. © Springer Science+Business Media, LLC 2008.

Cite

CITATION STYLE

APA

Pessoa, A., de Aragão, M. P., & Uchoa, E. (2008). Robust Branch-Cut-and-Price algorithms for vehicle routing problems. Operations Research/ Computer Science Interfaces Series, 43, 297–325. https://doi.org/10.1007/978-0-387-77778-8_14

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