Promising Edge Set Guided Genetic Local Search Algorithm for the Traveling Salesman Problem
碩士 === 中興大學 === 資訊科學系所 === 95 === The traveling salesman problem is an important combinatorial optimization problem. Since 1930, many researchers had been devoting their efforts in solving this problem. Being an NP-hard problem, the traveling salesman problem is unlikely to be solved in polynomial t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/84742864395319853029 |