This article presents techniques for constructing robust Branch-Cutand-Price algorithms on a number of Vehicle Routing Problem variants. The word “robust” stress 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.
To appear as Chapter of "The Vehicle Routing Problem: Latest Advances and New Challenges", Springer. (Submitted January 2007, accepted July 2007).
View Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems