A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)
Traveling Salesman Problem (TSP) is a famous problem in combinatorial optimization. The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated...
| Main Authors: | , , , |
|---|---|
| 格式: | Monograph |
| 语言: | English English |
| 出版: |
Universiti Utara Malaysia
2011
|
| 主题: | |
| 在线阅读: | https://repo.uum.edu.my/id/eprint/7345/1/Lim.pdf https://repo.uum.edu.my/id/eprint/7345/4/1.LIM%20YAI%20FUNG.pdf |