The Application of Ant Colony Algorithm in Solve the Traveling Salesman Problem with Fuzzy Movement Time among Cities
Traveling salesman problem (TSP) is one of the most well-known combinational optimization problems which recently has been a suitable base to validate different heuristic and Meta heuristic algorithms. Multiple application of this problem in both theoretical and operational field is remarkable to re...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Allameh Tabataba'i University Press
2010-10-01
|
| Series: | Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī |
| Subjects: | |
| Online Access: | http://jims.atu.ac.ir/article_4465_9f68d58af125242929db8b482b6e8b01.pdf |