Optimization Online


Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems

Artur Pessoa(artur***at***producao.uff.br)
Marcus Poggi de Aragão(poggi***at***inf.puc-rio.br)
Eduardo Uchoa(uchoa***at***producao.uff.br)

Abstract: 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.

Keywords: Column generation; cutting plane algorithms; extended formulations

Category 1: Combinatorial Optimization

Category 2: Applications -- OR and Management Sciences (Transportation )

Citation: To appear as Chapter of "The Vehicle Routing Problem: Latest Advances and New Challenges", Springer. (Submitted January 2007, accepted July 2007).

Download: [PDF]

Entry Submitted: 06/10/2008
Entry Accepted: 06/11/2008
Entry Last Modified: 06/10/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society