A Hybrid Algorithm Using a Genetic Algorithm and Cuckoo Search Algorithm to Solve the Traveling Salesman Problem and its Application to Multiple Sequence Alignment

The traveling salesman problem (TSP) is one of the most studied in operations research and computer science. Research has led to a large number of techniques to solve this problem; in particular, genetic algorithms (GA) produce good results compared to other techniques. A disadvantage of GA, though, is that they easily become trapped in the local minima. In this paper, a cuckoo search optimizer (CS) is used along with a GA in order to avoid the local minima problem and to benefit from the advantages of both types of algorithms. A 2-opt operation was added to the algorithm to improve the results. The suggested algorithm was applied to multiple sequence alignment and compared with the previous algorithms.

[1]  Donald E. Grierson,et al.  Comparison among five evolutionary-based optimization algorithms , 2005, Adv. Eng. Informatics.

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

[3]  KarabogaDervis,et al.  A powerful and efficient algorithm for numerical function optimization , 2007 .

[4]  Xin-She Yang,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[5]  Xin-She Yang.  Harmony Search as a Metaheuristic Algorithm , 2009 .

[6]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[7]  Saeed Tavakoli,et al.  Improved Cuckoo Search Algorithm for Global Optimization , 2011 .

[8]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[9]  Gaston H. Gonnet,et al.  Evaluation Measures of Multiple Sequence Alignments , 2000, J. Comput. Biol..

[10]  Nitesh M. Sureja,et al.  An ACO Approach to Solve a Variant of TSP , 2012 .

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

[12]  P. Dhavachelvan,et al.  Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling , 2012 .

[13]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[14]  Weiwei Zhong.  Using traveling salesman problem algorithms to determine multiple sequence alignment orders , 2003 .

[15]  Nitesh M. Sureja,et al.  Random Travelling Salesman Problem using SA , 2012 .

[16]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[17]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[18]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[19]  Ivan Brezina.  Solving the Travelling Salesman Problem Using the Ant Colony Optimization , .

[20]  Buthainah Fahran Al-Dulaimi,et al.  Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA) , 2008 .