A Rescheduling Algorithm of Train-group for Railway Emergencies and its Parallelization

DOI

10.2991/iccia.2012.128How to use a DOI?

Keywords

train groups, rescheduling, railroad emergencies, parallel processing

Abstract

In order to reduce the delays of train groups when suffering from railroad emergencies, we propose a rescheduling algorithm of train groups to reschedule trains, instead of previous just waiting. A heuristic algorithm is designed to search the proper path for the trains involved in the railroad emergencies. An evaluation criterion based on the extent of the disturbance towards the original timetable and limited time is designed to select the optimal path for each train. And a conflicts resolution strategy is designed to deal with the path and time conflicts among trains when rescheduling. In the end, due to the real-time needs of the railroad scheduling, we implement the parallel processing for the train-group rescheduling referring to the allocation of loads. Experimental results show that the rescheduling algorithm is efficient to reduce the delays of train groups and the parallel processing meets the real-time response of the train-group rescheduling well.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zifeng Wang
AU  - Li Ruan
AU  - Limin Xiao
PY  - 2014/05
DA  - 2014/05
TI  - A Rescheduling Algorithm of Train-group for Railway Emergencies and its Parallelization
BT  - Proceedings of the 2012 2nd International Conference on Computer and Information Application (ICCIA 2012)
PB  - Atlantis Press
SP  - 530
EP  - 534
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccia.2012.128
DO  - 10.2991/iccia.2012.128
ID  - Wang2014/05
ER  -