GRASP algorithms for the robust railway network design problem

DOI10.1007/s10732-011-9185-zzbMath1365.90165OpenAlexW2079388327MaRDI QIDQ2359149

Antonio J. Lozano, Juan A. Mesa, Federico Perea, Bosco García-Archilla

Publication date: 27 June 2017

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/58853

zbMATH Keywords

heuristicstransportationrobustness

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)

Related Items (4)

An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem ⋮ Benders decomposition for network design covering problems ⋮ Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm ⋮ The complexity of the timetable‐based railway network design problem

Cites Work

• Unnamed Item
• Urban rapid transit network design: accelerated Benders decomposition
• Location of infrastructure in urban railway networks
• A route set construction algorithm for the transit network design problem
• A probabilistic heuristic for a computationally difficult set covering problem
• A GRASP heuristic for the manufacturing cell formation problem
• Integrating Robust Railway Network Design and Line Planning under Failures

This page was built for publication: GRASP algorithms for the robust railway network design problem