Home > Research > Publications & Outputs > Fast upper and lower bounds for a large-scale r...

Electronic data

  • arp-bounds

    Accepted author manuscript, 414 KB, PDF document

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

Links

Text available via DOI:

View graph of relations

Fast upper and lower bounds for a large-scale real-world arc routing problem

Research output: Contribution to Journal/MagazineJournal articlepeer-review

E-pub ahead of print
<mark>Journal publication date</mark>6/08/2022
<mark>Journal</mark>Networks
Publication StatusE-pub ahead of print
Early online date6/08/22
<mark>Original language</mark>English

Abstract

Arc Routing Problems (ARPs) are a special kind of Vehicle Routing Problem (VRP), in which the demands are located on edges or arcs, instead of nodes. There is a huge literature on ARPs, and a variety of exact and heuristic algorithms are available. Recently, however, we encountered some real-life ARPs with over ten thousand roads, which is much larger than those usually considered in the literature. For these problems, we develop fast upper- and lower-bounding procedures. We also present extensive computational results