Abstract
This paper presents a new method called hybrid ant bee colony optimization (HABCO) for solving traveling salesman problem which combines ant colony system (ACS), bee colony optimization (BCO) and ELU-Ants. The agents, called ant-bees, are grouped into three types, scout, follower, recruiter at each stages as BCO algorithm. However, constructing tours such as choosing nodes, and updating pheromone are built by ACS method. To evaluate the performance of the proposed algorithm, HABCO is performed on several benchmark datasets and compared to ACS and BCO. The experimental results show that HABCO achieves the better solution, either with or without 2opt.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B 26(1), 2941 (1996)
Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 5366 (1997)
Stutzle, T., Hoos, H.H.: Improving the Ant System: A Detail Report on the MAXMIN Ant System. Technical Report. AIDA-96-12. FG Intellektik, FB Informatik, TU Darmstadt, Germany (1996)
Naimi, H.M., Taherinejad, N.: New robust and efficient ant colony algorithms: Using new interpretation of local updating process. Expert Systems with Applications 36(1), 481–488 (2009)
Chen, S.M., Chien, C.Y.: Parallelized genetic ant colony systems for solving the traveling salesman problem. Expert Systems with Applications 38(4), 3873–3883 (2011)
Chen, S.M., Chien, C.Y.: Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Systems with Applications 38(12), 14439–14450 (2011)
Sjoerd, V.D.Z., Marques, C.: Ant colony optimization for job shop scheduling. In: Proceedings of Workshop on Genetic Algorithms and Artificial Life GAAL (1999)
Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50(2), 167–176 (1999)
Lucic, P.: Modeling transportation problems using concepts of swarm intelligence and soft computing. PhD Thesis Civil Engineering Virginia Polytechnic Institute and State University (2002)
Teodorovic, D., Lucic, P., Markovic, P., Orco, M.D.: Bee colony optimization: principles and applications. In: 8th Seminar on Neural Network Applications in Electrical Engineering, NEUREL (2006)
Lucic, P., Teodorovic, D.: Vehicle routing problem with uncertain demand at nodes: the bee system and fuzzy logic approach. In: Verdegay, J.-L. (ed.) Fuzzy Sets Based Heuristics for Optimization. STUDFUZZ, vol. 126, pp. 67–82. Springer, Heidelberg (2003)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization 39(3), 459–471 (2007)
Benatchba, K., Admane, L., Koudil, M.: Using bees to solve a data-mining problem expressed as a max-sat one. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 212–220. Springer, Heidelberg (2005)
Chong, C.S., Low, M.Y.H., Sivakumar, A.I., Gay, K.L.: A bee colony optimization algorithm to job shop scheduling. In: Proceedings of Winter Simulation Conference, pp. 1954–1961 (2006)
TSPLIB (2012), http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Girsang, A.S., Tsai, CW., Yang, CS. (2014). A Hybrid Ant-Bee Colony Optimization for Solving Traveling Salesman Problem with Competitive Agents. In: Park, J., Adeli, H., Park, N., Woungang, I. (eds) Mobile, Ubiquitous, and Intelligent Computing. Lecture Notes in Electrical Engineering, vol 274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40675-1_95
Download citation
DOI: https://doi.org/10.1007/978-3-642-40675-1_95
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40674-4
Online ISBN: 978-3-642-40675-1
eBook Packages: EngineeringEngineering (R0)