Exploiting sparsity in pricing routines for the capacitated arc routing problem

Adam N. Letchford, Amar Oukil

Research output: Contribution to journalArticle

29 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

Arc Routing
Routing Problem
Sparsity
Pricing
Vehicle routing
Set Covering Problem
Costs
Branch-and-cut
Column Generation
Sparse Graphs
Vehicle Routing Problem
Computational Results
Exact Solution
Routing
Model

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

Exploiting sparsity in pricing routines for the capacitated arc routing problem. / Letchford, Adam N.; Oukil, Amar.

In: Computers and Operations Research, Vol. 36, No. 7, 07.2009, p. 2320-2327.

Research output: Contribution to journalArticle

@article{7688f3f8602b4126b59bd03d0fdc0c86,
title = "Exploiting sparsity in pricing routines for the capacitated arc routing problem",
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.",
keywords = "Arc routing, Branch-cut-and-price, Column generation",
author = "Letchford, {Adam N.} and Amar Oukil",
year = "2009",
month = "7",
doi = "10.1016/j.cor.2008.09.008",
language = "English",
volume = "36",
pages = "2320--2327",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "7",

}

TY - JOUR

T1 - Exploiting sparsity in pricing routines for the capacitated arc routing problem

AU - Letchford, Adam N.

AU - Oukil, Amar

PY - 2009/7

Y1 - 2009/7

N2 - 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.

AB - 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.

KW - Arc routing

KW - Branch-cut-and-price

KW - Column generation

UR - http://www.scopus.com/inward/record.url?scp=57649233522&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57649233522&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2008.09.008

DO - 10.1016/j.cor.2008.09.008

M3 - Article

AN - SCOPUS:57649233522

VL - 36

SP - 2320

EP - 2327

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 7

ER -