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...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Článek |
| Jazyk: | English |
| Vydáno: |
Medwell Publishing
2013
|
| On-line přístup: | http://psasir.upm.edu.my/id/eprint/30686/1/Comparison%20between%20ant%20colony%20and%20genetic%20algorithm%20using%20traveling%20salesman%20problem.pdf |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
| Shrnutí: | 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. |
|---|