An efficient train scheduling algorithm on a single-track railway system
From MaRDI portal
Publication:2327960
DOI10.1007/s10951-018-0558-0zbMath1425.90052OpenAlexW2788517386MaRDI QIDQ2327960
Keping Li, Lixing Yang, Zi-You Gao, Xiao-Ming Xu
Publication date: 8 October 2019
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-018-0558-0
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Cites Work
- Unnamed Item
- Railway track allocation: Models and methods
- A fast heuristic for the train scheduling problem
- Local branching
- A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
- A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Nominal and robust train timetabling problems
- Balanced train timetabling on a single-line railway with optimized velocity
- Dispatching and coordination in multi-area railway traffic management
- A branch and bound algorithm for scheduling trains in a railway network
- A Survey of Optimization Models for Train Routing and Scheduling
- Modeling and Solving the Train Timetabling Problem
- A Model, Algorithms and Strategy for Train Pathing