IJSRP, Volume 5, Issue 6, June 2015 Edition [ISSN 2250-3153]
Sandeep Kumar, Jitendra Kurmi, Sudhanshu P. Tiwari
Travelling salesman problem (TSP) is one of the most popular real world combinatorial optimization problem in which we have to find a shortest possible tour that visits each city exactly once and come back to starting city. It ranges among NP hard problem so it is often used as a benchmark for optimization techniques. In this paper a hybrid of Ant Colony Optimization (ACO) and Cuckoo Search (CS) algorithm is proposed for travelling salesman problem. ACO is good metaheuristic algorithm but drawback of this algorithm is that, the ant will walk through the path where the chemical substances called pheromone density is high. It makes the whole process slow hence CS is employed to carry out the problem of local search of ACO. Cuckoo search uses single parameter apart from the population size because of this reason it works efficiently and performs local search more efficiently. The performance of new hybrid algorithm is compared with ACO. The result shows that new hybrid algorithm is better and efficient than simple ACO algorithm.