A biased-randomised iterated local search for the team orienteering arc routing problem allowing different origin and destination

Xabier A. Martin (), Peter Keenan (), Javier Panadero (), Sean McGarraghy () and Angel A. Juan ()
Additional contact information
Xabier A. Martin: Universitat Politècnica de València
Peter Keenan: University College Dublin
Javier Panadero: Universitat Autònoma de Barcelona
Sean McGarraghy: University College Dublin
Angel A. Juan: Universitat Politècnica de València

Journal of Heuristics, 2025, vol. 31, issue 2, No 7, 27 pages

Abstract: Abstract In this paper, we consider the hybridisation of the team orienteering problem and the arc routing problem, the so-called team orienteering arc routing problem (TOARP). This problem has recently raised interest among researchers and practitioners as it can model new routing problems involving unmanned aerial vehicles or other types of electric vehicles. In the TOARP, a fixed fleet of vehicles, initially located at a depot, has to collect as much reward as possible from visiting a set of arcs, while they must visit a set of required arcs. At the same time, they must return to the depot on or before a given deadline (which can be time-based or distance-based). In this paper, we explore an extension of the TOARP in which the origin depot and the destination depot may be different nodes in a network. To solve this version of the problem, we propose a novel biased-randomised iterated local search algorithm. Computational results show the capability, efficiency and robustness of our approach, which provides competitive solutions to the TOARP in short computing times and outperforms some of the best-known solution approaches in the literature.

Keywords: Arc routing problem; Team orienteering problem; Biased randomisation; Iterated local search (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10732-025-09559-0 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:joheur:v:31:y:2025:i:2:d:10.1007_s10732-025-09559-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732

DOI: 10.1007/s10732-025-09559-0

Access Statistics for this article

Journal of Heuristics is currently edited by Manuel Laguna

More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().