Path based algorithms for metro network design
From MaRDI portal
Publication:337631
DOI10.1016/J.COR.2015.04.007zbMATH Open1348.90157OpenAlexW2085697310MaRDI QIDQ337631FDOQ337631
Authors: G. Laporte, Marta M. B. Pascoal 
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
Recommendations
- Corridor-based metro network design with travel flow capture
- Rapid transit network design for optimal cost and origin-destination demand capture
- Locating a transit line using tabu search
- A heuristic for the location of a rapid transit line
- A survey-based approach for designing the lines of a rapid transit network
Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)
Cites Work
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Title not available (Why is that?)
- Assessing the efficiency of rapid transit configurations
- An empirical investigation of some bicriterion shortest path algorithms
- A label correcting approach for solving bicriterion shortest-path problems
- Multiobjective programming and planning
- An approach for solving a modification of the extended rapid transit network design problem
- A comparison of solution strategies for biobjective shortest path problems
- An extension to rapid transit network design problem
- Label correcting methods to solve multicriteria shortest path problems
- Rapid transit network design for optimal cost and origin-destination demand capture
- Locating a transit line using tabu search
- Title not available (Why is that?)
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- An Interactive Decision Support System For The Design Of Rapid Public Transit Networks
- 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
- Location of infrastructure in urban railway networks
Cited In (10)
- Designing metro network expansion: deterministic and robust optimization models
- Line Crossing Minimization on Metro Maps
- 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
- Efficient algorithms to find optimal paths in a public transportation network
- Title not available (Why is that?)
- Shortest-Paths Preserving Metro Maps
This page was built for publication: Path based algorithms for metro network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337631)
