Improved and Discrete Cuckoo Search for Solving the Travelling Salesman Problem

Improved and Discrete Cuckoo Search (DCS) algorithm for solving the famous travelling salesman problem (TSP), an NP-hard combinatorial optimization problem, is recently developed by Ouaarab, Ahiod, and Yang in 2013, based on the cuckoo search (CS), developed by Yang and Deb in 2009. DCS first reconstructs the population of CS by introducing a new category of cuckoos in order to improve its search efficiency, and adapts it to TSP based on the terminology used either in inspiration source of CS or in its continuous search space. The performance of the proposed DCS is tested against a set of benchmarks of symmetric TSP from the well-known TSPLIB library. The results of the tests show that DCS is superior to some other metaheuristics.

[1]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[2]  Xin-She Yang,et al.  Firefly Algorithms for Multimodal Optimization , 2009, SAGA.

[3]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

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

[5]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

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

[7]  Clifford T. Brown,et al.  Lévy Flights in Dobe Ju/’hoansi Foraging Patterns , 2007 .

[8]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[9]  E. Lawler,et al.  Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .

[10]  P. Lucic,et al.  Bee Colony Optimization: Principles and Applications , 2006, 2006 8th Seminar on Neural Network Applications in Electrical Engineering.

[11]  Zhihua Cui,et al.  Swarm Intelligence and Bio-Inspired Computation: Theory and Applications , 2013 .

[12]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[13]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[14]  Miroslaw Malek,et al.  Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem , 1990 .

[15]  Shyi-Ming Chen,et al.  Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques , 2011, Expert Syst. Appl..

[16]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[17]  Xin-She Yang,et al.  Engineering Optimization: An Introduction with Metaheuristic Applications , 2010 .

[18]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[19]  Suyanto,et al.  Evolutionary Discrete Firefly Algorithm for Travelling Salesman Problem , 2011, ICAIS.

[20]  Jan Karel Lenstra,et al.  Some Simple Applications of the Travelling Salesman Problem , 1975 .

[21]  Xin-She Yang,et al.  Engineering optimisation by cuckoo search , 2010 .

[22]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[23]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[24]  Amir Hossein Gandomi,et al.  Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems , 2011, Engineering with Computers.

[25]  Dusan Teodorovic,et al.  Bee Colony Optimization (BCO) , 2009, Innovations in Swarm Intelligence.

[26]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[27]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[28]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[29]  Li-Pei Wong,et al.  A Bee Colony Optimization Algorithm for Traveling Salesman Problem , 2008, 2008 Second Asia International Conference on Modelling & Simulation (AMS).

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

[31]  John J. Grefenstette,et al.  Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[32]  Xin-She Yang,et al.  Bat algorithm: a novel approach for global engineering optimization , 2012, 1211.6663.

[33]  Chunguang Zhou,et al.  Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[34]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

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

[36]  Xin-She Yang,et al.  Design optimization of truss structures using cuckoo search algorithm , 2013 .

[37]  Yanchun Liang,et al.  Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..

[38]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[39]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[40]  Jean-Yves Potvin,et al.  Genetic Algorithms for the Traveling Salesman Problem , 2005 .