Regarding the railway station tracks and train running routes as machines, all trains in this railway station as jobs, dispatching trains in high-speed railway passenger stations can be considered as a special type of Job-Shop Problem (JSP). In this paper, we proposed a multi-machines, multi-jobs JSP model with special constraints for Operation Plan Scheduling Problem (OPSP) in high-speed railway passenger stations, and presented a fast heuristic algorithm based on greedy heuristic. This algorithm first divided all operations into several layers according to the yards attributes and the operation’s urgency level. Then every operation was allotted a feasible time window, each operation was assigned to a specified “machine” sequenced or backward sequenced within the time slot, layer by layer according to its priority. As we recorded and modified the time slots dynamically, the searching space was decreased dramatically. And we take the South Beijing High-speed Railway Station as example and give extensive numerical experiment. Computational results based on real-life instance show that the algorithm has significant merits for large scale problems; can both reduce tardiness and shorten cycle times. The empirical evidence also proved that this algorithm is industrial practicable.
Skip Nav Destination
2010 Joint Rail Conference
April 27–29, 2010
Urbana, Illinois, USA
Conference Sponsors:
- Rail Transportation Division
ISBN:
978-0-7918-4907-1
PROCEEDINGS PAPER
Dynamic Scheduling Model and Algorithm for Dispatching Trains in High-Speed Railway Passenger Station Available to Purchase
Yixiang Yue,
Yixiang Yue
Beijing Jiaotong University, Beijing, China
Search for other works by this author on:
Leishan Zhou
Leishan Zhou
Beijing Jiaotong University, Beijing, China
Search for other works by this author on:
Yixiang Yue
Beijing Jiaotong University, Beijing, China
Leishan Zhou
Beijing Jiaotong University, Beijing, China
Paper No:
JRC2010-36167, pp. 441-450; 10 pages
Published Online:
October 28, 2010
Citation
Yue, Y, & Zhou, L. "Dynamic Scheduling Model and Algorithm for Dispatching Trains in High-Speed Railway Passenger Station." Proceedings of the 2010 Joint Rail Conference. 2010 Joint Rail Conference, Volume 2. Urbana, Illinois, USA. April 27–29, 2010. pp. 441-450. ASME. https://doi.org/10.1115/JRC2010-36167
Download citation file:
9
Views
Related Proceedings Papers
Beyond Adaptive Braking
JRC2010
Related Articles
An Adaptive Job Shop Scheduling Mechanism for Disturbances by Running Reinforcement Learning in Digital Twin Environment
J. Comput. Inf. Sci. Eng (October,2023)
Generating Dispatching Rules for the Interrupting Swap-Allowed Blocking Job Shop Problem Using Graph Neural Network and Reinforcement Learning
J. Manuf. Sci. Eng (January,2024)
Computing Schemes for Longitudinal Train Dynamics: Sequential, Parallel and Hybrid
J. Comput. Nonlinear Dynam (November,2015)
Related Chapters
Evaluation of Solution Quality of GRASP and Simulated Annealing+GRASP Metaheuristics in FJSP
International Conference on Electronics, Information and Communication Engineering (EICE 2012)
The Effectiveness of Neighborhood Structures in Local Search Algorithms for Flexible Job Shop Scheduling Problem
International Conference on Mechanical Engineering and Technology (ICMET-London 2011)
Application Study of Ant Colony Algorithm in Job Shop Scheduling Problem
International Conference on Mechanical and Electrical Technology, 3rd, (ICMET-China 2011), Volumes 1–3