A genetic local search algorithm for the multi-depot heterogeneous fleet capacitated arc routing problem

2012 ◽  
Vol 26 (4) ◽  
pp. 540-564 ◽  
Author(s):  
Tiantang Liu ◽  
Zhibin Jiang ◽  
Na Geng
Author(s):  
Bilal Kanso ◽  
Ali Kansou ◽  
Adnan Yassine

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 meta-heuristic 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.


2019 ◽  
Vol 478 ◽  
pp. 40-61 ◽  
Author(s):  
Jianyu Long ◽  
Zhenzhong Sun ◽  
Panos M. Pardalos ◽  
Ying Hong ◽  
Shaohui Zhang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document