Evolution-Based Tabu Search Approach to Traveling Salesman Problem
碩士 === 淡江大學 === 資訊管理學系碩士班 === 96 === In the combinatorial optimization problem, Traveling Salesman Problem is the most basic and typical example, lots of problems could transfer to TSP as solution. Meanwhile, as the TSP belongs to NP-Complete problem, it is quite hard to find out the best solution i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/02159143795539573862 |