CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Ant Colony Optimization (ACO) and a Variation of Bee Colony Optimization (BCO) in Solving TSP Problem: A Comparative Study

by Muhammed Basheer Jasser, Mohamad Sarmini, Rauf Yaseen
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 96 - Number 9
Year of Publication: 2014
Authors: Muhammed Basheer Jasser, Mohamad Sarmini, Rauf Yaseen
10.5120/16819-6587

Muhammed Basheer Jasser, Mohamad Sarmini, Rauf Yaseen . Ant Colony Optimization (ACO) and a Variation of Bee Colony Optimization (BCO) in Solving TSP Problem: A Comparative Study. International Journal of Computer Applications. 96, 9 ( June 2014), 1-8. DOI=10.5120/16819-6587

@article{ 10.5120/16819-6587,
author = { Muhammed Basheer Jasser, Mohamad Sarmini, Rauf Yaseen },
title = { Ant Colony Optimization (ACO) and a Variation of Bee Colony Optimization (BCO) in Solving TSP Problem: A Comparative Study },
journal = { International Journal of Computer Applications },
issue_date = { June 2014 },
volume = { 96 },
number = { 9 },
month = { June },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume96/number9/16819-6587/ },
doi = { 10.5120/16819-6587 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:21:48.648799+05:30
%A Muhammed Basheer Jasser
%A Mohamad Sarmini
%A Rauf Yaseen
%T Ant Colony Optimization (ACO) and a Variation of Bee Colony Optimization (BCO) in Solving TSP Problem: A Comparative Study
%J International Journal of Computer Applications
%@ 0975-8887
%V 96
%N 9
%P 1-8
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Traveler sales man problem is known research problem which has a lot of industrial applications. A lot of algorithms has been proposed to solve TSP, some of Ant Colony Optimization (ACO) and Bee Colony Optimization (BCO) algorithms. BCO algorithm has variations and enhancements to improve the performance. In this paper, a experimental comparison study between the basic Ant Colony Optimization and enhanced Bee Colony Optimization algorithms is done. Both ACO and enhanced BCO have been implemented using MATLAB. The comparison study includes comparing the time consumed, solution quality and algorithmic complexity in order to prove the effictivness and efficiency of each. The experimental study showed that the basic ACO outperforms the enhanced BCO in the required consumed time to get the solution path, while enhanced BCO proved to provide better solution quality.

References
  1. David L Applegate. The traveling salesman problem: a computational study. Princeton University Press, 2006.
  2. Mandeep Kaur Bedi and Sheena Singh. Fault detection techniques prioritization using bee colony optimization and then comparison with ant colony optimization. International Journal of Computer Applications, 69(17), 2013.
  3. Aditi Chikhalikar and Avanti Darade. Swarm intelligence techniques: Comparative study of aco and bco. self, 4:5, 1995.
  4. Marco Dorigo and Luca Maria Gambardella. Ant colony system: a cooperative learning approach to the traveling salesman problem. Evolutionary Computation, IEEE Transactions on, 1(1):53–66, 1997.
  5. Xiutang Geng, Zhihua Chen, Wei Yang, Deqian Shi, and Kai Zhao. Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Applied Soft Computing, 11(4):3680–3689, 2011.
  6. Wang Hui. Comparison of several intelligent algorithms for solving tsp problem in industrial engineering. Systems Engineering Procedia, 4:226–235, 2012.
  7. Fozia Hanif Khan, Nasiruddin Khan, Syed Inayatullah, and Shaikh Tajuddin Nizami. Solving tsp problem by using genetic algorithm. International Journal of Basic & Applied Sciences, 9(10), 2009.
  8. Evelia Liz´arraga, Oscar Castillo, and Jos´e Soria. A method to solve the traveling salesman problem using ant colony optimization variants with ant set partitioning. In Recent Advances on Hybrid Intelligent Systems, pages 237–246. Springer, 2013.
  9. Mei Mi, Xue Huifeng, Zhong Ming, and Gu Yu. An improved differential evolution algorithm for tsp problem. In Intelligent Computation Technology and Automation (ICICTA), 2010 In-ternational Conference on, volume 1, pages 544–547. IEEE, 2010.
  10. Eneko Osaba and Fernando D´ýaz. Comparison of a memetic algorithm and a tabu search algorithm for the traveling salesman problem. In Computer Science and Information Systems (FedCSIS), 2012 Federated Conference on, pages 131–136. IEEE, 2012.
  11. DT Pham, A Ghanbarzadeh, E Koc, S Otri, S Rahim, and M Zaidi. The bees algorithm-a novel tool for complex optimisation problems. In Proceedings of the 2nd Virtual International Conference on Intelligent Production Machines and Systems (IPROMS 2006), pages 454–459, 2006.
  12. R Sagayam and Mrs K Akilandeswari. Comparison of ant colony and bee colony optimization for spam host detection.
  13. SN Sivanandam and SN Deepa. Genetic Algorithm Optimization Problems. Springer, 2008.
  14. Li-Pei Wong, Malcolm Yoke Hean Low, and Chin Soon Chong. Bee colony optimization with local search for traveling salesman problem. International Journal on Artificial Intelligence Tools, 19(03):305–334, 2010.
  15. Yong-Quan Zhou, Zheng-Xin Huang, and Hong-Xia Liu. Discrete glowworm swarm optimization algorithm for tsp problem. Dianzi Xuebao(Acta Electronica Sinica), 40(6):1164– 1170, 2012.
  16. Nur Ariffin Mohd Zin, Siti Norul Huda Sheikh Abdullah, Noor Faridatul Ainun Zainal, and Esmayuzi Ismail. A comparison of exhaustive, heuristic and genetic algorithm for travelling salesman problem in prolog. International Journal on Advanced Science, Engineering and Information Technology, 2(6):49–53, 2012.
Index Terms

Computer Science
Information Sciences

Keywords

ACO BCO TSP

Powered by PhDFocusTM