On matchings, T-joins and arc routing problems

Boyacı, Burak and Dang, Thu and Letchford, Adam (2021) On matchings, T-joins and arc routing problems. Networks. ISSN 0028-3045 (In Press)

[img]
Text (arps-and-matchings)
arps_and_matchings.pdf - Accepted Version
Restricted to Repository staff only until 1 January 2050.
Available under License Creative Commons Attribution-NonCommercial.

Download (394kB)

Abstract

Matchings and T-joins are fundamental and much-studied concepts in graph theory and combinatorial optimisation. One important application of matchings and T-joins is in the computation of strong lower bounds for Arc Routing Problems (ARPs). An ARP is a special kind of vehicle routing problem, in which the demands are located along edges or arcs, rather than at nodes. We point out that the literature on applying matchings and T-joins to ARPs does not fully exploit the structure of real-life road networks. We propose some ways to exploit this structure. Computational results show significant running time improvements, without deteriorating the quality of the lower bounds.

Item Type:
Journal Article
Journal or Publication Title:
Networks
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700/1710
Subjects:
ID Code:
151744
Deposited By:
Deposited On:
15 Feb 2021 16:25
Refereed?:
Yes
Published?:
In Press
Last Modified:
22 Feb 2021 14:30