Finding Approximate Solution for Traveling Salesman Problem by Refining Tour Segments
碩士 === 國立清華大學 === 資訊系統與應用研究所 === 97 === This thesis presents a heuristic algorithm for solving traveling salesman problem by utilizing dynamic programming and divide-and-conquer methods. In our algorithm, a complete, whole tour is divided into several sub-tours, and refined by dynamics programming r...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/37361556411099329048 |
| Summary: | 碩士 === 國立清華大學 === 資訊系統與應用研究所 === 97 === This thesis presents a heuristic algorithm for solving traveling salesman problem by utilizing dynamic programming and divide-and-conquer methods. In our algorithm, a complete, whole tour is divided into several sub-tours, and refined by dynamics programming respectively to get the better solution. In order to escape from local optimal, we modify the refinement algorithm to city group version that refine solution in city group unit. This algorithm does work under many instances with the size of thousand of cities, showed in chapter 4 experimental results).
|
|---|