Login New user?  
01-Applied Mathematics & Information Sciences
An International Journal
               
 
 
 
 
 
 
 
 
 
 
 
 
 

Content
 

Volumes > Volume 07 > No. 2

 
   

A Novel Discrete Cuckoo Search Algorithm for Spherical Traveling Salesman Problem

PP: 777-784
Author(s)
Xinxin Ouyang, Yongquan Zhou, Qifang Luo, Huan Chen,
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 L´evy 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.

  Home   About us   News   Journals   Conferences Contact us Copyright naturalspublishing.com. All Rights Reserved