GRASP algorithms for the robust railway network design problem

DOI10.1007/S10732-011-9185-ZMaRDI QIDQ2359149zbMATH OpenOpenAlexFDO

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

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

heuristicsrobustnesstransportation

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)

Recommendations

• An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
• Solving network design problems via decomposition, aggregation and approximation. With an application to the optimal expansion of railway infrastructure
• Fast approaches to robust railway timetabling
• Solving railway track allocation problems
• Algorithms and models for railway optimization.

Cites work

• scientific article; zbMATH DE number 1163720 (Why is no real title available?)
• A GRASP heuristic for the manufacturing cell formation problem
• A probabilistic heuristic for a computationally difficult set covering problem
• A route set construction algorithm for the transit network design problem
• Integrating Robust Railway Network Design and Line Planning under Failures
• Location of infrastructure in urban railway networks
• Urban rapid transit network design: accelerated Benders decomposition

Cited in

(8)

• Benders decomposition for network design covering problems
• Solving network design problems via decomposition, aggregation and approximation. With an application to the optimal expansion of railway infrastructure
• An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
• Practical constraint \(K\)-segment principal curve algorithms for generating railway GPS digital map
• Integrating Robust Railway Network Design and Line Planning under Failures
• The complexity of the timetable‐based railway network design problem
• Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm
• Revisiting a game theoretic framework for the robust railway network design against intentional attacks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359149)