A discrete cuckoo search algorithm for travelling salesman problem

Abstract

In this paper, a novel discrete cuckoo search algorithm to solve the travelling salesman problem (TSP) is proposed. The algorithm is based on the continuous cuckoo search with brood parasitic behaviour and Levy flight. The algorithm does not save the initial routes in the bulletin board, until the segment between each city and adjacent cities partially are reversed. In each generation, an each cuckoo searches a new nest and abandons the old one to decrease the TSP route. In order to accelerate the discrete cuckoo search algorithm convergence speed, the proposed algorithm applies learning operator, ‘A’ operator and 3-opt operator to the bulletin board. The numerical experiment results show that the proposed algorithm can find the global optimal solution with rapid convergences and stable generation.