Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1-30 |
| Number of pages | 30 |
| Journal | Transportation Research Part E: Logistics and Transportation Review |
| Volume | 127 |
| DOIs | |
| Publication status | Published - Jul 2019 |
Funding
This work was in part supported by the Ministerio de Economía y Competitividad (Spain)/FEDER under grant MTM2015-67706-P and by the Canadian Natural Sciences and Engineering Research Council under grant 2015-06189 . Thanks are due to the referees for their valuable comments.
Keywords
- Adaptive large neighborhood search
- Line planning
- Matheuristic
- Network design
- Railway rapid transit
ASJC Scopus subject areas
- Business and International Management
- Civil and Structural Engineering
- Transportation