Pages that link to "Item:Q2489900"

The following pages link to A Lagrangian heuristic algorithm for a real-world train timetabling problem (Q2489900):

Displaying 23 items.

• Locating optimal timetables and vehicle schedules in a transit line (Q490235) (← 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)
• 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)
• 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)
• 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)