Pages that link to "Item:Q2371354"
From MaRDI portal
The following pages link to A branch and bound algorithm for scheduling trains in a railway network (Q2371354):
Displayed 50 items.
- Capacity consumption analysis using heuristic solution method for under construction railway routes (Q291652) (← links)
- Optimisation models for expanding a railway's theoretical capacity (Q322775) (← links)
- Determining operations affected by delay in predictive train timetables (Q336779) (← links)
- Review of real-time vehicle schedule recovery methods in transportation services (Q490374) (← links)
- Towards railway traffic management using switching max-plus-linear systems, structure analysis and rescheduling (Q503024) (← links)
- Timetable optimization for high-speed trains at Chinese railways (Q510913) (← links)
- A short-turning policy for the management of demand disruptions in rapid transit systems (Q512986) (← links)
- A new constraint programming approach for optimising a coal rail system (Q523170) (← links)
- Timetabling optimization of a mixed double- and single-tracked railway network (Q622927) (← links)
- Optimising a coal rail network under capacity constraints (Q656055) (← links)
- A job-shop scheduling approach for optimising sugarcane rail operations (Q656056) (← links)
- Railway track allocation: Models and methods (Q657061) (← links)
- A stochastic dynamic programming approach for delay management of a single train line (Q724130) (← links)
- Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
- A new neighborhood and tabu search for the blocking job shop (Q967433) (← links)
- Techniques for restricting multiple overtaking conflicts and performing compound moves when constructing new train schedules (Q969881) (← links)
- An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances (Q1024078) (← links)
- Models and algorithms of conflict detection and scheduling optimization for high-speed train operations based on MPC (Q1629501) (← links)
- Application of an iterative framework for real-time railway rescheduling (Q1652076) (← links)
- A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations (Q1652116) (← links)
- A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem (Q1652413) (← links)
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling (Q1695036) (← links)
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraints (Q1743650) (← links)
- A model predictive control approach for discrete-time rescheduling in complex central railway station areas (Q1761201) (← links)
- Real-time freight locomotive rescheduling and uncovered train detection during disruption (Q1926901) (← links)
- A fuzzy optimization model for high-speed railway timetable rescheduling (Q1936036) (← links)
- Rescheduling railway traffic on real time situations using time-interval variables (Q2011607) (← links)
- Railway delay management with passenger rerouting considering train capacity constraints (Q2028881) (← links)
- Simultaneous node and link districting in transportation networks: model, algorithms and railway application (Q2030544) (← links)
- Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← 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)
- Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing (Q2104772) (← links)
- Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays (Q2108176) (← links)
- A robust train timetable optimization approach for reducing the number of waiting passengers in metro systems (Q2141824) (← links)
- A data-driven, variable-speed model for the train timetable rescheduling problem (Q2146975) (← links)
- Effective train routing selection for real-time traffic management: improved model and ACO parallel computing (Q2147150) (← links)
- Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances (Q2163779) (← links)
- Efficient primal heuristic updates for the blocking job shop problem (Q2239845) (← links)
- Timetable coordination in a rail transit network with time-dependent passenger demand (Q2239858) (← links)
- Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities (Q2240012) (← links)
- Improving the robustness in railway station areas (Q2256230) (← links)
- Dispatching and coordination in multi-area railway traffic management (Q2257356) (← links)
- A simulated annealing algorithm for first train transfer problem in urban railway networks (Q2285990) (← links)
- Rescheduling subway trains by a discrete event model considering service balance performance (Q2290044) (← links)
- Comprehensive optimization of urban rail transit timetable by minimizing total travel times under time-dependent passenger demand and congested conditions (Q2295338) (← links)
- Optimization based high-speed railway train rescheduling with speed restriction (Q2321553) (← links)
- An efficient train scheduling algorithm on a single-track railway system (Q2327960) (← links)
- A heuristic approach to solving the train traffic re-scheduling problem in real time (Q2331466) (← links)
- Branch-and-bound-based local search heuristics for train timetabling on single-track railway network (Q2358095) (← links)
