Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
Jésica de Armas,
Peter Keenan (),
Angel Juan and
Seán McGarraghy ()
Additional contact information
Peter Keenan: University College Dublin
Seán McGarraghy: University College Dublin
Annals of Operations Research, 2019, vol. 273, issue 1, No 5, 135-162
Abstract:
Abstract This paper discusses the Time Capacitated Arc Routing Problem (TCARP) and introduces a heuristic and a metaheuristic algorithm for solving large-size instances of it. The TCARP is a realistic extension of the Capacitated Arc Routing Problem in which edge-servicing and edge-traversing costs, as well as vehicle capacities, are all time-based—i.e., given in time units. Accordingly, the TCARP goal is to minimise the total time employed in servicing the required edges, for which other edges might need to be traversed too. According to the numerical experiments carried out, the proposed heuristic is able to provide real-time results of high quality even for the largest instances considered. Likewise, the proposed metaheuristic outperforms other existing approaches, both in quality as well as in computing times.
Keywords: Capacitated arc routing problem; Time-based capacities; Biased randomisation; Simulated annealing; Metaheuristics (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)
Downloads: (external link)
http://link.springer.com/10.1007/s10479-018-2777-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:273:y:2019:i:1:d:10.1007_s10479-018-2777-3
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-018-2777-3
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().