Optimization models for multi-period railway rolling stock assignment

Susumu Morito, Yuho Takehi, Jun Imaizumi, Takayuki Shiina

    研究成果: Conference contribution

    1 引用 (Scopus)

    抄録

    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.

    元の言語English
    ホスト出版物のタイトルCombinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers
    出版者Springer Verlag
    ページ393-402
    ページ数10
    9849 LNCS
    ISBN(印刷物)9783319455860
    DOI
    出版物ステータスPublished - 2016
    イベント4th International Symposium on Combinatorial Optimization, ISCO 2016 - Vietri sul Mare, Italy
    継続期間: 2016 5 162016 5 18

    出版物シリーズ

    名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    9849 LNCS
    ISSN(印刷物)03029743
    ISSN(電子版)16113349

    Other

    Other4th International Symposium on Combinatorial Optimization, ISCO 2016
    Italy
    Vietri sul Mare
    期間16/5/1616/5/18

    Fingerprint

    Railway
    Optimization Model
    Schedule
    Assignment
    End Effect
    Path
    Mixed Integer Programming
    Period of time
    Programming Model
    Horizon
    Integer programming
    Model-based
    Necessary
    Series
    Optimization
    Model
    Industry

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    これを引用

    Morito, S., Takehi, Y., Imaizumi, J., & Shiina, T. (2016). Optimization models for multi-period railway rolling stock assignment. : Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers (巻 9849 LNCS, pp. 393-402). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 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; Shiina, Takayuki.

    Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers. 巻 9849 LNCS Springer Verlag, 2016. p. 393-402 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 9849 LNCS).

    研究成果: Conference contribution

    Morito, S, Takehi, Y, Imaizumi, J & Shiina, T 2016, Optimization models for multi-period railway rolling stock assignment. : Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers. 巻. 9849 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 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. : Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers. 巻 9849 LNCS. Springer Verlag. 2016. p. 393-402. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-45587-7_34
    Morito, Susumu ; Takehi, Yuho ; Imaizumi, Jun ; Shiina, Takayuki. / Optimization models for multi-period railway rolling stock assignment. Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers. 巻 9849 LNCS 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",
    year = "2016",
    doi = "10.1007/978-3-319-45587-7_34",
    language = "English",
    isbn = "9783319455860",
    volume = "9849 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "393--402",
    booktitle = "Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers",
    address = "Germany",

    }

    TY - GEN

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

    AU - Morito, Susumu

    AU - Takehi, Yuho

    AU - Imaizumi, Jun

    AU - Shiina, Takayuki

    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

    VL - 9849 LNCS

    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

    PB - Springer Verlag

    ER -