IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-540-73312-6_4.html
   My bibliography  Save this book chapter

Line Change Considerations Within a Time-Space Network Based Multi-Depot Bus Scheduling Model

In: Computer-aided Systems in Public Transport

Author

Listed:
  • Natalia Kliewer

    (University of Paderborn)

  • Vitali Gintner

    (University of Paderborn)

  • Leena Suhl

    (University of Paderborn)

Abstract

The vehicle scheduling problem, arising in public transport bus companies, addresses the task of assigning buses to cover a given set of timetabled trips. It considers additional requirements, such as multiple depots for vehicles and vehicle type groups for timetabled trips as well as depot capacities. An optimal schedule is characterized by minimal fleet size and minimal operational costs including costs for unloaded trips and idle time spent outside the depot. This paper discusses the multi-depot, multi-vehicle-type bus scheduling problem for timetabled trips organized in bus lines. We use time-space-based networks for problem modeling. The cost-optimal vehicle schedule may involve several line changes for a given bus within a working day which might not be desirable from the practical point of view. Some bus companies prefer to pose a restriction for bus line changes as well. Because the network flow based model works with trips and not lines, it does not explicitly take into account line changes. In this contribution, we discuss several methods to find schedules with an acceptable number of line changes.

Suggested Citation

  • Natalia Kliewer & Vitali Gintner & Leena Suhl, 2008. "Line Change Considerations Within a Time-Space Network Based Multi-Depot Bus Scheduling Model," Lecture Notes in Economics and Mathematical Systems, in: Mark Hickman & Pitu Mirchandani & Stefan Voß (ed.), Computer-aided Systems in Public Transport, pages 57-70, Springer.
    • Handle: RePEc:spr:lnechp:978-3-540-73312-6_4
    DOI: 10.1007/978-3-540-73312-6_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nils Olsen & Natalia Kliewer & Lena Wolbeck, 2022. "A study on flow decomposition methods for scheduling of electric buses in public transport based on aggregated time–space network models," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(3), pages 883-919, September.
    2. Jing-Quan Li, 2014. "Transit Bus Scheduling with Limited Energy," Transportation Science, INFORMS, vol. 48(4), pages 521-539, November.
    3. Shen, Chan & Sun, Yao & Bai, Zijian & Cui, Hongjun, 2021. "Real-time customized bus routes design with optimal passenger and vehicle matching based on column generation algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 571(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:lnechp:978-3-540-73312-6_4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.