Vehicle Routing Problem with Hard/Soft Time Window Constraints
碩士 === 中原大學 === 工業工程研究所 === 89 === This research proposes a heuristic, Tabu-Threshold Algorithm (TTA), to efficiently and effectively solve Vehicle Routing Problem with Hard/Soft Time Window Constraints (VRPHTW / VRPSTW). TTA integrates Tabu Search (TS) and Threshold Accepting (TA), two of the most...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/26746509312112443878 |