A Tabu Search Method for Solving the Orienteering Problem
碩士 === 義守大學 === 工業工程與管理學系碩士班 === 96 === In this thesis, we propose a tabu search method for solving the orienteering problem (OP). The OP is a variant of the well-known traveling salesman problem (TSP) in which locations of the starting and the ending point, locations and their associated scores of...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/16973976033647979444 |