An efficient greedy heuristic for the real-time train platforming problem
From MaRDI portal
Publication:6551135
Cites work
- A geometric model for an effective rescheduling after reducing service in public transportation systems
- A set packing inspired method for real-time junction train routing
- A short-turning policy for the management of demand disruptions in rapid transit systems
- A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
- An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances
- An exact decomposition approach for the real-time train dispatching problem
- Building and solving mathematical programming models in engineering and science
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Column generation algorithms for nonlinear optimization. II: Numerical investigations
- Decomposition techniques in mathematical programming. Engineering and science applications.
- Dispatching and coordination in multi-area railway traffic management
- Job-shop scheduling with blocking and no-wait constraints
- On-line reschedule optimization for passenger railways in case of emergencies
- Railway track allocation: Models and methods
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
This page was built for publication: An efficient greedy heuristic for the real-time train platforming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551135)
