Rapid transit network design for optimal cost and origin-destination demand capture

DOI10.1016/j.cor.2013.06.013zbMath1348.90664OpenAlexW2070583489MaRDI QIDQ336685

Vladimir Marianov, Carlos Obreque, Gabriel Gutiérrez-Jarpa, Gilbert Laporte

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.06.013

zbMATH Keywords

networkslocationcoveragetraffic capturetransit systems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10)

Related Items (8)

Path based algorithms for metro network design ⋮ Multi-objective rapid transit network design with modal competition: the case of Concepción, Chile ⋮ Corridor-based metro network design with travel flow capture ⋮ Improved rapid transit network design model: considering transfer effects ⋮ Designing metro network expansion: deterministic and robust optimization models ⋮ Multi-objective decision method for airport landside rapid transit network design ⋮ A quantitative approach for the long-term assessment of railway rapid transit network construction or expansion projects ⋮ Application of complex networks theory in urban traffic network researches

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The transit route arc-node service maximization problem
• Maximizing trip coverage in the location of a single rapid transit alignment
• Locating stops along bus or railway lines -- a bicriteria problem
• 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
• Comparing different metaheuristic approaches for the median path problem with bounded length
• Location of infrastructure in urban railway networks
• A coverage model for improving public transit system accessibility and expanding access
• Locating median cycles in networks
• General network design: a unified view of combined location and network design problems
• Optimization methods for the planning of rapid transit systems
• A branch-and-cut algorithm for the median-path problem
• A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• A branch-and-cut algorithm for the plant-cycle location problem
• An Interactive Decision Support System For The Design Of Rapid Public Transit Networks
• A heuristic for the location of a rapid transit line
• Locating stations on rapid transit lines

This page was built for publication: Rapid transit network design for optimal cost and origin-destination demand capture