Pages that link to "Item:Q3635144"

The following pages link to Modeling and Solving the Train Timetabling Problem (Q3635144):

Displaying 50 items.

• Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem (Q300032) (← links)
• An experimental comparison of periodic timetabling models (Q336491) (← links)
• Optimizing the simplon railway corridor (Q475174) (← links)
• Locating optimal timetables and vehicle schedules in a transit line (Q490235) (← links)
• Timetable optimization for high-speed trains at Chinese railways (Q510913) (← links)
• Timetabling optimization of a mixed double- and single-tracked railway network (Q622927) (← links)
• Optimising a coal rail network under capacity constraints (Q656055) (← links)
• Railway track allocation: Models and methods (Q657061) (← links)
• Timetabling optimization of a single railway track line with sensitivity analysis (Q845568) (← links)
• A column generation approach to train timetabling on a corridor (Q941001) (← links)
• Non-cyclic train timetabling and comparability graphs (Q974988) (← links)
• Models and algorithms for combinatorial optimization problems arising in railway applications (Q1022444) (← links)
• Managing the ship movements in the Port of Venice (Q1642949) (← links)
• A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem (Q1652413) (← links)
• Delay resistant line planning with a view towards passenger transfers (Q1688439) (← links)
• Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling (Q1695036) (← links)
• Timetable design for urban rail line with capacity constraints (Q1723337) (← links)
• Approaches to modeling train scheduling problems as job-shop problems with blocking constraints (Q1743650) (← links)
• Integration of timetable planning and rolling stock in rapid transit networks (Q1761752) (← links)
• Nominal and robust train timetabling problems (Q1926692) (← links)
• Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling (Q2030368) (← links)
• Integrated rolling stock deadhead routing and timetabling in urban rail transit lines (Q2076825) (← links)
• Multiple train repositioning operations in a railyard network (Q2084317) (← links)
• An iterative heuristic for passenger-centric train timetabling with integrated adaption times (Q2147000) (← links)
• A logic-based Benders decomposition for microscopic railway timetable planning (Q2158004) (← links)
• Timetable coordination in a rail transit network with time-dependent passenger demand (Q2239858) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← 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)
• Adjusting a railway timetable in case of partial or complete blockades (Q2256323) (← links)
• Exact formulations and algorithm for the train timetabling problem with dynamic demand (Q2257347) (← links)
• A simulated annealing algorithm for first train transfer problem in urban railway networks (Q2285990) (← links)
• Timetable coordination of first trains in urban railway network: a case study of Beijing (Q2293454) (← links)
• Comprehensive optimization of urban rail transit timetable by minimizing total travel times under time-dependent passenger demand and congested conditions (Q2295338) (← links)
• Minimizing the waiting time for a one-way shuttle service (Q2305017) (← links)
• An efficient train scheduling algorithm on a single-track railway system (Q2327960) (← links)
• The train frequency compatibility problem (Q2328084) (← links)
• A train dispatching model under a stochastic environment: stable train routing constraints and reformulation (Q2357928) (← links)
• Branch-and-bound-based local search heuristics for train timetabling on single-track railway network (Q2358095) (← links)
• A branch and bound algorithm for scheduling trains in a railway network (Q2371354) (← links)
• Dynamic graph generation for the shortest path problem in time expanded networks (Q2436645) (← links)
• The problem of trains formation and scheduling: integer statements (Q2441252) (← links)
• An efficient computational approach for railway booking problems (Q2455640) (← links)
• A Lagrangian heuristic algorithm for a real-world train timetabling problem (Q2489900) (← links)
• Scheduling local and express trains in suburban rail transit lines: mixed-integer nonlinear programming and adaptive genetic algorithm (Q2669536) (← links)
• A Benders decomposition algorithm for demand-driven metro scheduling (Q2669703) (← links)
• Railway timetabling using Lagrangian relaxation (Q2783825) (← links)
• Scheduled service network design for freight rail transportation (Q2875607) (← links)
• Dynamic graph generation and dynamic rolling horizon techniques in large scale train timetabling (Q2917286) (← links)
• Towards solving very large scale train timetabling problems by Lagrangian relaxation (Q2917354) (← links)