A New Method Used for Traveling salesman problem Based on Discrete Artificial Bee Colony Algorithm

Lei Meng, Shoulin Yin, Xinyuan Hu

Abstract


We propose a new method based on discrete Artificial Bee Colony algorithm (DABC) for traveling salesman problem(TSP). We redefine the searching strategy and transforming mechanism of leading bees, following bees and scout bees according to discrete variables. The transition of swarm role is based on ratio factor of definition. leading bees use 2-Opt operator and learning operator to accelerate the convergence speed and to search the neighborhood. The searching of following bees introduce tabu table to improve the local refinement ability of the algorithm. Scouts bees define exclusive operation to maintain the diversity of population, so it is better to balance the exploration and exploitation ability of the algorithm. Finally, the experimental results show that the new algorithm can find relatively satisfactory solution in a short time, and improve the efficiency of solving the TSP.


Keywords


information system;Artificial

Full Text:

PDF


DOI: http://dx.doi.org/10.12928/telkomnika.v14i1.3169

Article Metrics

Abstract view : 106 times
PDF - 114 times

Refbacks



Copyright (c) 2016 Universitas Ahmad Dahlan

TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus, 9th Floor, LPPI Room
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120 ext. 4902, Fax: +62 274 564604

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

View TELKOMNIKA Stats