Parallel Local Search for Large Scale Travelling Salesman Problems
碩士 === 國立中正大學 === 資訊工程研究所 === 107 === The traveling salesman problem (TSP) is a classic combinational problem, related to realworld applications, such as VLSI design problems, transportation problems, and printed circuit board drilling problems. The goal of TSP is to find the shortest route that goe...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/8m8f8n |