The comparison between connection-based network and time-space network on multiple-depot multiple-vehicle-type scheduling problem
碩士 === 國立臺灣科技大學 === 資訊管理系 === 94 === In this paper, we consider the multiple-depot multiple-vehicle-type scheduling problem (MDMV-VSP) where a given set of timetabled trips (or tasks) are assigned to appropriate vehicles from appropriate depots. A key feature differentiating our paper from extant li...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/hmc2dz |