Artificial Bee Colony Algorithm for Traveling Salesman Problem

Abstract:

Article Preview

By combining the modified nearest neighbor approach and the improved inver-over operation, an Artificial Bee Colony (ABC) Algorithm for Traveling Salesman Problem (TSP) is proposed in this paper. The heuristic approach was tested in some benchmark instances selected from TSPLIB. In addition, a comparison study between the proposed algorithm and the Bee Colony Optimization (BCO) model is presented. Experimental results show that the presented algorithm outperforms the BCO method and can efficiently tackle the small and medium scale TSP instances.

Info:

Periodical:

Advanced Materials Research (Volumes 314-316)

Edited by:

Jian Gao

Pages:

2191-2196

DOI:

10.4028/www.scientific.net/AMR.314-316.2191

Citation:

W. H. Li et al., "Artificial Bee Colony Algorithm for Traveling Salesman Problem", Advanced Materials Research, Vols. 314-316, pp. 2191-2196, 2011

Online since:

August 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.