Path based algorithms for metro network design
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.
path based algorithm metro network design bicriteria optimization