English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 64178/96951 (66%)
造訪人次 : 9385382      線上人數 : 245
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/126355


    題名: A New Model and heuristic algorithms for the Multiple-Depot Vehicle Scheduling Problem
    作者: Lin, Chih‐kang
    關鍵詞: transportation;multiple‐depot vehicle scheduling problem (MDVSP);heuristic;greedy algorithm
    日期: 2008-02-20
    上傳時間: 2024-10-07 12:05:43 (UTC+8)
    摘要: 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.
    關聯: Journal of the Chinese Institute of Engineers 33(2), p.287-299
    DOI: 10.1080/02533839.2010.9671618
    顯示於類別:[運輸管理學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML47檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋