Decomposing Large-Scale Capacitated Arc Routing Problems using a random route grouping method

In this paper, a simple but effective Random Route Grouping (RRG) scheme is developed to decompose the LargeScale Capacitated Arc Routing Problem (LSCARP). A theoretical analysis is given to show that the decomposition is guaranteed to be improved by RRG along with the improvement of the best-sofar solution during the search process. Then, RRG is combined with a cooperative co-evolution model to solve LSCARP. The experimental results on the EGL-G LSCARP set showed that given the same computational budget, the proposed approach obtained much better results than its counterpart without using decomposition.

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

[2]  Xin Yao,et al.  Robust Solution of Salting Route Optimisation Using Evolutionary Algorithms , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[3]  M. Dror.  Arc Routing : Theory, Solutions and Applications , 2000 .

[4]  Xiaodong Li,et al.  Cooperative Co-evolution with delta grouping for large scale non-separable function optimization , 2010, IEEE Congress on Evolutionary Computation.

[5]  Ángel Corberán,et al.  The Capacitated Arc Routing Problem: Lower bounds , 1992, Networks.

[6]  Xin Yao,et al.  Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem , 2011, IEEE Transactions on Evolutionary Computation.

[7]  Ah-Hwee Tan,et al.  Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem , 2010, IEEE Congress on Evolutionary Computation.

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

[9]  Xin Yao,et al.  Robust Salting Route Optimization Using Evolutionary Algorithms , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[10]  Xin Yao,et al.  A Global Repair Operator for Capacitated Arc Routing Problem , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[11]  Yi Mei,et al.  Memetic algorithm with heuristic candidate list strategy for Capacitated Arc Routing Problem , 2010, IEEE Congress on Evolutionary Computation.

[12]  Xiaodong Li,et al.  Cooperative Co-evolution for large scale optimization through more frequent random grouping , 2010, IEEE Congress on Evolutionary Computation.

[13]  Luc Muyldermans,et al.  A guided local search heuristic for the capacitated arc routing problem , 2003, Eur. J. Oper. Res..

[14]  Xin Yao,et al.  Improved memetic algorithm for Capacitated Arc Routing Problem , 2009, 2009 IEEE Congress on Evolutionary Computation.

[15]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[16]  Xiaomeng Chen.  MAENS+: A Divide-and-Conquer Based Memetic Algorithm for Capacitated Arc Routing Problem , 2011, 2011 Fourth International Symposium on Computational Intelligence and Design.

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

[18]  Xin Yao,et al.  Large scale evolutionary optimization using cooperative coevolution , 2008, Inf. Sci..

[19]  Richard F. Hartl,et al.  A variable neighborhood search for the capacitated arc routing problem with intermediate facilities , 2008, J. Heuristics.

[20]  Feng Chu,et al.  A Scatter Search for the periodic capacitated arc routing problem , 2006, Eur. J. Oper. Res..

[21]  Xiaodong Li,et al.  Cooperatively Coevolving Particle Swarms for Large Scale Optimization , 2012, IEEE Transactions on Evolutionary Computation.

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

[23]  Richard W. Eglese,et al.  A deterministic tabu search algorithm for the capacitated arc routing problem , 2008, Comput. Oper. Res..

[24]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[26]  Peter J. Rousseeuw,et al.  Clustering by means of medoids , 1987 .