Abstract
The purpose of this paper is to develop a fast heuristic called FastCARP for the solution of large-scale capacitated arc routing problems, with or without duration constraints. This study is motivated by a waste collection problem in Denmark. After a preprocessing phase, FastCARP creates a giant tour, partitions the graph into districts, and construct routes within each district. It then iteratively merges and splits adjacent districts and reoptimises the routes. The heuristic was tested on 264 benchmark instances containing up to 11,640 nodes, 12,675 edges, 8581 required edges, and 323 vehicles. FastCARP was compared with an alternative heuristic called Base and with several Path-Scanning algorithms. On small graphs, it was better but slower than Base. On larger graphs, it was much faster and only slightly worse than Base in terms of solution quality. It also outperforms the Path-Scanning algorithms.
Original language | English |
---|---|
Pages (from-to) | 1877-1887 |
Number of pages | 11 |
Journal | Journal of the Operational Research Society |
Volume | 69 |
Issue number | 12 |
Early online date | 24 Jan 2018 |
DOIs | |
Publication status | Published - 2 Dec 2018 |
Bibliographical note
Funding Information:This project was funded by the Danish Council for Independent Research?Social Sciences. Project ?Transportation issues related to waste management? [grant number 4182?00021] and by the Natural Sciences and Engineering Research Council of Canada [grant number 2015?06189]. Thanks are due to the referees for their valuable comments.
Funding Information:
This project was funded by the Danish Council for Independent Research – Social Sciences. Project “Transportation issues related to waste management” [grant number 4182– 00021] and by the Natural Sciences and Engineering Research Council of Canada [grant number 2015–06189].
Publisher Copyright:
© 2018, © Operational Research Society 2018.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
Funding
This project was funded by the Danish Council for Independent Research?Social Sciences. Project ?Transportation issues related to waste management? [grant number 4182?00021] and by the Natural Sciences and Engineering Research Council of Canada [grant number 2015?06189]. Thanks are due to the referees for their valuable comments. This project was funded by the Danish Council for Independent Research – Social Sciences. Project “Transportation issues related to waste management” [grant number 4182– 00021] and by the Natural Sciences and Engineering Research Council of Canada [grant number 2015–06189].
Keywords
- Arc routing
- Denmark
- districts
- heuristics
- waste collection
ASJC Scopus subject areas
- Management Information Systems
- Strategy and Management
- Management Science and Operations Research
- Marketing