An Improved Cuckoo Search Algorithm With Stud Crossover for Chinese TSP Problem

Abstract

The travelling salesman problem (TSP) is an NP-hard problem in combinatorial optimization. It has assumed significance in operations research and theoretical computer science. The problem was first formulated in 1930 and since then, has been one of the most extensively studied problems in optimization. In fact, it is used as a benchmark for many optimization methods. This paper represents a new method to addressing TSP using an improved version of cuckoo search (CS) with Stud (SCS) crossover operator. In SCS method, similar to genetic operators used in various metaheuristic algorithms, a Stud crossover operator that is originated from classical Stud genetic algorithm, is introduced into the CS with the aim of improving its effectiveness and reliability while dealing with TSP. Various test functions had been used to test this approach, and used subsequently to find the shortest path for Chinese TSP (CTSP). Experimental results presented clearly demonstrates SCS as a viable and attractive addition to the portfolio of swarm intelligence techniques.