Authors: Aziz Ouaarab Belaïd Ahiod XinShe Yang
Publish Date: 2013/04/11
Volume: 24, Issue: 7-8, Pages: 1659-1669
Abstract
In this paper we present an improved and discrete version of the Cuckoo Search CS algorithm to solve the famous traveling salesman problem TSP an NPhard combinatorial optimisation problem CS is a metaheuristic search algorithm which was recently developed by XinShe Yang and Suash Deb in 2009 inspired by the breeding behaviour of cuckoos This new algorithm has proved to be very effective in solving continuous optimisation problems We now extend and improve CS by reconstructing its population and introducing a new category of cuckoos so that it can solve combinatorial problems as well as continuous problems The performance of the proposed discrete cuckoo search DCS is tested against a set of benchmarks of symmetric TSP from the wellknown TSPLIB library The results of the tests show that DCS is superior to some other metaheuristics
Keywords: