Volume 55, Number 2, March-April 2021
|Page(s)||639 - 652|
|Published online||31 March 2021|
Open Capacitated ARC routing problem by Hybridized Ant Colony Algorithm
Department of Computer Science, Lebanese University, Beirut, Lebanon
2 Normandie University, 25 rue Philippe Lebon, Le Havre, France
Accepted: 2 March 2021
The Open Capacitated Arc Routing Problem OCARP is a well-known NP-hard real-world combinatorial optimization problem. It consists of determining optimal routes for vehicles in a given service area at a minimal cost distance. The main real application for OCARP is the Meter Reader Routing Problem (MRRP). In MRRP problem, each worker in the electric (or gas) company must visit and read the electric (or gas) meters to a set of customers by starting his route from the first customer on his visit list and finishing with the last one. The worker leaves where he wants once all the associated customers have been visited. In this paper, a metaheuristic called an Hybridized Ant Colony Algorithm (HACA) is developed and hybridized with a local search algorithm that involves the 2-opt, Swap, Relocate and Cross-exchange moves to solve OCARP problem. Computational results conducted on five different sets of OCARP-instances showed that our proposed algorithm HACA has reached good and competitive results on benchmark instances for the problem.
Mathematics Subject Classification: 90C32 / 90C26 / 90C59
Key words: Open Capacitated Arc Routing Problem / metaheuristic / Ant Colony Algorithm / local search / Simulated Annealing
© EDP Sciences, ROADEF, SMAI 2021
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.