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

Boyacı, Burak and Dang, Thu and Letchford, Adam (2023) Fast upper and lower bounds for a large-scale real-world arc routing problem. Networks, 81 (1). pp. 107-124. ISSN 0028-3045

[thumbnail of arp-bounds]
Text (arp-bounds)
arp_bounds.pdf - Accepted Version
Available under License Creative Commons Attribution.

Download (424kB)

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.

Item Type:
Journal Article
Journal or Publication Title:
Networks
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700/1705
Subjects:
?? vehicle routingarc routingcombinatorial optimisationinteger programmingcomputer networks and communicationsinformation systems ??
ID Code:
173309
Deposited By:
Deposited On:
18 Jul 2022 10:10
Refereed?:
Yes
Published?:
Published
Last Modified:
20 May 2024 00:17