JOURNAL ARTICLE
Artificial Bee Colony Algorithm for Traveling Salesman Problem
Wei LiWei Jia LiYuan YangHai Qiang LiaoJi Long LiXi Peng Zheng
Year: 2011 Journal: Advanced materials research Vol: 314-316 Pages: 2191-2196 Publisher: Trans Tech Publications
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.
Keywords:
Travelling salesman problem Artificial bee colony algorithm Benchmark (surveying) Mathematical optimization Heuristic Ant colony optimization algorithms Computer science Algorithm Mathematics
Metrics
23
Cited By
1.57
FWCI (Field Weighted Citation Impact)
20
Refs
0.86
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Metaheuristic Optimization Algorithms Research
Physical Sciences → Computer Science → Artificial Intelligence
Vehicle Routing Optimization Methods
Physical Sciences → Engineering → Industrial and Manufacturing Engineering
Robotic Path Planning Algorithms
Physical Sciences → Computer Science → Computer Vision and Pattern Recognition
Related Documents
JOURNAL ARTICLE
Parallel artificial bee colony algorithm for traveling salesman problem
Year: 2014 Pages: 501-505
JOURNAL ARTICLE
Solving Traveling Salesman Problem Using Artificial Bee Colony Algorithm
Journal: Computer Science and Technology Year: 2016 Pages: 989-995
JOURNAL ARTICLE
Parallel Artificial Bee Colony Algorithm for the Traveling Salesman Problem
Journal: Advanced materials research Year: 2013 Vol: 756-759 Pages: 3254-3259