Path based algorithms for metro network design
From MaRDI portal
Publication:337631
DOI10.1016/j.cor.2015.04.007zbMath1348.90157OpenAlexW2085697310MaRDI QIDQ337631
Marta M. B. Pascoal, Gilbert Laporte
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/44388
Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)
Related Items (6)
A path-based solution approach for the green vehicle routing problem ⋮ An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem ⋮ Multi-objective rapid transit network design with modal competition: the case of Concepción, Chile ⋮ Corridor-based metro network design with travel flow capture ⋮ Solving real-size stochastic railway rapid transit network construction scheduling problems ⋮ Designing metro network expansion: deterministic and robust optimization models
Cites Work
- Unnamed Item
- Unnamed Item
- Rapid transit network design for optimal cost and origin-destination demand capture
- The transit route arc-node service maximization problem
- Minimum cost path problems with relays
- Maximizing trip coverage in the location of a single rapid transit alignment
- Strategic route extension in transit networks
- An approach for solving a modification of the extended rapid transit network design problem
- An extension to rapid transit network design problem
- A comparison of solution strategies for biobjective shortest path problems
- Location of infrastructure in urban railway networks
- Multiobjective programming and planning
- Assessing the efficiency of rapid transit configurations
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- An empirical investigation of some bicriterion shortest path algorithms
- A label correcting approach for solving bicriterion shortest-path problems
- Locating a transit line using tabu search
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- An Interactive Decision Support System For The Design Of Rapid Public Transit Networks
- Label correcting methods to solve multicriteria shortest path problems
This page was built for publication: Path based algorithms for metro network design
