{'fraction_non_alphanumeric': 0.012910798122065728, 'fraction_numerical': 0.0011737089201877935, 'mean_word_length': 4.842465753424658, '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}}
An Ant System for Bus Driver Scheduling 1

This paper reports on one of a number of parallel investigations being undertaken into alternative approaches to solving part or the whole of the bus driver scheduling problem. An arti cial ant system is set up, with ants following trails through a network, each trail representing a complete bus driver schedule. Initial schedules are set up by drawing from shifts generated by other systems available in the University of Leeds. Each trail receives an allocation of pheromone related to the quality of the relevant schedule. As new ants are introduced to the system they are encouraged to follow the more intensive pheromone trails, and the poorer trails gradually lose their intensity. Thus successive ants are likely to follow better trails, and to yield better schedules. We report on our investigations.