淡江大學機構典藏:Item 987654321/126355
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 64178/96951 (66%)
Visitors : 9369150      Online Users : 14034
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/126355


    Title: A New Model and heuristic algorithms for the Multiple-Depot Vehicle Scheduling Problem
    Authors: Lin, Chih‐kang
    Keywords: transportation;multiple‐depot vehicle scheduling problem (MDVSP);heuristic;greedy algorithm
    Date: 2008-02-20
    Issue Date: 2024-10-07 12:05:43 (UTC+8)
    Abstract: 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.
    Relation: Journal of the Chinese Institute of Engineers 33(2), p.287-299
    DOI: 10.1080/02533839.2010.9671618
    Appears in Collections:[Graduate Institute & Department of Transportation Management] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML47View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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