{'fraction_non_alphanumeric': 0.012582781456953643, 'fraction_numerical': 0.0, 'mean_word_length': 5.83710407239819, '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 disjunctive program formulation to generate regular public transit timetables adhering to prioritized planning requirements

Timetable regularity, that is, equability of headways, is an important measure for service quality in high frequency public transit systems, assuring an evenly distributed passenger load as well as improving product attractiveness. However, to be feasible during daily operation a timetable may also have to adhere to other planning requirements, such as departure time coordination with other service providers or deliberately short headways to reduce the passenger load of follow‐up vehicles. In this article, a disjunctive program formulation combining aspects of two previous optimization models is proposed, to generate regular public transit timetables adhering to planning requirements. The modeled requirements not only allow for the consideration of feasibility constraints from daily operations, but also for the consideration of simultaneous departures for transfer connections, an objective traditionally opposed to regularity. To show its applicability the approach is applied to two models of artificial transit networks as well as to models of the public transit network of Cologne, Germany. The results show that the proposed formulation can be used to generate timetables for network instances of realistic size in acceptable time. For networks consisting of multiple connected components it is shown that a decomposition approach can significantly reduce run times.