Home > Research > Publications & Outputs > On matchings, T-joins and arc routing problems

Electronic data

  • arps-and-matchings

    Accepted author manuscript, 386 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

View graph of relations

On matchings, T-joins and arc routing problems

Research output: Contribution to journalJournal articlepeer-review

E-pub ahead of print
<mark>Journal publication date</mark>5/03/2021
<mark>Journal</mark>Networks
Publication StatusE-pub ahead of print
Early online date5/03/21
<mark>Original language</mark>English

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.