scholarly journals A discrete artificial bee colony algorithm for the traveling salesman problem with time windows

2012 ◽  
Author(s):  
Korhan Karabulut ◽  
M. Fatih Tasgetiren
Keyword(s):  
Traveling Salesman Problem ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Time Windows ◽  
Traveling Salesman ◽  
Bee Colony ◽  
The Traveling Salesman Problem

Artificial Bee Colony Algorithm for Traveling Salesman Problem

2011 ◽  
Vol 314-316 ◽  
pp. 2191-2196 ◽  
Author(s):  
Wei Hua Li ◽  
Wei Jia Li ◽  
Yuan Yang ◽  
Hai Qiang Liao ◽  
Ji Long Li ◽  
...  
Keyword(s):  
Traveling Salesman Problem ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Nearest Neighbor ◽  
Traveling Salesman ◽  
Comparison Study ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Benchmark Instances ◽  
Bee Colony Optimization

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.

Sign in / Sign up

Export Citation Format

Share Document