Abstract
Traveling salesman problem (TSP) is a renowned NP-hard combinatorial optimization model which widely studied in the operation research community, such as transportation, logistics and industries areas. To address the problem effectively and efficiently, in this paper, a new meta-heuristic method, named hybrid learning artificial bee colony, is proposed based on the simply yet powerful swarm intelligence method, artificial bee colony algorithm. In HLABC, two different learning strategies are adopted in the employed bee phase and the onlooker bee phase. The updating mechanism for food source position is enhanced by employing global best food source. Experimental results on TSP problems with various city sizes indicate the effectiveness of the proposed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231–247 (1992)
Lawler, E.L.: The traveling salesman problem; a guided tour of combinatorial optimization. Math. Gaz. 58, 535–536 (1985)
Reinelt, G.: A traveling salesman problem library. J. Oper. Res. Soc. 11, 19–21 (1992)
Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the TSPTW. Inf. J. Comput. 14, 403–417 (2002)
Ascheuer, N., Fischetti, M., Grötschel, M.: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math. Program. 90, 475–506 (2001)
Chang, T.S., Wan, Y., Ooi, W.T.: A stochastic dynamic traveling salesman problem with hard time windows. Eur. J. Oper. Res. 198, 748–759 (2009)
Bellman, R., Roosta, M.: A stochastic travelling salesman problem. Stoch. Anal. Appl. 1, 159–161 (1983)
Majumdar, J., Bhunia, A.K.: Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J. Comput. Appl. Math. 235, 3063–3078 (2011)
Carpeneto, G., Toth, P.: Some new branching and bounding criteria for the asymmetric travelling salesman problem. Manag. Sci. 26, 736–743 (1980)
Moon, C., Kim, J., Choi, G., Seo, Y.: An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur. J. Oper. Res. 140, 606–617 (2002)
Bianco, L., Mingozzi, A., Ricciardelli, S.: The traveling salesman problem with cumulative costs. Networks 1990, 81–91 (1992)
Choi, I.C., Kim, S.I., Kim, H.S.: A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem. Comput. Oper. Res. 30, 773–786 (2003)
Jana, N., Rameshbabu, T.K., Kar, S.: Genetic algorithm for the travelling salesman problem using new crossover and mutation operators. In: Information and Management Sciences–Processings of the Ninth International Conference on Information and Management Sciences (2010)
Brezina Jr., I., Čičková, Z.: Solving the travelling salesman problem using the ant colony optimization. Int. Sci. J. Manag. Inf. Syst. 6, 10–14 (2011)
Manfrin, M., Birattari, M., Stützle, T., Dorigo, M.: Parallel ant colony optimization for the traveling salesman problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 224–234. Springer, Heidelberg (2006)
Mavrovouniotis, M., Yang, S.: Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors. Appl. Soft Comput. 13, 4023–4037 (2013)
Bouzidi, M., Riffi, M.E.: Discrete novel hybrid particle swarm optimization to solve travelling salesman problem. In: The Workshop on Codes, Cryptography and Communication Systems, pp. 17–20 (2014)
Zhong, W.L., Zhang, J., Chen, W.N.: A novel discrete particle swarm optimization to solve traveling salesman problem. In: IEEE Congress on Evolutionary Computation, 2007, CEC 2007, pp. 3283–3287 (2007)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (Abc) algorithm. J. Global Optim. 39, 459–471 (2007)
Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (Abc) algorithm and applications. Artif. Intell. Rev. 42, 21–57 (2014)
Alqattan, Z.N., Abdullah, R.: A hybrid artificial bee colony algorithm for numerical function optimization. Int. J. Mod. Phys. C 26, 127–132 (2015)
Taş, D., Gendreau, M., Jabali, O., Laporte, G.: The traveling salesman problem with time-dependent service times. Eur. J. Oper. Res. 248, 372–383 (2015)
Maity, S., Roy, A., Maiti, M.: An imprecise multi-objective genetic algorithm for uncertain constrained multi-objective solid travelling salesman problem. Expert Syst. Appl. 46, 196–223 (2015)
Zhu, G., Kwong, S.: Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl. Math. Comput. 217, 3166–3173 (2010)
Acknowledgment
This work was supported by the national natural science foundation of china (71501132, 71571120 and 71371127), and the Natural Science Foundation of Guangdong Province (2016A030310067 and 2015A030313556).
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Hu, G., Chu, X., Niu, B., Li, L., Lin, D., Liu, Y. (2016). An Augmented Artificial Bee Colony with Hybrid Learning for Traveling Salesman Problem. In: Huang, DS., Bevilacqua, V., Premaratne, P. (eds) Intelligent Computing Theories and Application. ICIC 2016. Lecture Notes in Computer Science(), vol 9771. Springer, Cham. https://doi.org/10.1007/978-3-319-42291-6_63
Download citation
DOI: https://doi.org/10.1007/978-3-319-42291-6_63
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42290-9
Online ISBN: 978-3-319-42291-6
eBook Packages: Computer ScienceComputer Science (R0)