Advertisement
Published in:
2008 | OriginalPaper | Chapter
Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
Authors : Artur Pessoa, Marcus Poggi de Aragão, Eduardo Uchoa
Published in: The Vehicle Routing Problem: Latest Advances and New Challenges
Publisher: Springer US
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.