Improvement Vehicle Routing Problem with Time Window
碩士 === 東吳大學 === 資訊管理學系 === 99 === Vehicle routing problem with time window has been the focus of many researchers recently and also proved to be NP-hard. In this thesis, a variety of heuristics are introduced and Solomon problems are used as basis for research. Through the detailed analysis of the c...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/78904662441903156753 |