Improved memetic algorithm for Capacitated Arc Routing Problem

Capacitated Arc Routing Problem (CARP) has attracted much interest because of its wide applications in the real world. Recently, a memetic algorithm proposed by Lacomme et al. (LMA) has been demonstrated to be a competitive approach to CARP. The crossover operation of LMA is carried out based on an implicit representation scheme, while it conducts local search on the basis of an explicit representation scheme. Hence, the search process of LMA involves frequent switch between the spaces defined by the two representation schemes. However, a good solution in one space is not necessarily good in the other. In this paper, we show that the local search process of LMA might be ineffective due to such reason, and suggest adopting a more careful way to coordinate the local search. As a result, two new local search methods are proposed, which resulted in two improved LMA (ILMA) algorithms. Experimental results on benchmark instances of CARP showed that the ILMA significantly outperformed LMA in terms of solution quality, and sometimes even in terms of computational time. Furthermore, ILMA improved the best known solutions for 8 problem instances out of the total 24 instances.

[1]  Dino Ahr,et al.  Contributions to Multiple Postmen Problems , 2004 .

[2]  T. Schnier,et al.  Using multiple representations in evolutionary algorithms , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

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

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

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

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

[7]  Wen Lea Pearn,et al.  Approximate solutions for the capacitated arc routing problem , 1989, Comput. Oper. Res..

[8]  Richard W. Eglese,et al.  An Interactive Algorithm for Vehicle Routeing for Winter — Gritting , 1996 .

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

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

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

[12]  Roberto Baldacci,et al.  Exact methods based on node‐routing formulations for undirected arc‐routing problems , 2006, Networks.

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

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

[15]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

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

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

[18]  Richard W. Eglese,et al.  A tabu search based heuristic for arc routing with a capacity constraint and time deadline , 1996 .

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

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

[21]  Peter Greistorfer,et al.  A Tabu Scatter Search Metaheuristic for the Arc Routing Problem , 2002 .

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

[23]  Wen Lea Pearn,et al.  Augment-insert algorithms for the capacitated arc routing problem , 1991, Comput. Oper. Res..

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

[25]  Marcus Poggi de Aragão,et al.  Solving capacitated arc routing problems using a transformation to the CVRP , 2006, Comput. Oper. Res..