Comparison between ant colony and genetic algorithm using traveling salesman problem
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 construct...
Saved in:
Main Authors: | Abduljabbar, Zaid Ammen, Khalefa, Mustafa S., A. Jabar, Marzanah |
---|---|
格式: | Article |
語言: | English |
出版: |
Medwell Publishing
2013
|
在線閱讀: | http://psasir.upm.edu.my/id/eprint/30686/1/Comparison%20between%20ant%20colony%20and%20genetic%20algorithm%20using%20traveling%20salesman%20problem.pdf http://psasir.upm.edu.my/id/eprint/30686/ http://www.medwelljournals.com/abstract/?doi=ijscomp.2013.171.174 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Ant colony system with heuristic function for the travelling salesman problem
由: Alobaedy, Mustafa Muwafak, et al.
出版: (2013) -
New heuristic function in ant colony system for the travelling salesman problem
由: Alobaedy, Mustafa Muwafak, et al.
出版: (2012) -
Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP).
由: Md Rais, Helmi, et al.
出版: (2007) -
Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem
由: Tuani Ibrahim, Ahamed Fayeez, et al.
出版: (2020) -
Genetic algorithm software for solving the travelling salesman problem
由: Sekharan, Vijayan Sandiara
出版: (1996)