{'fraction_non_alphanumeric': 0.016200294550810016, 'fraction_numerical': 0.0, 'mean_word_length': 5.126126126126126, '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}}
Modeling and Solving for Railway Crew Scheduling Problem

An improved railway crew scheduling model was presented, and the objective was to schedule crews in such a way that the deadheading was minimized while the operational constraints were satisfied. Ant colony algorithm (ACA) was devised to solve railway crew scheduling problem (RCSP) based on principle of ACA used to solve vehicle routing problem (VRP). Improvement on route construction rule and pheromone updating rule was adopted on the basis of former algorithm. An example was analyzed to demonstrate the correctness of the application of this algorithm. It is proved that ACA is efficient and robust in solving RCSP