A Meta-Heuristic Method for Vehicle Routing Problem with Time Window Constraints
碩士 === 中原大學 === 工業工程研究所 === 90 === ABSTRACT This research proposes a heuristic, Tabu-Disturbance Algorithm (TDA), to efficiently and effectively solve Vehicle Routing Problem with Time Window Constraints (VRPTW). TDA integrates Tabu Search (TS) and Noising Method (NM). TS is the most popular generic...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/21993520915168074947 |