A Lagrangian heuristic algorithm for a real-world train timetabling problem
DOI10.1016/J.DAM.2005.05.026zbMATH Open1120.90324OpenAlexW1983597930MaRDI QIDQ2489900FDOQ2489900
Authors: Alberto Caprara, Michele Monaci, Pier Luigi Guida, Paolo Toth 
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.026
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Railway timetabling using Lagrangian relaxation
- A Model, Algorithms and Strategy for Train Pathing
- Modeling and Solving the Train Timetabling Problem
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- A fast heuristic for the train scheduling problem
- Title not available (Why is that?)
- Heuristic techniques for single line train scheduling
- Cost optimal periodic train scheduling
Cited In (28)
- A fuzzy optimization model for high-speed railway timetable rescheduling
- Modeling and Solving the Train Timetabling Problem
- Train timetabling for an urban rail transit line using a Lagrangian relaxation approach
- Towards solving very large scale train timetabling problems by Lagrangian relaxation
- A novel mixed integer programming model for freight train travel time estimation
- Models and algorithms of conflict detection and scheduling optimization for high-speed train operations based on MPC
- A train dispatching model under a stochastic environment: stable train routing constraints and reformulation
- Timetable rearrangement to cope with railway maintenance activities
- Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities
- Set covering heuristics in a benders decomposition for railway timetabling
- Dynamic graph generation for the shortest path problem in time expanded networks
- Nominal and robust train timetabling problems
- An iterative heuristic for passenger-centric train timetabling with integrated adaption times
- A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem
- Railway track allocation: Models and methods
- A simulated annealing algorithm for first train transfer problem in urban railway networks
- Mathematical model applied to single-track line scheduling problem in Brazilian railways
- A fast heuristic for the train scheduling problem
- A column generation approach to train timetabling on a corridor
- Locating optimal timetables and vehicle schedules in a transit line
- An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint
- Timetable optimization for high-speed trains at Chinese railways
- Railway track allocation
- Exact formulations and algorithm for the train timetabling problem with dynamic demand
- Integration of timetable planning and rolling stock in rapid transit networks
- Scheduled service network design for freight rail transportation
- A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing
This page was built for publication: A Lagrangian heuristic algorithm for a real-world train timetabling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489900)
