Exploiting sparsity in pricing routines for the capacitated arc routing problem

Letchford, A N and Oukil, A (2009) Exploiting sparsity in pricing routines for the capacitated arc routing problem. Computers and Operations Research, 36 (7). pp. 2320-2327. ISSN 0305-0548

[img]
Preview
PDF (Exploiting sparsity in pricing routines for the capacitated arc routing problem)
10.pdf - Submitted Version

Download (354kB)

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.

Item Type: Journal Article
Journal or Publication Title: Computers and Operations Research
Uncontrolled Keywords: /dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
Departments: Lancaster University Management School > Management Science
ID Code: 45150
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 18:27
Refereed?: Yes
Published?: Published
Last Modified: 18 Sep 2019 00:43
URI: https://eprints.lancs.ac.uk/id/eprint/45150

Actions (login required)

View Item View Item