An exact decomposition approach for the real-time train dispatching problem
From MaRDI portal
Recommendations
- The dispatching problem on multitrack territories: heuristic approaches based on mixed integer linear programming
- A Re-optimization Approach for Train Dispatching
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
- Cost optimal periodic train scheduling
- A bilevel rescheduling framework for optimal inter-area train coordination
Cites work
- 04. Solution of the train platforming problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Disjunctive Programming
- Efficient algorithms for interval graphs and circular-arc graphs
- Exploring the complexity boundary between coloring and list-coloring
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Job-shop scheduling with blocking and no-wait constraints
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Modeling and Solving the Train Timetabling Problem
- Models for railway track allocation
- On the \(k\)-coloring of intervals
- Optimal real-time traffic control in metro stations
- Railway timetabling using Lagrangian relaxation
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
Cited in
(36)- An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances
- The influence of anticipating train driving on the dispatching process in railway conflict situations
- Real-time dispatch of trams in storage yards
- Application of an iterative framework for real-time railway rescheduling
- A branch and bound algorithm and iterative reordering strategies for inserting additional trains in real time: a case study in Germany
- Delay resistant line planning with a view towards passenger transfers
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
- Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
- Rescheduling railway traffic on real time situations using time-interval variables
- Real-time optimization strategy for single-track high-speed train rescheduling with disturbance uncertainties: a scenario-based chance-constrained model predictive control approach
- Railway delay management with passenger rerouting considering train capacity constraints
- Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays
- A logic-based Benders decomposition for microscopic railway timetable planning
- A heuristic approach to solving the train traffic re-scheduling problem in real time
- A train dispatching model under a stochastic environment: stable train routing constraints and reformulation
- Cost optimal periodic train scheduling
- A double-track train rescheduling for incident conditions: optimisation model and decomposition method
- Real-time traffic control in railway systems
- A bilevel rescheduling framework for optimal inter-area train coordination
- Passenger flow-oriented train disposition
- Optimal real-time traffic control in metro stations
- A Re-optimization Approach for Train Dispatching
- Structure-based decomposition for pattern-detection for railway timetables
- Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events
- Easy cases of deadlock detection in train scheduling
- Ship traffic optimization for the Kiel Canal
- A noncompact formulation for job-shop scheduling problems in traffic management
- Set covering heuristics in a benders decomposition for railway timetabling
- An optimization-based decision support tool for incremental train timetabling
- An efficient greedy heuristic for the real-time train platforming problem
- A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems
- Geographic decompositions in railway timetable planning: modelling and computational assessment
- Solving a multi-resolution model of the train platforming problem using Lagrangian relaxation with dynamic multiplier aggregation
- The maintenance scheduling and location choice problem for railway rolling stock
- A stochastic dynamic programming approach for delay management of a single train line
This page was built for publication: An exact decomposition approach for the real-time train dispatching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195230)
