Study on the Multiple Vehicles Routing Problem with Time Windows
碩士 === 靜宜大學 === 財務與計算數學系 === 100 === Many business and economic decisions are made by scheduling. Even some of the problems are shown to be NP-hard, many methodologies are proposed to find optimal solutions under customized covariates and constraints. To study on scheduling...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/40707477457014468526 |