A Novel Discrete Cuckoo Search Algorithm for Spherical Traveling Salesman Problem

Abstract

In this paper, we propose a novel discrete cuckoo search algorithm (DCS) for solving spherical Traveling Salesman Problem (TSP) where all points are on the surface of a sphere. The algorithm is based on the Levy flight behaviour and brood parasitic behaviour. The proposed algorithm applies study operator, the ”A” operator, and 3-opt operator to solutions in the bulletin board to speed up the convergence. Optimization results obtained for HA30 (an instance from TSPLIB) and different size problems are solved. Compared with GA, DCS is better and faster.