A heuristic for the location of a rapid transit line
From MaRDI portal
Publication:5955468
DOI10.1016/S0305-0548(00)00051-4zbMath1026.90058OpenAlexW2047932630MaRDI QIDQ5955468
Michel Gendreau, Giuseppe Bruno, Gilbert Laporte
Publication date: 13 February 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00051-4
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (16)
Hybrid large neighborhood search for the bus rapid transit route design problem ⋮ Urban rapid transit network design: accelerated Benders decomposition ⋮ An approach for solving a modification of the extended rapid transit network design problem ⋮ Rapid transit network design for optimal cost and origin-destination demand capture ⋮ An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem ⋮ Integrated approach to network design and frequency setting problem in railway rapid transit systems ⋮ Solving real-size stochastic railway rapid transit network construction scheduling problems ⋮ Improved rapid transit network design model: considering transfer effects ⋮ Location Science in Canada ⋮ An extension to rapid transit network design problem ⋮ Urban rapid transit network capacity expansion ⋮ A Lagrangian relaxation approach for expansion of a highway network ⋮ Location of infrastructure in urban railway networks ⋮ Corrigendum to ``Simultaneous location of a service facility and a rapid transit line [Computers \& Operations Research 38 (2) (2011) 525-538] ⋮ Simultaneous location of a service facility and a rapid transit line ⋮ Maximizing trip coverage in the location of a single rapid transit alignment
Cites Work
This page was built for publication: A heuristic for the location of a rapid transit line
