Paper Title:
Artificial Bee Colony Algorithm for Traveling Salesman Problem
  Abstract

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)
Chapter
Digital Manufacture and Management
Edited by
Jian Gao
Pages
2191-2196
DOI
10.4028/www.scientific.net/AMR.314-316.2191
Citation
W. H. Li, W. J. Li, Y. Yang, H. Q. Liao, J. L. Li, X. P. Zheng, "Artificial Bee Colony Algorithm for Traveling Salesman Problem", Advanced Materials Research, Vols. 314-316, pp. 2191-2196, 2011
Online since
August 2011
Export
Price
$32.00
Share

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

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

Authors: Ling Ping Jiang
Chapter 1: Mechatronics
Abstract:The problem of airline maintenance scheduling is considered in this paper. A maintenance-scheduling model that can determine rational...
147
Authors: Ren Bin Xiao, Ying Cong Wang
Chapter 11: Methods and Algorithms for Processing and Analysis of Data
Abstract:It is the research hotspot for evolutionary algorithms to solve the contradiction between exploration and exploitation. Cellular artificial...
3168
Authors: Xin Zhang, Guo Chu Chen
Chapter 5: Algorithms, Computation Methods and their Applications
Abstract:In view of the traditional support vector machine (SVM) model in wind power prediction parameter selection problems, this paper introduced a...
417