A Novel Discrete Cuckoo Search Algorithm for Spherical Traveling Salesman Problem

In this paper, we propose a novel discrete cuckoo search algorithm (DCS) for solving spherical Traveling Salesman Problem (TSP) where all points are on the surface of a sphere. The algorithm is based on the Levy flight behaviour and brood parasitic behaviour. The proposed algorithm applies study operator, the ”A” operator, and 3-opt operator to solutions in the bulletin board to speed up the convergence. Optimization results obtained for HA30 (an instance from TSPLIB) and different size problems are solved. Compared with GA, DCS is better and faster.

[1]  Kajal De,et al.  A Study of the Traveling Salesman Problem Using Fuzzy Self Organizing Map , 2008, 2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems.

[2]  Zbigniew Michalewicz,et al.  Inver-over Operator for the TSP , 1998, PPSN.

[3]  Xin-She Yang,et al.  Engineering optimisation by cuckoo search , 2010, Int. J. Math. Model. Numer. Optimisation.

[4]  Refael Hassin,et al.  Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP , 2008, Oper. Res. Lett..

[5]  Abdesslem Layeb,et al.  A novel quantum inspired cuckoo search for knapsack problems , 2011, Int. J. Bio Inspired Comput..

[6]  Sun Ying,et al.  A Particle Swarm Optimization Algorithm with Ant Search for Solving Traveling Salesman Problem , 2009, 2009 International Conference on Computational Intelligence and Security.

[7]  S. Nakayama,et al.  An Evolutionary Multiple Heuristic with Genetic Local Search for Solving TSP , 2008 .

[8]  Saeed Tavakoli,et al.  Improved Cuckoo Search Algorithm for Feed forward Neural Network Training , 2011 .

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

[10]  Gang Peng,et al.  Genetic Local Search Based on Genetic Recombination: A Case for Traveling Salesman Problem , 2004, PDCAT.

[11]  C. Lomnitz.  On the distribution of distances between random points on a sphere , 1995, Bulletin of the Seismological Society of America.

[12]  Luo Zhi-gang.  Spherical traveling salesman problem constant and its experimental analysis , 2011 .

[13]  Huang Zhen,et al.  A Fast Ant Colony Optimization Algorithm for Traveling Salesman Problems , 2009 .

[14]  Madan Lal Mittal,et al.  Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches , 2010 .

[15]  Ramin Rajabioun,et al.  Cuckoo Optimization Algorithm , 2011, Appl. Soft Comput..

[16]  Razamin Ramli,et al.  Recent advancements of nurse schedulingmodels and a potential path , 2010 .

[17]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[18]  Serdar Korukoglu,et al.  Genetic Algorithm Based Solution for TSP on a Sphere , 2009 .

[19]  Kikuo Fujimura,et al.  The SOM-TSP method for the three-dimension city location problem , 2002, Proceedings of the 9th International Conference on Neural Information Processing, 2002. ICONIP '02..

[20]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .