Applications of Threshold Accepting Method to Traveling Salesman Problem and Vehicle Routing Problem
碩士 === 國立交通大學 === 土木工程研究所 === 83 === Threshold accepting(TA) is a new general purpose algorithm presented by Dueck and Scheuer in 1990 for the solution of combinatorial optimization problems. This new method is even simpler structures than the well-known...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1995
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/79465051949168589505 |