Towards solving very large scale train timetabling problems by Lagrangian relaxation
From MaRDI portal
Recommendations
- Railway timetabling using Lagrangian relaxation
- Dynamic graph generation and dynamic rolling horizon techniques in large scale train timetabling
- Modeling and Solving the Train Timetabling Problem
- A Lagrangian heuristic algorithm for a real-world train timetabling problem
- A Note on the Use of Lagrangean Relaxation in Railway Scheduling
Cited in
(13)- Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling
- Train timetabling for an urban rail transit line using a Lagrangian relaxation approach
- A multi-stage IP-based heuristic for class timetabling and trainer rostering
- Dynamic graph generation for the shortest path problem in time expanded networks
- A Lagrangian heuristic algorithm for a real-world train timetabling problem
- Railway timetabling using Lagrangian relaxation
- Almost 20 years of combinatorial optimization for railway planning: from Lagrangian relaxation to column generation
- Dynamic graph generation and dynamic rolling horizon techniques in large scale train timetabling
- Modeling and Solving the Train Timetabling Problem
- Optimizing the simplon railway corridor
- A Note on the Use of Lagrangean Relaxation in Railway Scheduling
- Scheduling a heterogeneous set of trains over a single line track using Lagrangian relaxation
- A column generation approach to train timetabling on a corridor
This page was built for publication: Towards solving very large scale train timetabling problems by Lagrangian relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917354)
