Optimizing the simplon railway corridor

DOI10.1007/s10479-012-1260-9zbMath1301.90028OpenAlexW2040726011MaRDI QIDQ475174

Thomas Schlechte, Thomas Graffagnino, Elmar Swarat, Ralf Borndörfer, Berkan Erol

Publication date: 26 November 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1260-9

zbMATH Keywords

case studynetwork aggregationrailway track allocationsimplon corridor

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Railway scheduling using Boolean satisfiability modulo simulations ⋮ Complexity, bounds and dynamic programming algorithms for single track train scheduling ⋮ Railway Track Allocation ⋮ Multiple train repositioning operations in a railyard network

Uses Software

• TTPLib

Cites Work

• A column generation approach to train timetabling on a corridor
• Models and algorithms for combinatorial optimization problems arising in railway applications
• A fast heuristic for the train scheduling problem
• Railway Timetabling Using Lagrangian Relaxation
• Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation
• 04. Solution of the Train Platforming Problem
• Models for Railway Track Allocation
• Modeling and Solving the Train Timetabling Problem
• Disruption Management in Passenger Railway Transportation
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• Train Scheduling in a Large and Highly Utilised Railway Network
• Periodic Timetable Optimization in Public Transport

This page was built for publication: Optimizing the simplon railway corridor