.png){kind=icon}
返回
Train timetabling with dynamic and random passenger demand: A stochastic optimization method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trc.2021.102963.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Considering the dynamics and randomness of passenger demand, this paper investigates a train timetabling problem in the stochastic environment for an urban rail transit system. With the scenario-based representation of passenger distribution, an integer nonlinear programming (INLP) model is first formulated to simultaneously optimize the total number of train services, headway settings and speed profile selection decision during the planning time horizon, in which the expected total service cost is treated as the objective function. Through an analysis of the features of the nonlinear constraints, a reformulation method is proposed to develop an equivalent integer linear programming (ILP) model that can be easily solved by commercial software. Moreover, a variable neighborhood search algorithm is developed to find the approximate optimal solutions for large-scale problems within the tolerable computing time. Finally, two sets of numerical experiments, with the operation environments of a simple urban rail transit line and Fuzhou Metro Line 1, are implemented to verify the solution quality and effectiveness of the proposed methods.
Keyword:
Urban rail transit
Train timetable
Stochastic optimization
Variable neighborhood search algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.9
论文数:
4.9K
被引数:
3.2W
机构
引用论文
.png){kind=icon}
Joint optimization of train scheduling and maintenance planning in a railway network: A heuristic algorithm using Lagrangian relaxation铁路网络中列车调度和维护计划的联合优化: 使用拉格朗日松弛的启发式算法
PREAI
分享收藏Energy-Efficient Train Operation in Urban Rail Transit Using Real-Time Traffic Information基于实时交通信息的城市轨道交通列车节能运行
PREAI
分享收藏Cooperative passenger flow control in an oversaturated metro network with operational risk thresholds具有运营风险阈值的过饱和地铁网络中的协作客流控制
PREAI
分享收藏
查看更多内容