The complexity of the timetable‐based railway network design problem

DOI10.1002/net.22192arXiv2308.00420MaRDI QIDQ6196872

Nils Nießen, Christina Büsing, Unnamed Author, Unnamed Author, Karl Nachtigall

Publication date: 15 March 2024

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

timetablingrobust optimizationnetwork designrailway planningrailway network designstrategic timetabling

Mathematics Subject Classification ID

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

Cites Work

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

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