A Hybrid Algorithm Using a Genetic Algorithm and Cuckoo Search Algorithm to Solve the Traveling Salesman Problem and its Application to Multiple Sequence Alignment
Alaa Abu-Srhan, Essam Al Daoud · International Journal of Advanced Science and Technology · 2013
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.