Optimization Models for Multi-period Railway Rolling Stock Assignment

详细信息    查看全文

• 关键词：Railway rolling stock ; Inspection requirements ; Utilization path ; Mixed integer programming
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9849
• 期：1
• 页码：393-402
• 全文大小：2,692 KB
• 参考文献：1.Lai, Y.C., Zeng, W.W., Liu, K.C., Wang, S.W.: Development of rolling stock assignment system for Taiwan high speed rail. In: Proceedings of 5th International Seminar on Railway Operations Modelling and Analysis, Copenhagen (2013)
  2.Maroti, G., Kroon, L.F.: Maintenance routing for train units: the transition model. Transp. Sci. 39, 518–525 (2005)CrossRef MATH
  3.Maroti, G., Kroon, L.: Maintenance routing for train units: the interchange model. Comput. Oper. Res. 34, 1121–1140 (2007)CrossRef MATH
  
• 作者单位：Susumu Morito (16)
  Yuho Takehi (16)
  Jun Imaizumi (16)
  Takayuki Shiina (16)
  
  16. Department of Industrial Management and Systems Engineering, Waseda University, 3-4-1 Ohkubo, Shinjuku, Tokyo, 169-8555, Japan
  
• 丛书名：Combinatorial Optimization
• ISBN：978-3-319-45587-7
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349
• 卷排序：9849

文摘

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.