AN IMPROVED ARTIFICIAL BEE COLONY ALGORITHM WITH LOCAL SEARCH FOR TRAVELING SALESMAN PROBLEM

被引:17
作者
Kocer, Hasan Erdinc [1 ]
Akca, Melike Ruhan [2 ]
机构
[1] Selcuk Univ, Tech Educ Fac, TR-42003 Konya, Turkey
[2] Nazilli Vocat High Sch, Aydin, Turkey
关键词
traveling salesman problem; opt-2 local search; artificial bee colony algorithm; OPTIMIZATION;
D O I
10.1080/01969722.2014.970396
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This study aims to solve the traveling salesman problem for small, medium, and large traveling salesman problems taken from the TSPLIB with known solutions, by using an improved artificial bee colony algorithm that is a swarm intelligence-based heuristic algorithm. The improvement process is achieved by using a loyalty function that is used in bee colony optimization as a fitness function used in ABC algorithms. Obtained solutions are compared to solutions from the TSPLIB and the results of cunkas and ozsaglam's (2009) study, which includes the solutions for benchmark problems and cities and counties in Turkey according to the genetic algorithm and particle swarm optimization.
引用
收藏
页码:635 / 649
页数:15
相关论文
共 18 条
[1]  
Akay B., 2009, THESIS KAYSERI TURKE
[2]  
[Anonymous], 2001, P TRISTAN 4 TRIENN S
[3]  
[Anonymous], ADV INTELLIGENT SYST
[4]  
[Anonymous], P 2 AS INT C MOD SIM
[5]  
Aslantas V., 2010, INT S INN INT SYST A
[6]   New results on the old k-opt algorithm for the traveling salesman problem [J].
Chandra, B ;
Karloff, H ;
Tovey, C .
SIAM JOURNAL ON COMPUTING, 1999, 28 (06) :1998-2029
[7]   A COMPARATIVE STUDY ON PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHMS FOR TRAVELING SALESMAN PROBLEMS [J].
Cunkas, Mehmet ;
Ozsaglam, M. Yasin .
CYBERNETICS AND SYSTEMS, 2009, 40 (06) :490-507
[8]  
Fenglei L., 2007, SCIENCEPAPER ONLINE
[9]  
Karaboga D., 2011, 2011 International Symposium on Innovations in Intelligent Systems and Applications (INISTA 2011), P50, DOI 10.1109/INISTA.2011.5946125
[10]  
Karaboga D., 2005, IDEA BASED HONEY BEE