Exploiting sparsity in pricing routines for the capacitated arc routing problem

Adam N. Letchford, Amar Oukil

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

The capacitated arc routing problem (CARP) is a well-known and fundamental vehicle routing problem. A promising exact solution approach to the CARP is to model it as a set covering problem and solve it via branch-cut-and-price. The bottleneck in this approach is the pricing (column generation) routine. In this paper, we note that most CARP instances arising in practical applications are defined on sparse graphs. We show how to exploit this sparsity to yield faster pricing routines. Extensive computational results are given.

Original languageEnglish
Pages (from-to)2320-2327
Number of pages8
JournalComputers and Operations Research
Volume36
Issue number7
DOIs
Publication statusPublished - Jul 2009

    Fingerprint

Keywords

  • Arc routing
  • Branch-cut-and-price
  • Column generation

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Cite this