A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem

Authors:
Artur Pessoa;Marcus Poggi De Aragão;Eduardo Uchoa
Affiliations:
Departamento de Engenharia de Produção, Universidade Federal Fluminense, Brazil;Departamento de Informática, Pontificia Universidade Católica do Rio de Janeiro, Brazil;Departamento de Engenharia de Produção, Universidade Federal Fluminense, Brazil
Venue:
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Year:
2007

Citing 7
Cited 1

A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet

Future Generation Computer Systems - Special issue: Bio-inspired solutions to parallel processing problems
A tabu search heuristic for the heterogenous fleet vehicle routing problem

Computers and Operations Research
A new branch-and-cut algorithm for the capacitated vehicle routing problem

Mathematical Programming: Series A and B
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem

Mathematical Programming: Series A and B
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A column generation approach to the heterogeneous fleet vehicle routing problem

Computers and Operations Research
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation

Mathematical Programming: Series A and B

Review: Industrial aspects and literature survey: Fleet composition and routing

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have various capacities and fixed costs. The columns in the formulation are associated to q-routes, a relaxation of capacitated elementary routes that makes the pricing problem solvable in pseudopolynomial 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 up to 75 vertices were solved to optimality, a major improvement with respect to previous algorithms.