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

Research

Associated organisational units

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:

Keywords

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Fast upper and lower bounds for a large-scale real-world arc routing problem. / Boyacı, Burak; Dang, Thu; Letchford, Adam.
In: Networks, Vol. 81, No. 1, 31.01.2023, p. 107-124.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Boyacı, B, Dang, T & Letchford, A 2023, 'Fast upper and lower bounds for a large-scale real-world arc routing problem', Networks, vol. 81, no. 1, pp. 107-124. https://doi.org/10.1002/net.22120

APA

Boyacı, B., Dang, T., & Letchford, A. (2023). Fast upper and lower bounds for a large-scale real-world arc routing problem. Networks, 81(1), 107-124. https://doi.org/10.1002/net.22120

Vancouver

Boyacı B, Dang T, Letchford A. Fast upper and lower bounds for a large-scale real-world arc routing problem. Networks. 2023 Jan 31;81(1):107-124. Epub 2022 Aug 6. doi: 10.1002/net.22120

Author

Boyacı, Burak ; Dang, Thu ; Letchford, Adam. / Fast upper and lower bounds for a large-scale real-world arc routing problem. In: Networks. 2023 ; Vol. 81, No. 1. pp. 107-124.

Bibtex

@article{fe8762895b514762975c3da627cd2011,
title = "Fast upper and lower bounds for a large-scale real-world arc routing problem",
abstract = "Arc routing problems (ARPs) are a special kind of vehicle routing problem, 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 10 000 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.",
keywords = "vehicle routing, arc routing, combinatorial optimisation, integer programming",
author = "Burak Boyacı and Thu Dang and Adam Letchford",
year = "2023",
month = jan,
day = "31",
doi = "10.1002/net.22120",
language = "English",
volume = "81",
pages = "107--124",
journal = "Networks",
issn = "0028-3045",
publisher = "Blackwell-Wiley",
number = "1",

}

RIS

TY - JOUR

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

AU - Boyacı, Burak

AU - Dang, Thu

AU - Letchford, Adam

PY - 2023/1/31

Y1 - 2023/1/31

N2 - Arc routing problems (ARPs) are a special kind of vehicle routing problem, 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 10 000 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.

AB - Arc routing problems (ARPs) are a special kind of vehicle routing problem, 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 10 000 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.

KW - vehicle routing

KW - arc routing

KW - combinatorial optimisation

KW - integer programming

U2 - 10.1002/net.22120

DO - 10.1002/net.22120

M3 - Journal article

VL - 81

SP - 107

EP - 124

JO - Networks

JF - Networks

SN - 0028-3045

IS - 1

ER -