Optimization models for multi-period railway rolling stock assignment

Susumu Morito; Yuho Takehi; Jun Imaizumi; Takayuki Shiina

doi:10.1007/978-3-319-45587-7_34

Optimization models for multi-period railway rolling stock assignment

Susumu Morito^*, Yuho Takehi, Jun Imaizumi, Takayuki Shiina

^*Corresponding author for this work

School of Creative Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

It is necessary for railway companies to construct daily schedules of assigning rolling stocks to utilization paths. A utilization path consists of a series of trains that a particular rolling stock performs in a day. A mixed integer programming model based on Lai et al. [1] is presented and is shown that straightforward applications of the model result in too much computational time and also inappropriate assignment schedules due to end effects. We show that the model can be modified to alleviate these difficulties, and also show that the repeated applications of the optimization model in the rolling horizon allow to generate a feasible assignment schedule for a longer period of time thus indicating the feasibility of the optimization approach.

Original language	English
Title of host publication	Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers
Editors	Satoru Fujishige, Ridha A. Mahjoub, Raffaele Cerulli
Publisher	Springer Verlag
Pages	393-402
Number of pages	10
ISBN (Print)	9783319455860
DOIs	https://doi.org/10.1007/978-3-319-45587-7_34
Publication status	Published - 2016
Event	4th International Symposium on Combinatorial Optimization, ISCO 2016 - Vietri sul Mare, Italy Duration: 2016 May 16 → 2016 May 18

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9849 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	4th International Symposium on Combinatorial Optimization, ISCO 2016
Country/Territory	Italy
City	Vietri sul Mare
Period	16/5/16 → 16/5/18

Keywords

Inspection requirements
Mixed integer programming
Railway rolling stock
Utilization path

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-45587-7_34

Cite this

Morito, S., Takehi, Y., Imaizumi, J., & Shiina, T. (2016). Optimization models for multi-period railway rolling stock assignment. In S. Fujishige, R. A. Mahjoub, & R. Cerulli (Eds.), Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers (pp. 393-402). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9849 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-45587-7_34

Optimization models for multi-period railway rolling stock assignment. / Morito, Susumu; Takehi, Yuho; Imaizumi, Jun et al.

Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers. ed. / Satoru Fujishige; Ridha A. Mahjoub; Raffaele Cerulli. Springer Verlag, 2016. p. 393-402 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9849 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Morito, S, Takehi, Y, Imaizumi, J & Shiina, T 2016, Optimization models for multi-period railway rolling stock assignment. in S Fujishige, RA Mahjoub & R Cerulli (eds), Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9849 LNCS, Springer Verlag, pp. 393-402, 4th International Symposium on Combinatorial Optimization, ISCO 2016, Vietri sul Mare, Italy, 16/5/16. https://doi.org/10.1007/978-3-319-45587-7_34

Morito S, Takehi Y, Imaizumi J, Shiina T. Optimization models for multi-period railway rolling stock assignment. In Fujishige S, Mahjoub RA, Cerulli R, editors, Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers. Springer Verlag. 2016. p. 393-402. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-45587-7_34

Morito, Susumu ; Takehi, Yuho ; Imaizumi, Jun et al. / Optimization models for multi-period railway rolling stock assignment. Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers. editor / Satoru Fujishige ; Ridha A. Mahjoub ; Raffaele Cerulli. Springer Verlag, 2016. pp. 393-402 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5ecb8b5a22884989b53c16d771b9344a,

title = "Optimization models for multi-period railway rolling stock assignment",

abstract = "It is necessary for railway companies to construct daily schedules of assigning rolling stocks to utilization paths. A utilization path consists of a series of trains that a particular rolling stock performs in a day. A mixed integer programming model based on Lai et al. [1] is presented and is shown that straightforward applications of the model result in too much computational time and also inappropriate assignment schedules due to end effects. We show that the model can be modified to alleviate these difficulties, and also show that the repeated applications of the optimization model in the rolling horizon allow to generate a feasible assignment schedule for a longer period of time thus indicating the feasibility of the optimization approach.",

keywords = "Inspection requirements, Mixed integer programming, Railway rolling stock, Utilization path",

author = "Susumu Morito and Yuho Takehi and Jun Imaizumi and Takayuki Shiina",

note = "Funding Information: This work was supported by JSPS Kakenhi Grant No. 26350437. The authors would like to express sincere appreciations to Professor Y.C. Lai of National Taiwan University and Mr. Satoshi Kato of Railway Technical Research Institute. Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016. Copyright: Copyright 2017 Elsevier B.V., All rights reserved.; 4th International Symposium on Combinatorial Optimization, ISCO 2016 ; Conference date: 16-05-2016 Through 18-05-2016",

year = "2016",

doi = "10.1007/978-3-319-45587-7_34",

language = "English",

isbn = "9783319455860",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "393--402",

editor = "Satoru Fujishige and Mahjoub, {Ridha A.} and Raffaele Cerulli",

booktitle = "Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers",

}

TY - GEN

T1 - Optimization models for multi-period railway rolling stock assignment

AU - Morito, Susumu

AU - Takehi, Yuho

AU - Imaizumi, Jun

AU - Shiina, Takayuki

N1 - Funding Information: This work was supported by JSPS Kakenhi Grant No. 26350437. The authors would like to express sincere appreciations to Professor Y.C. Lai of National Taiwan University and Mr. Satoshi Kato of Railway Technical Research Institute. Publisher Copyright: © Springer International Publishing Switzerland 2016. Copyright: Copyright 2017 Elsevier B.V., All rights reserved.

PY - 2016

Y1 - 2016

N2 - It is necessary for railway companies to construct daily schedules of assigning rolling stocks to utilization paths. A utilization path consists of a series of trains that a particular rolling stock performs in a day. A mixed integer programming model based on Lai et al. [1] is presented and is shown that straightforward applications of the model result in too much computational time and also inappropriate assignment schedules due to end effects. We show that the model can be modified to alleviate these difficulties, and also show that the repeated applications of the optimization model in the rolling horizon allow to generate a feasible assignment schedule for a longer period of time thus indicating the feasibility of the optimization approach.

AB - It is necessary for railway companies to construct daily schedules of assigning rolling stocks to utilization paths. A utilization path consists of a series of trains that a particular rolling stock performs in a day. A mixed integer programming model based on Lai et al. [1] is presented and is shown that straightforward applications of the model result in too much computational time and also inappropriate assignment schedules due to end effects. We show that the model can be modified to alleviate these difficulties, and also show that the repeated applications of the optimization model in the rolling horizon allow to generate a feasible assignment schedule for a longer period of time thus indicating the feasibility of the optimization approach.

KW - Inspection requirements

KW - Mixed integer programming

KW - Railway rolling stock

KW - Utilization path

UR - http://www.scopus.com/inward/record.url?scp=84988027121&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84988027121&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-45587-7_34

DO - 10.1007/978-3-319-45587-7_34

M3 - Conference contribution

AN - SCOPUS:84988027121

SN - 9783319455860

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 393

EP - 402

BT - Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers

A2 - Fujishige, Satoru

A2 - Mahjoub, Ridha A.

A2 - Cerulli, Raffaele

PB - Springer Verlag

T2 - 4th International Symposium on Combinatorial Optimization, ISCO 2016

Y2 - 16 May 2016 through 18 May 2016

ER -

Optimization models for multi-period railway rolling stock assignment

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this