A NEW MODEL AND HEURISTIC ALGORITHMS FOR THE MULTIPLE-DEPOT VEHICLE SCHEDULING PROBLEM

檔案

日期

2010-03-01

類型

期刊名稱

JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS

卷期與頁次

第 33 卷第 2 期,頁 287–299

ISSN

0253-3839

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Wang, J.-Y., & Lin, C.-K. (2010). A NEW MODEL AND HEURISTIC ALGORITHMS FOR THE MULTIPLE-DEPOT VEHICLE SCHEDULING PROBLEM. JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 33(2), 287–299. https://ir.lib.nycu.edu.tw/handle/11536/5773

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/5773