IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-48439-2_91.html
   My bibliography  Save this book chapter

Optimization of Rolling Stock Rostering Under Mutual Direct Operation

In: Operations Research Proceedings 2019

Author

Listed:
  • Sota Nakano

    (Waseda University)

  • Jun Imaizumi

    (Toyo University)

  • Takayuki Shiina

    (Waseda University)

Abstract

The problem of creating a rolling stock schedule is complex and difficult. In Japan, research to develop an optimal schedule using mathematical models has not progressed sufficiently due to the large number of train services. We aim to create an optimal schedule for a railway line where “mutual direct operation” is being conducted. Previous studies proposed a mathematical model as an integer-programming problem to obtain an optimal roster for a single company. In this paper, we extend the formulation to create a schedule for multiple companies to apply to mutual direct operation. The difference from previous studies is, in addition to minimizing the total distance of empty runs, to making the total running distances by company vehicles on each other’s lines as close to equal as possible.

Suggested Citation

  • Sota Nakano & Jun Imaizumi & Takayuki Shiina, 2020. "Optimization of Rolling Stock Rostering Under Mutual Direct Operation," Operations Research Proceedings, in: Janis S. Neufeld & Udo Buscher & Rainer Lasch & Dominik Möst & Jörn Schönberger (ed.), Operations Research Proceedings 2019, pages 749-755, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-48439-2_91
    DOI: 10.1007/978-3-030-48439-2_91
    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.

    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:oprchp:978-3-030-48439-2_91. 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.