Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System
The TSP is considered one of the most well-known combinatorial optimization tasks and researchers have paid so much attention to the TSP for many years. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot....
| Autori principali: | , , |
|---|---|
| Natura: | Articolo |
| Lingua: | English |
| Pubblicazione: |
Universitat Politècnica de València
2016-07-01
|
| Serie: | International Journal of Production Management and Engineering |
| Soggetti: | |
| Accesso online: | http://polipapers.upv.es/index.php/IJPME/article/view/4618 |