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...

詳細記述

保存先:
書誌詳細
主要な著者: Abduljabbar, Zaid Ammen, Khalefa, Mustafa S., A. Jabar, Marzanah
フォーマット: 論文
言語: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
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!