Path based algorithms for metro network design

Gilbert Laporte, Marta M.B. Pascoal

Research output: Contribution to journalArticlepeer-review

25 Citations (SciVal)


This paper proposes a practical methodology for the problem of designing a metro configuration under two criteria: population coverage and construction cost. It is assumed that a set of corridors defining a rough a priori geometric configuration is provided by the planners. The proposed algorithm consists of fine tuning the location of single alignments within each corridor. This is achieved by means of a bicriteria methodology that generates sets of non-dominated paths. These alignments are then combined to form a metro network by solving a bicriteria integer linear program. Extensive computational experiments confirm the efficiency of the proposed methodology.

Original languageEnglish
Pages (from-to)78-94
Number of pages17
JournalComputers and Operations Research
Publication statusPublished - 16 May 2015


  • Bicriteria optimization
  • Metro network design
  • Path based algorithm

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research


Dive into the research topics of 'Path based algorithms for metro network design'. Together they form a unique fingerprint.

Cite this