{'fraction_non_alphanumeric': 0.00620347394540943, 'fraction_numerical': 0.0, 'mean_word_length': 5.404761904761905, '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}}
Closed Form Expressions of Optimal Buffer Times between Scheduled Trains at Railway Bottlenecks

This paper presents an analytical approach for optimally allocating the buffer times between scheduled trains at railway bottlenecks based on a recently developed probabilistic delay propagation model. The design of the buffer times between consecutive trains in a timetable period is improved by minimizing the sum of weighted knock-on delays of the trains. Closed form expressions have been derived for the optimal buffer times by adopting a weighted exponential distribution model for primary delays. An application example reveals that the derived expressions of the optimal buffer times can be used in the design of railway timetables by incorporating the impact of primary delays and priority of trains.