期刊
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
卷 127, 期 -, 页码 1-30出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2019.04.007
关键词
Network design; Line planning; Railway rapid transit; Matheuristic; Adaptive large neighborhood search
类别
资金
- Ministerio de Economia y Competitividad (Spain)/FEDER [MTM2015-67706-P]
- Canadian Natural Sciences and Engineering Research Council [2015-06189]
We solve the Integrated Network Design and Line Planning Problem in Railway Rapid Transit systems with the objective of maximizing the net profit over a planning horizon, in the presence of a competing transportation mode. Since the profitability of the designed network is closely related with passengers' demand and line operation decisions, for a given demand, a transit assignment is required to compute the profit, calculating simultaneously the frequencies of lines and selecting the most convenient train units. The proposed iterative solving procedure is governed by an adaptive large neighborhood search metaheuristic which, at each iteration, calls a branch-and-cut algorithm implemented in Gurobi in order to solve the assignment and network operation problems. We provide an illustration on a real-size scenario.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据