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

David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

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 languageEnglish
Pages (from-to)1-30
Number of pages30
JournalTransportation Research Part E: Logistics and Transportation Review
Volume127
DOIs
Publication statusPublished - Jul 2019

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

Fingerprint Dive into the research topics of 'Integrated Railway Rapid Transit Network Design and Line Planning problem with maximum profit'. Together they form a unique fingerprint.

Cite this