Discrete cuckoo search applied to capacitated arc routing problem

Capacitated arc routing problem (CARP) is known as NP-hard combinatorial optimisation problem. Cuckoo search (CS) is a recent meta-heuristic algorithm inspired by breeding the behaviour of cuckoos. CS has proved to be very effective in solving continuous and discrete optimisation problems. In discrete CS for solving CARP (DCSARP), the solution is encoded as a sequence of integer numbers that are positioned according to the order between their components. This discretisation is the key for using CS for solving combinatorial optimisation problems. The experimental results showed that DCSARP can be better than some meta-heuristics in relation to the quality of solution and robustness.

[1]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

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

[3]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[4]  Sergio Nesmachnow,et al.  An overview of metaheuristics: accurate and efficient methods for optimisation , 2014, Int. J. Metaheuristics.

[5]  Xin-She Yang,et al.  Discrete Cuckoo Search Applied to Job Shop Scheduling Problem , 2015, Recent Advances in Swarm Intelligence and Evolutionary Computation.

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

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

[8]  Gilbert Laporte,et al.  Arc Routing: Problems, Methods, and Applications , 2015 .

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

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

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

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

[13]  Yun-Chia Liang,et al.  Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem , 2006 .

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

[15]  Xin-She Yang,et al.  Discrete cuckoo search algorithm for the travelling salesman problem , 2014, Neural Computing and Applications.

[16]  Fred W. Glover,et al.  A hybrid metaheuristic approach for the capacitated arc routing problem , 2016, Eur. J. Oper. Res..

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

[18]  Gilbert Laporte,et al.  Improved lower bounds and exact algorithm for the capacitated arc routing problem , 2013, Math. Program..

[19]  A. Gandomi,et al.  Mixed variable structural optimization using Firefly Algorithm , 2011 .

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

[21]  Paulo Morelato França,et al.  GRASP with evolutionary path-relinking for the capacitated arc routing problem , 2013, Comput. Oper. Res..

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

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

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

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

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

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

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