The complexity of the timetable‐based railway network design problem

DOI10.1002/NET.22192MaRDI QIDQ6196872zbMATH OpenFDO

Authors Christina Büsing, Karl Nachtigall, Nils Nießen

Publication date 15 March 2024

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://arxiv.org/abs/2308.00420

zbMATH Keywords

robust optimizationnetwork designtimetablingrailway planningrailway network designstrategic timetabling

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

Recommendations

• Modeling uncertainty in the timetable-based railway network design problem
• Solving network design problems via decomposition, aggregation and approximation. With an application to the optimal expansion of railway infrastructure
• GRASP algorithms for the robust railway network design problem
• Nominal and robust train timetabling problems
• A probabilistic \((\max,+)\) approach for determining railway infrastructure capacity.

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A survey on robustness in railway planning
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Benders, metric and cutset inequalities for multicommodity capacitated network design
• Budget-constrained minimum cost flows
• GRASP algorithms for the robust railway network design problem
• Optimization of transit route network, vehicle headways and timetables for large-scale transit networks
• Robust possibilistic programming for socially responsible supply chain network design: a new approach
• Robust solutions for network design under transportation cost and demand uncertainty
• The Recognition of Series Parallel Digraphs
• The generalized fixed-charge network design problem
• Variable neighborhood search for integrated timetable based design of railway infrastructure

Cited in

(1)

• Modeling uncertainty in the timetable-based railway network design problem

This page was built for publication: The complexity of the timetable‐based railway network design problem

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