Comparison between ant colony and genetic algorithm using traveling salesman problem

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

Full description

Saved in:
Bibliographic Details
Main Authors: Abduljabbar, Zaid Ammen, Khalefa, Mustafa S., A. Jabar, Marzanah
Format: Article
Language:English
Published: Medwell Publishing 2013
Online Access: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
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Putra Malaysia
Language: English

Internet

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

Similar Items