The railway network design, line planning and capacity problem: An adaptive large neighborhood search metaheuristic

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

Research output: Chapter in Book/Report/Conference proceedingChapter

6 Citations (Scopus)

Abstract

In this chapter, we propose a model for the Railway Network Design and Line Planning (RNDLP) problem, integrating the two classical first stages in the Railway Planning Process. The network design problem incorporates costs relative to the network construction, proposing a set of candidate lines. The line planning problem is in charge of determining optimal frequencies and consequently train operations, taking into account rolling stock, personnel and fleet acquisition costs. Both problems are intertwined because the line design influences the selection of frequencies and the corresponding fleet size. We consider the existence of an alternative transportation mode for each origin-destination pair in the network. In this way, the rapid railway mode competes against the alternative mode for a given certain demand, represented by a global origin-destination matrix. Passengers choose their transportation mode according to their own utility. Since the problem is computationally intractable for realistic size scenarios, we develop an Adaptive Large Neighborhood Search (ALNS) algorithm, which can handle the RNDLP problem. As illustration, the ALNS performance is demonstrated in an artificial instance using estimated data from literature.

Original languageEnglish
Title of host publicationAdvances in Intelligent Systems and Computing
EditorsJ. Zak, Y. Hadas, R. Rossi
Place of PublicationCham, Switzerland
PublisherSpringer Verlag
Pages198-219
Number of pages22
ISBN (Electronic)9783319571058
ISBN (Print)9783319571041
DOIs
Publication statusPublished - 1 Jan 2018

Publication series

NameAdvances in Intelligent Systems and Computing
Volume572
ISSN (Print)2194-5357

Keywords

  • Adaptive large neighborhood search
  • Line planning
  • Network design
  • Railway rapid transit

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

Cite this

Canca, D., De-Los-Santos, A., Laporte, G., & Mesa, J. A. (2018). The railway network design, line planning and capacity problem: An adaptive large neighborhood search metaheuristic. In J. Zak, Y. Hadas, & R. Rossi (Eds.), Advances in Intelligent Systems and Computing (pp. 198-219). (Advances in Intelligent Systems and Computing; Vol. 572). Springer Verlag. https://doi.org/10.1007/978-3-319-57105-8_9