Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem
The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Högskolan Dalarna, Datateknik
2010
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:du-4910 |