{'fraction_non_alphanumeric': 0.01936619718309859, 'fraction_numerical': 0.002640845070422535, 'mean_word_length': 4.921875, '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}}
Optimized Model and Algorithm for Scheduling Turnaround Routes of Electric Multiple Units

With the development of China railway high-speed, the total operation mile of the network is making China the world's largest. Routing scheme is the basis for the operation of EMUs, of great significance in improving the efficiency of EMUs and to reduce maintenance cost. On the premise of train operating chart of the high-speed railway, this paper established an integer programming model for scheduling routes of EMUs, with the requirement of EMUs type, quantity for EMUs, servicing time, and time-space subsequent conditions as the operational constraints, with both mileage and time limit regulated by the inspection standard of EMU level-1 as the maintenance constraints, and with the least quantity of routes of EMUs as the objective function. This paper took the problem of 62 pairs of trains for Wu-Guang high-speed railway as an example and put forward a modified MAX-MIN Ant System to solve the model above. The result showed that the model and the solving algorithm could meet the demand of the route scheduling optimization problem.