Integrated Railway Rapid Transit Network Design and Line Planning problem with maximum profit

被引：80

作者：

Canca, David ^{[1
]}

De-Los-Santos, Alicia ^{[2
]}

Laporte, Gilbert ^{[3
]}

Mesa, Juan A. ^{[4
]}

机构：

[1] Univ Seville, Dept Ind Engn & Management Sci, Seville, Spain

[2] Univ Cordoba, Dept Stat Econometr Operat Res Management Sci & A, Cordoba, Spain

[3] HEC Montreal, Distribut Management, Montreal, PQ, Canada

[4] Univ Seville, Dept Matemat Aplicada 2, Seville, Spain

来源：

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2019年 / 127卷

基金：

加拿大自然科学与工程研究理事会;

关键词：

Network design; Line planning; Railway rapid transit; Matheuristic; Adaptive large neighborhood search; LARGE NEIGHBORHOOD SEARCH; ROLLING STOCK CIRCULATION; PUBLIC TRANSPORT; ASSIGNMENT MODEL; OPTIMIZATION; DEMAND; FREQUENCY; LOCATION; ALGORITHMS; CAR;

D O I：

10.1016/j.tre.2019.04.007

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

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.

引用

页码：1 / 30

页数：30

共 76 条

[1] A survey of very large-scale neighborhood search techniques [J].