HABCO : A Robust Agent on Hybrid Ant-Bee Colony Optimization

Abba Suganda Girsang, Chun-Wei Tsai, Chu-Sing Yang

Abstract


The purpose of this research is to generate a robust agent by combining bee colony optimization (BCO) and ELU-Ants for solving traveling salesman problem (TSP), called HABCO. The robust agents, called ant-bees, firstly are grouped into three types scout, follower, recruiter at each stages. Then, the bad agents are high probably discarded, while the good agents are high probably duplicated in earlier steps. This first two steps mimic BCO algorithm. However, constructing tours such as choosing nodes, and updating pheromone are built by ELU-Ants 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.


Keywords


Ant Colony Optimization; Bee Colony Optimization; Hybrid; Robust Agent; Traveling Salesman Problem

References


M. Dorigo, V. Maniezzo, and A. Colorni, ”The ant system: Optimization by a colony of cooperating

agents”, IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 26, no. 1, pp. 2941, 1996.

M. Dorigo and L. M. Gambardella, ”Ant colony system: A cooperative learning approach to

the traveling salesman problem”, IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 5366, 1997.

J. V. Potvin, ”Genetic Algorithms for the Traveling Salesman Problem”, Annals of Operations Research, vol. 63, pp. 339-370, 1996.

M. Clerc, ”Discrete particle swarm optimization illustrated by the traveling salesman problem”, http://www.mauriceclerc.net, 2000.

K.P.Wang, L. Huang, C.G. Zhou, W. Pang, ”Particle swarm optimization for traveling salesman problem”, International Conference on Machine Learning and Cybernetics 3 (2003)

Chu, Shu-Chuan and Tsai, Pei-Wei and Pan, Jeng-Shyang, ”Cat swarm optimization”, ”PRICAI 2006: Trends in artificial intelligence”, pp=854-858, 2006

P. Lucic, ”Modeling Transportation Problems Using Concepts of Swarm Intelligence and Soft Computing, PhD Thesis, Civil Engineering, Faculty of the Virginia Polytechnic Institute and

State University, 2002.

D. Teodorovic, P.Lucic, G. Markovic, M. DellOrco, ”Bee Colony Optimization: Principles and Applications”, 8th Seminar on Neural Network Applications in Electrical Engineering, NEUREL, 2006.

L.P. Wong, M.Y.H. Low, C. S. Chong, ”A bee colony optimization algorithm for travelling salesman problem”, Proceedings of Second Asia International Conference on Modelling and Simulation

(AMS), pp. 818-823, 2008.

L. P. Wong, M. Y. H. Low, and C. S. Chong, ”Bee colony optimization with local search for travelling salesman problem”, in Proceeding of 6th IEEE International Conference on Industrial

Informatics (INDIN), IEEE, pp. 10191025, 2008

P. Lucic, D. Teodorovic,”Vehicle Routing Problem with Uncertain Demand at Nodes: The Bee System and Fuzzy Logic Approach”, Fuzzy Sets in Optimization, Editor J.L. Verdegay, Springer-Verlag, Berlin Heidelbelg, pp.67-82, 2003.

Girsang, A.S., Tsai, C.W. and Yang, C.S., ”A Fast Bee Colony Optimization for Traveling Salesman Problem”, Third International Conference on Innovations in Bio-Inspired Computing

and Applications (IBICA), pp 7-12, 2012

T. Stutzle and H. H. Hoos ”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.

W. J. Yu, and J. Zhang, ”Pheromone-distribution-based adaptive ant colony system”, Proceedings of the 12th annual conference on Genetic and evolutionary computation, Portland,

Oregon, USA, 2010.

H. M. Naimi, and N. Taherinejad, ”New robust and efficient ant colony algorithms: Using new interpretation of local updating process”, Expert Systems with Applications, vol. 36, no.1, pp.

-488, 2009.

S. M. Chen and C. Y. Chien. ”Parallelized genetic ant colony systems for solving the traveling salesman problem”, Expert Systems with Applications, vol.38, no. 4 , pp. 3873-3883, 2011.

S. M. Chen and C. Y. Chien. ”Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques”, Expert Systems with Applications, vol. 38, no. 12 , pp. 14439-14450, 2011.

V. D. Z. Sjoerd, and C. Marques, ”Ant colony optimisation for job shop scheduling”, Proceedings of Workshop on Genetic Algorithms and Artficial Life GAAL, 1999.

L. M. Gambardella, E. D. Taillard, and M. Dorigo, ”Ant colonies for the quadratic assignment problem”, Journal of the operational research society, vol. 50, no. 2, pp 167-176, 1999.

P. Lucic, and D. Teodorovic, ”Transportation modeling: an artificial life approach”, Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence, 2002.

P. Lucic, ”Modeling transportation problems using concepts of swarm intelligence and soft computing”, Virginia Polytechnic Institute and State University, 2002.

D. Teodorovic, P. Lucic, P. Markovic, and M. D. Orco, ”Bee colony optimization: principles and applications”, 8th Seminar on Neural Network Applications in Electrical Engineering, NEUREL, 2006.

P. Lucic and D. Teodorovic, ”Vehicle routing problem with uncertain demand at nodes: the bee system and fuzzy logic approach”, Studies in fuzziness and soft computing, vol. 126, pp.

-82, 2003.

D. Karaboga and B. Basturk, ”A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm”, Journal of Global Optimization, vol. 39 (3), pp. 459-471, 2007.

K. Benatchba, L. Admane, and M. Koudil, ”Using bees to solve a data-mining problem expressed as a max-sat one”, Artificial Intelligence and Knowledge Engineering Applications: A

Bioinspired Approach, pp. 75-86, 2005.

C.S. Chong, M.Y. H. Low, A.I. Sivakumar, and K. L. Gay, ”A bee colony optimization algorithm to job shop scheduling”, Proceedings of Winter Simulation Conference, pp. 1954-1961, 2006.

M. Fathian, B. Amiri and A. Maroosi, ”Application of honey-bee mating optimization algorithm

on clustering”, Applied Mathematics and Computation, vol. 190 (2), pp. 1502-1513, 2007.

Girsang, A.S., Tsai, C.W. and Yang, C.S., ” A Hybrid Ant-Bee Colony Optimization for Solving Traveling Salesman Problem with Competitive Agents”, Proceeding in Mobile, Ubiquitous, and

Intelligent Computing,pp 643-648,2014

TSPLIB, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp, 2012.




DOI: http://dx.doi.org/10.12928/telkomnika.v15i3.3656

Refbacks

  • There are currently no refbacks.


Copyright (c) 2017 Universitas Ahmad Dahlan

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


TELKOMNIKA Telecommunication, Computing, Electronics and Control
website: http://telkomnika.ee.uad.ac.id
online system: http://journal.uad.ac.id/index.php/TELKOMNIKA
Phone: +62 (274) 563515, 511830, 379418, 371120 ext: 3208
Fax    : +62 (274) 564604

View TELKOMNIKA Stats