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: | Jhy-Kai Yang, 楊智凱 |
---|---|
Other Authors: | Anthony Fu-Wha Han |
Format: | Others |
Language: | zh-TW |
Published: |
1995
|
Online Access: | http://ndltd.ncl.edu.tw/handle/79465051949168589505 |
Similar Items
-
Heuristics for Traveling Salesman Problems and Vehicle Routing Problems
by: Su, Yu-Lin, et al.
Published: (1997) -
An Application of the Threshold Accepting Method on Vehicle Routing Problem with Trailers
by: 劉宏政
Published: (1998) -
Multi-Objective Vehicle Routing Problem -The Application of Threshold Acception Method
by: Liao Wei-Xsiung, et al.
Published: (1998) -
Planning the flight routes of the unmanned aerial vehicle by solving the travelling salesman problem
by: Vladimir Vorotnikov, et al.
Published: (2017-07-01) -
An investigation of the ant-based hyper-heuristic for capacitated vehicle routing problem and traveling salesman problem
by: Abd Aziz, Zalilah
Published: (2013)