{'fraction_non_alphanumeric': 0.01284796573875803, 'fraction_numerical': 0.0, 'mean_word_length': 5.3175675675675675, '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}}
Bilevel Model and Solution Algorithm for Dynamic Transit Schedule Planning Problem

In this paper, the transit network representation is systematically described by introducing the conceptions of transit link and transit route according to the characteristics of transit network. Then a bilevel programming model for the dynamic transit schedule planning problem is presented. In the bilevel model, the upper model is a normal optimal problem to minimize the total disutility of transit system and the cost caused by schedule setting. The lower model is a transit dynamic user optimal (TDUO) assignment problem, which is used to describe the path alternative activities of transit users. A heuristic solution algorithm based on chaotic method is designed for the bilevel model proposed in this paper. Finally, a simple numerical example is given to illustrate the application of the model and algorithm, and some conclusions are drawn