Greedy algorithm with local search algorithm for TSP combinatorial optimization problems
碩士 === 立德管理學院 === 應用資訊研究所 === 96 === ABSTRACT This thesis proposes a two-stage solution for the traveling salesman problem (TSP). First, greedy algorithm was used to construct the initial path, then 2-opt algorithm (local search) was applied to improve the path cost of the initial path. 55 instance...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/01138577773598898429 |