Title: A discrete cuckoo search algorithm for travelling salesman problem

Authors: Yongquan Zhou; Xinxin Ouyang; Jian Xie

Addresses: College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, China ' College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, China ' College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, China

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 Lévy 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.

Keywords: discrete cuckoo search; metaheuristics; 3-opt operator; travelling salesman problem; TSP.

DOI: 10.1504/IJCI.2014.064853

International Journal of Collaborative Intelligence, 2014 Vol.1 No.1, pp.68 - 84

Received: 12 Nov 2013
Accepted: 29 Dec 2013
Published online: 27 Sep 2014 *