Path based algorithms for metro network design
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1138444 (Why is no real title available?)
- A comparison of solution strategies for biobjective shortest path problems
- A label correcting approach for solving bicriterion shortest-path problems
- An Interactive Decision Support System For The Design Of Rapid Public Transit Networks
- An approach for solving a modification of the extended rapid transit network design problem
- An empirical investigation of some bicriterion shortest path algorithms
- An extension to rapid transit network design problem
- Assessing the efficiency of rapid transit configurations
- Label correcting methods to solve multicriteria shortest path problems
- Locating a transit line using tabu search
- Location of infrastructure in urban railway networks
- Maximizing trip coverage in the location of a single rapid transit alignment
- Minimum cost path problems with relays
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Multiobjective programming and planning
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Rapid transit network design for optimal cost and origin-destination demand capture
- Strategic route extension in transit networks
- The transit route arc-node service maximization problem
Cited in
(11)- A path-based solution approach for the green vehicle routing problem
- Designing metro network expansion: deterministic and robust optimization models
- Solving real-size stochastic railway rapid transit network construction scheduling problems
- Multi-objective rapid transit network design with modal competition: the case of Concepción, Chile
- Shortest-Paths Preserving Metro Maps
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
- Efficient algorithms to find optimal paths in a public transportation network
- Corridor-based metro network design with travel flow capture
- Line Crossing Minimization on Metro Maps
- scientific article; zbMATH DE number 2040699 (Why is no real title available?)
- An automatic method for generating multiple alignment alternatives for a railway bypass
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)
