.png){kind=icon}
返回
Integrated train timetabling and locomotive assignment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trb.2018.09.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Train timetabling and locomotive assignment are often performed separately in a sequential manner. One obvious disadvantage of such hierarchical planning process is that it often results in poor coordination between the train schedule and the locomotive schedule. This paper focuses on modeling and solving an integrated train timetabling and locomotive assignment problem. To solve this integrated problem, we first construct a three-dimensional state-space-time network in which a state is used to indicate which train a locomotive is serving. We then formulate the problem as a minimum cost multi-commodity network flow problem with incompatible arcs and integer flow restrictions. We present a Lagrangian relaxation heuristic for solving this network flow problem. We conduct a computational study to test the effectiveness of our Lagrangian relaxation heuristic, compare the performance of our heuristic with that of two benchmark solution methods, and report the benefits obtained by integrating train timetabling and locomotive assignment decisions. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Train timetabling
Locomotive assignment
Routing
State-space-time network
Lagrangian relaxation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
3.6K
被引数:
1.9W
机构
引用论文
.png){kind=icon}
分享收藏Simultaneous passenger train routing and timetabling using an efficient train-based Lagrangian relaxation decomposition使用基于火车的拉格朗日松弛分解同时进行旅客列车路线和时间表
PREAI
分享收藏
查看更多内容