{'fraction_non_alphanumeric': 0.015503875968992248, 'fraction_numerical': 0.0, 'mean_word_length': 5.525252525252525, '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}}
Study on the vehicle scheduling problem in transportation system

The vehicle scheduling problem (VSP) is a classical optimization problem which is part of the operational planning of public transportation systems. This paper analyzes of the optimization models for vehicle scheduling problem in public transport network. The departure time model and departure interval model are formulated in this presented paper. The heuristic algorithms to solve the above models are developed, which optimize the departure time and interval. Finally, the proposed solution methodology is applied to a case study, and the computational results are presented.