The complexity of the timetable‐based railway network design problem

DOI10.1002/NET.22192arXiv2308.00420MaRDI QIDQ6196872FDOQ6196872

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

Publication date: 15 March 2024

Published in: Networks (Search for Journal in Brave)

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Budget-constrained minimum cost flows
• The Recognition of Series Parallel Digraphs
• Robust solutions for network design under transportation cost and demand uncertainty
• Optimization of transit route network, vehicle headways and timetables for large-scale transit networks
• 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
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• GRASP algorithms for the robust railway network design problem
• A survey on robustness in railway planning
• 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)