Optimization of Rolling Stock Rostering Under Mutual Direct Operation

Sota Nakano, Jun Imaizumi and Takayuki Shiina ()
Additional contact information
Sota Nakano: Waseda University
Jun Imaizumi: Toyo University
Takayuki Shiina: Waseda University

A chapter in Operations Research Proceedings 2019, 2020, pp 749-755 from Springer

Abstract: 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.

Keywords: Railways; Rolling stock scheduling; Rostering; Mutual direct operation; Integer programing; TSP (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-030-48439-2_91

Ordering information: This item can be ordered from
http://www.springer.com/9783030484392

DOI: 10.1007/978-3-030-48439-2_91

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().