Heruistic Algorithms for the Traveling Salesma Problem based on Dynamic Programming
博士 === 國立中正大學 === 資訊工程所 === 97 === Given a symmetric graph G, the Traveling Salesman Problem (TSP) is to find a shortest path that pass through all of the vertices of graph G and return origin. According to the dynamic programming for Traveling Salesman Problem and genetic algorithm, we get a lot of...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/92214355652323928772 |