Rank-based memetic algorithm for capacitated arc routing problems

HighlightsThe concepts of Rank Number and Rank Count are proposed to shed light onto the edge selection rules.The Rank-based Neighborhood Search (RENS) operator is introduced.Two rules, mapping rule and move rule, are constructed to explain work of virtual backtracking.The experimental results show that RMA performs very well. The capacitated arc routing problem (CARP) has garnered much attention recently, owing to its wide range of applications in the real world. This study describes an efficient memetic algorithm for solving CARP. First, the concepts of Rank Number (RankNo), and Rank Count (RankCount) are proposed, to shed light onto the edge selection rules. Then, the essential backbone of the algorithm, the Rank-based Neighborhood Search (RENS) operator, is introduced. Based on these above-mentioned concepts, methods relating to selection and evaluation of edge(s) are designed to make local search more effective. Two rules, namely mapping rule (MAR) and move rule (MOR), are constructed explain the working of the RENS operator. Finally, this algorithm is tested on seven famous benchmark sets. The experimental results show that it has the better performance than two compared state-of-the-art algorithms.

[1]  Pablo Moscato,et al.  Handbook of Memetic Algorithms , 2011, Studies in Computational Intelligence.

[2]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

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

[4]  Dirk Sudholt,et al.  Hybridizing Evolutionary Algorithms with Variable-Depth Search to Overcome Local Optima , 2011, Algorithmica.

[5]  Anand Subramanian,et al.  Improved bounds for large scale capacitated arc routing problem , 2013, Comput. Oper. Res..

[6]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[7]  Dirk Sudholt,et al.  The impact of parametrization in memetic evolutionary algorithms , 2009, Theor. Comput. Sci..

[8]  Dong Zhou,et al.  Translation techniques in cross-language information retrieval , 2012, CSUR.

[9]  Xin Yao,et al.  Simulated annealing with extended neighbourhood , 1991, Int. J. Comput. Math..

[10]  Bruce L. Golden,et al.  Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[11]  Xin Yao,et al.  A new evolutionary approach to cutting stock problems with and without contiguity , 2002, Comput. Oper. Res..

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

[13]  Christian Prins,et al.  A Memetic Algorithm Solving the VRP, the CARP and General Routing Problems with Nodes, Edges and Arcs , 2005 .

[14]  Marjan Mernik,et al.  Exploration and exploitation in evolutionary algorithms: A survey , 2013, CSUR.

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

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

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

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

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

[20]  Marcus Poggi de Aragão,et al.  A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem , 2011, SEA.

[21]  John R. Current,et al.  An improved ant colony optimization based algorithm for the capacitated arc routing problem , 2010 .

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

[23]  Xiaodong Li,et al.  Cooperative Coevolution With Route Distance Grouping for Large-Scale Capacitated Arc Routing Problems , 2014, IEEE Transactions on Evolutionary Computation.

[24]  Yew-Soon Ong,et al.  A Probabilistic Memetic Framework , 2009, IEEE Transactions on Evolutionary Computation.

[25]  Alain Hertz,et al.  A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem , 2001, Transp. Sci..

[26]  Chee Keong Kwoh,et al.  Feasibility Structure Modeling: An Effective Chaperone for Constrained Memetic Algorithms , 2010, IEEE Transactions on Evolutionary Computation.

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

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