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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Monograph |
| Language: | English English |
| Published: |
Universiti Utara Malaysia
2011
|
| Subjects: | |
| Online Access: | http://repo.uum.edu.my/7345/1/Lim.pdf http://repo.uum.edu.my/7345/4/1.LIM%20YAI%20FUNG.pdf http://repo.uum.edu.my/7345/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|