期刊論文
| 學年 | 96 |
|---|---|
| 學期 | 2 |
| 出版（發表）日期 | 2008-02-20 |
| 作品名稱 | A New Model and heuristic algorithms for the Multiple-Depot Vehicle Scheduling Problem |
| 作品名稱（其他語言） | |
| 著者 | Jin‐Yuan Wang, Chih‐Kang Lin |
| 單位 | |
| 出版者 | |
| 著錄名稱、卷期、頁數 | Journal of the Chinese Institute of Engineers 33(2), p.287-299 |
| 摘要 | The multiple‐depot vehicle scheduling problem (MDVSP) addresses the work of assigning vehicles to serve a given set of time trips with the consideration of certain requirements representing the market rules. Extensive studies in the literature address the MDVSP, but because of the complexity of the problem, the findings of those researchers are still not enough to represent real world situations in Taiwan. Formulation for the MDVSP typically contains the following assumptions: (1) the size of fleet or maximum number of available vehicles at each depot is known already, (2) all trip serving costs are usually simplified as a single term in the objective function, which fails to reflect public transit operator concerns, (3) the applied deadheading strategy is static less flexibility, (4) there is no discussion of differences of route change frequency in the problem. This paper presents a new MDVSP model to address the above issues. A greedy heuristic algorithm based on the divide‐and‐conquer technique is also proposed to solve the MDVSP effectively. Computational tests are performed on the Kinmen Bus Administration (KBA) and results demonstrate that the proposed new model and the greedy heuristic algorithm for the MDVSP are effective in solving real world problems. |
| 關鍵字 | transportation;multiple‐depot vehicle scheduling problem (MDVSP);heuristic;greedy algorithm |
| 語言 | en |
| ISSN | |
| 期刊性質 | 國外 |
| 收錄於 | SCI Scopus |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 是 |
| 國別 | TWN |
| 公開徵稿 | |
| 出版型式 | ,電子版 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/126355 ) |