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]](http://eprints.lancs.ac.uk/style/images/fileicons/application_pdf.png)
| PDF (Exploiting sparsity in pricing routines for the capacitated arc routing problem) - Draft Version Download (345Kb) | Preview |
Official URL: http://dx.doi.org/10.1016/j.cor.2008.09.008
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: | Article |
|---|---|
| Journal or Publication Title: | Computers and Operations Research |
| Uncontrolled Keywords: | arc routing ; column generation ; branch-cut-and-price |
| Subjects: | H Social Sciences > HB Economic Theory |
| Departments: | Lancaster University Management School > Management Science |
| ID Code: | 45150 |
| Deposited By: | ep_importer_pure |
| Deposited On: | 11 Jul 2011 19:27 |
| Refereed?: | Yes |
| Published?: | Published |
| Last Modified: | 27 Jul 2017 02:07 |
| Identification Number: | |
| URI: | http://eprints.lancs.ac.uk/id/eprint/45150 |
Actions (login required)
| View Item |
