DocumentCode :
2186472
Title :
Introducing Adaptive Artificial Bee Colony algorithm and using it in solving traveling salesman problem
Author :
Rekaby, Amr ; Youssif, A.A. ; Sharaf Eldin, A.
Author_Institution :
Fac. of Comput. & Inf., Helwan Univ., Cairo, Egypt
fYear :
2013
fDate :
7-9 Oct. 2013
Firstpage :
502
Lastpage :
506
Abstract :
Artificial Bee colony algorithm is a modern swarm intelligence algorithm. This paper proposes a modified version of artificial bee colony algorithm called “Adaptive Artificial Bee Colony” (AABC). This paper compares between standard bee colony algorithm and the proposed adaptive bee colony algorithm through traveling salesman problem. Traveling salesman problem is one of the most common problems in the searching techniques evaluation, so the paper considers it as an experimental case for the algorithms´ performance discrimination. The experiments were repeated across different benchmarks. The proposed adaptive artificial bee colony algorithm presents more efficiency than standard artificial bee colony algorithm. The final solution fitness value is enhanced by around 8% in adaptive artificial bee colony algorithm comparing to standard artificial bee colony algorithm´s solution.
Keywords :
ant colony optimisation; search problems; travelling salesman problems; AABC; adaptive artificial bee colony algorithm; algorithm performance discrimination; searching techniques evaluation; standard artificial bee colony algorithm; swarm intelligence algorithm; traveling salesman problem; Algorithm design and analysis; Approximation algorithms; Benchmark testing; Cities and towns; Heuristic algorithms; Optimization; Traveling salesman problems; Artificial bee colony algorithm; adaptive artificial bee colony algorithm; traveling salesman problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Science and Information Conference (SAI), 2013
Conference_Location :
London
Type :
conf
Filename :
6661785
Link To Document :
بازگشت