A new hybrid artificial bee colony algorithm for the traveling salesman problem

2011 IEEE 3rd International Conference on Communication Software and Networks, ICCSN 2011

Volumn , Issue , 2011, Pages 155-159

  Zhang, Xiaoxia ^a   Bai, Qiuying ^a   Yun, Xiaoyan ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY LIAONING   (China)

Author keywords

Artificial bee colony; path relinking; traveling salesman problem

Indexed keywords

ARTIFICIAL BEE COLONIES; CRITERION FUNCTIONS; EVOLUTIONARY METHOD; HIGH QUALITY; HIGH-QUALITY SOLUTIONS; HYBRID ALGORITHMS; INITIAL SOLUTION; PATH RELINKING; REFERENCE SET; SEARCH SPACES; SOLUTION QUALITY; TRAVELING SALESMAN; UPDATING STRATEGY;

BENCHMARKING; COMMUNICATION; EVOLUTIONARY ALGORITHMS;

TRAVELING SALESMAN PROBLEM;

EID: 80053162734     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCSN.2011.6014240     Document Type: Conference Paper

References (18)

1. P.H.Siqueira. M.T.A.Steiner and S.Scheer." A new approach to solve the traveling salesman problem." Neurocomputing 70 (2007) 1013-1021.
2. F. Glover. "Tabu search-part II," ORSA Journal of Computing 12 (1) (1990) 4-32.
3. M.Mfenzeller and S. Wanger, "A self-adaptive model for selective pressure handling within the theory of genetic algorithms," EUROCAST 2003, Las Palmas de Gran Canaria, Spain, 2003. Lecture Notes in Computer Science 2809 (I) (2003) 384-393.
4. M.Budinich," A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing," Neural Computation 8 (1996) 416-424.
5. G.Liu, Y. He,Y.Fang and Y.Oiu," A novel adaptive search strategy of intensification and diversification in tabu search," in: Proceedings of Neural Networks and Signal Processing, Nanjing, China, 2003
6. R.Baraglia, Hidalgo, and R.Perego, "A Hybrid Heuristic for the Traveling Salesman Problem," IEEE Transactions on evolutionary computation 5 (6) (2001) 613-622.
7. D.Karaboga," An idea based on honey bee swarm for numerical optimization," Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey, 2005.
8. N. Karaboga,." A new design method based on artificial bee colony algorithm for digital IIR filters," Journal of the Franklin Institute 346 (4) (2009) 328-348.
9. N.Karaboga and B.Basturk, "On the performance of artificial bee colony (ABC) algorithm," Applied Soft Computing 8 (2008) 687-697.
10. L.P.Wong, M.Y.H., Low andC.S.Chong, " A Bee Colony Optimization Algorithm for Traveling Salesman Problem. AMS2008, Second Asia International Conference on Modelling & Simulation, (2008) 818-820.
11. S.Sundar and A. Singh, " A swarm intelligence approach to the quadratic minimum spanning tree problem," Information Sciences 180 (2010) 3 182-3191.
12. Q.KPan, M.FTasgetiren, P.N. Suganthan and TJChua, "A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem," Information Sciences (2010), doi: 10.1016/j.ins.2009.12.025.
13. Y.M Huang and lC.Lin," A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems," Expert Systems with Applications 38 (2011) 5438-5447.
14. M.Marti, M.Laguna and F.Glover, " Principles of scatter search," European Journal of Operational Research 169 (2006) 359-372.
15. F.Glover, M. Laguna and M.Marti," Fundamentals of Scatter Search and Path Relinking," Control and Cybernetics 39(3) (2000) 653-684.
16. N.Aras, B.J Oommen and J.KAltinel, "The Kohonen networkincorporating explicit statistics and its application to the traveling salesman problem," Neural Networks 12 (9) (1999) 1273-1284.
17. M Budinich, "A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing," Neural Computation 8 (1996) 416-424.
18. KS.Leung, H.DJin and Z.BXu, "An expanding self-organizing neural network for the traveling salesman proble," Neurocomputing 62 (2004) 267-292.