TY  - JOUR
T1  - Comparison Between Ant Colony and Genetic Algorithm Using Traveling Salesman Problem
AU - Abduljabbar, Zaid Ameen AU - , Mustafa S. Khalefa AU - , Marzanah A. Jabar 
JO  - International Journal of Soft Computing
VL  - 8
IS  - 3
SP  - 171
EP  - 174
PY  - 2013
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2013.171.174
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2013.171.174
KW  - Ant colony
KW  -genetic algorithm
KW  -combinatorial optimization
KW  -traveling salesman problem
KW  -distributed algorithm
AB  - The Travelling Salesman Problem (TSP) is a complex problem 
  in combinatorial optimization. The aim of this study is compare the effect of 
  using two distributed algorithm which are ant colony as a Swarm intelligence 
  algorithm and genetic algorithm. In ant colony algorithm each individual ant 
  constructs a part of the solution using an artificial pheromone which reflects 
  its experience accumulated while solving the problem and heuristic information 
  dependent on the problem. The results of comparison show that ant colony is 
  high efficient than genetic algorithm and it requires less computational cost 
  and generally only a few lines of code.
ER  -