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
編集者Satoru Fujishige, Ridha A. Mahjoub, Raffaele Cerulli
出版社Springer Verlag
ページ393-402
ページ数10
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(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other4th International Symposium on Combinatorial Optimization, ISCO 2016
国/地域Italy
CityVietri sul Mare
Period16/5/1616/5/18

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Optimization models for multi-period railway rolling stock assignment」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル