{'fraction_non_alphanumeric': 0.025983667409057165, 'fraction_numerical': 0.0, 'mean_word_length': 5.480769230769231, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Policy-Based Reinforcement Learning Approach for High-Speed Railway Timetable Rescheduling

In the daily management of high-speed railway systems, the train timetable rescheduling problem with unpredictable disturbances is a challenging task. The large number of stations and trains leads to a long-time consumption to solve the rescheduling problem, making it difficult to meet the realtime requirements in real-world railway networks. This paper proposes a policy-based reinforcement learning approach to address the high-speed railway timetable rescheduling problem, in which the agent minimizes the total delay by adjusting the departure sequence of all trains along the railway line. A two-stage Markov Decision Process model is established to model the environment where states, actions, and reward functions are designed. The proposed method contains an offline learning process and an online application process, which can give the optimal rescheduling schedule based on the current state immediately. Numerical experiments are performed over two different delay scenarios on the Beijing-Shanghai high-speed railway line. The simulation results show that our approach can find a high-quality rescheduling strategy within one second, which is superior to the First-Come-First-Served (FCFS) and First-Scheduled-First-Served (FSFS) methods.