Path based algorithms for metro network design

Path based algorithms for metro network design

0.00 Avg rating—0 Votes
Article ID: iaor201527127
Volume: 62
Issue: 6
Start Page Number: 78
End Page Number: 94
Publication Date: Oct 2015
Journal: Computers and Operations Research
Authors: ,
Keywords: design, heuristics, programming: multiple criteria, combinatorial optimization, programming: mathematical
Abstract:

  • We propose a flexible and modular heuristic for the planning of metro networks.
  • Two criteria are optimized jointly: population coverage and construction cost.
  • Non‐dominated lines are generated within corridors specified by the planners.
  • These lines are then assembled into a network through mathematical programming.
  • The algorithm is intuitive, flexible and computationally efficient.

    • Reviews

    Required fields are marked *. Your email address will not be published.