Pages that link to "Item:Q2489900"
From MaRDI portal
The following pages link to A Lagrangian heuristic algorithm for a real-world train timetabling problem (Q2489900):
Displaying 28 items.
- Locating optimal timetables and vehicle schedules in a transit line (Q490235) (← links)
- Timetable optimization for high-speed trains at Chinese railways (Q510913) (← links)
- Railway track allocation: Models and methods (Q657061) (← links)
- Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
- A column generation approach to train timetabling on a corridor (Q941001) (← links)
- A fast heuristic for the train scheduling problem (Q1321800) (← links)
- Models and algorithms of conflict detection and scheduling optimization for high-speed train operations based on MPC (Q1629501) (← links)
- A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem (Q1652413) (← links)
- Timetable rearrangement to cope with railway maintenance activities (Q1652638) (← links)
- Integration of timetable planning and rolling stock in rapid transit networks (Q1761752) (← links)
- Nominal and robust train timetabling problems (Q1926692) (← links)
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
- A fuzzy optimization model for high-speed railway timetable rescheduling (Q1936036) (← links)
- A novel mixed integer programming model for freight train travel time estimation (Q2116880) (← links)
- An iterative heuristic for passenger-centric train timetabling with integrated adaption times (Q2147000) (← links)
- Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities (Q2240012) (← links)
- A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing (Q2242251) (← links)
- Exact formulations and algorithm for the train timetabling problem with dynamic demand (Q2257347) (← links)
- Train timetabling for an urban rail transit line using a Lagrangian relaxation approach (Q2281738) (← links)
- A simulated annealing algorithm for first train transfer problem in urban railway networks (Q2285990) (← links)
- A train dispatching model under a stochastic environment: stable train routing constraints and reformulation (Q2357928) (← links)
- Dynamic graph generation for the shortest path problem in time expanded networks (Q2436645) (← links)
- Scheduled service network design for freight rail transportation (Q2875607) (← links)
- Towards solving very large scale train timetabling problems by Lagrangian relaxation (Q2917354) (← links)
- Modeling and Solving the Train Timetabling Problem (Q3635144) (← links)
- Railway Track Allocation (Q5171773) (← links)
- An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems (Q5882416) (← links)
- Set covering heuristics in a benders decomposition for railway timetabling (Q6047880) (← links)
