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 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
The traveling salesman problem : a computational study /
出版: (2006) -
An innovative branch and bound algorithm for the traveling salesman problem /
由: Foroushani, Mahshid Sadat Abtahi -
The Traveling Salesman Problem and Its Variations
出版: (2007) -
A genetic algorithm for symmetric travelling salesman problem eith due dates
由: Lee, Lai Soon, et al.
出版: (2007) -
Optimization of PID Controllers Using Ant Colony and Genetic Algorithms
由: Ünal, Muhammet., et al.
出版: (2013)
