Memetic algorithm with adaptive local search for Capacitated Arc Routing Problem

The Capacitated Arc Routing Problem (CARP) is a challenging combinatorial optimization problem with wide real world applications. Since CARP is NP-hard, many heuristic and meta-heuristic approaches have been applied to solve CARP. In this paper, a novel extension memetic approach, named MAENS-Pls is proposed to improve the state-of-the-art algorithm — Memetic Algorithm with Extended Neighbourhood Search (MAENS) for CARP, in which using an adaptive probability to optimize the frequency and depth of local search. Based on the parameter optimization on all the 8 instances, experimental studies show that the proposed algorithm can significantly improve the average performance of MAENS, and there is an increase in the robust stability and convergence reliability. Furthermore, 4 new best known solutions are found by the proposed algorithm.

[1]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[2]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[3]  Richard W. Eglese,et al.  Routeing Winter Gritting Vehicles , 1994, Discret. Appl. Math..

[4]  Philippe Lacomme,et al.  Competitive Memetic Algorithms for Arc Routing Problems , 2004, Ann. Oper. Res..

[5]  Marcus Gallagher,et al.  Statistical Racing Techniques for Improved Empirical Evaluation of Evolutionary Algorithms , 2004, PPSN.

[6]  E. Dijkgraaf,et al.  Fair competition in the refuse collection market? , 2007 .

[7]  Andie Pramudita Saidhidayat.  CAPACITATED ARC ROUTING PROBLEMS IN OPENING ACCESS BY DEBRIS COLLECTION OPERATION IN DISASTERS , 2013 .

[8]  Alireza Eydi,et al.  A novel heuristic method to solve the capacitated arc routing problem , 2012 .

[9]  Dirk Sudholt.  Parametrization and Balancing Local and Global Search , 2012, Handbook of Memetic Algorithms.

[10]  Moshe Dror,et al.  Routing electric meter readers , 1979, Comput. Oper. Res..

[11]  G. Ulusoy.  The fleet size and mix problem for capacitated arc routing , 1985 .

[12]  Shuangshuang Han,et al.  Parallel vehicles based on the ACP theory: Safe trips via self-driving , 2017, 2017 IEEE Intelligent Vehicles Symposium (IV).

[13]  Xiang Cheng,et al.  A novel forwarding method for full-duplex two-way relay networks , 2017, China Communications.

[14]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

[15]  Li Li,et al.  Steps toward Parallel Intelligence , 2016 .

[16]  Christopher M. Bishop,et al.  A New Framework for Machine Learning , 2008, WCCI.

[17]  Jian Yang,et al.  Network softwarization and parallel networks: beyond software-defined networks , 2016, IEEE Network.

[18]  Xin Yao,et al.  Diversity-Driven Selection of Multiple Crossover Operators for the Capacitated Arc Routing Problem , 2014, EvoCOP.

[19]  Xin Yao,et al.  Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems , 2009, IEEE Transactions on Evolutionary Computation.