Optimization Online


A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem

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

Abstract: This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The columns in the formulation are associated to q-routes, a relaxation of capacitated elementary routes that makes the pricing problem solvable in pseudo-polynomial time. Powerful new families of cuts are also proposed, which are expressed over a very large set of variables. Those cuts do not increase the complexity of the pricing subproblem. Experiments are reported where instances with up to 75 vertices were solved to optimality, a major improvement with respect to previous algorithms.

Keywords: vehicle routing, cutting, pricing

Category 1: Combinatorial Optimization

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

Citation: To appear in Networks (submitted July, 2007; accepted January 2008)

Download: [PDF]

Entry Submitted: 06/10/2008
Entry Accepted: 06/10/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