{'fraction_non_alphanumeric': 0.014694508894044857, 'fraction_numerical': 0.0, 'mean_word_length': 4.9907407407407405, '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}}
Combining decision tree algorithm for planning crew schedule for complex lines

In this paper, a heuristic FIFO algorithm combined with decision tree algorithm is proposed for the problem of urban rail transit crew planning. First, when cutting the crew carriage working diagram, we select the minimum fragment cutting method based on the crew lounge to ensure that the cutting method does not affect the decision result. After that, the FIFO algorithm is used to solve the problem, combined with the decision tree algorithm to correct the defects generated by the FIFO, heuristically search for the locally optimal solution. We use the Depth First Search in the search process to reduce the amount of calculation. When the termination condition of the search algorithm is satisfied, if no feasible solution for the connection of the crew shift is found, the target value will be reduced by one to restart. The above process is repeated until a feasible solution is found. Computational experiments based on four operating diagram data of a subway line show that compared with the traditional manual schedule compilation of operating companies, this algorithm can obtain better results. In the future, in the face of more complex urban rail transit lines, this method can show more advantages.