{'fraction_non_alphanumeric': 0.01440922190201729, 'fraction_numerical': 0.0, 'mean_word_length': 5.318181818181818, '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}}
Guided Bee Colony Algorithm Applied to the Daily Car Pooling Problem

The foraging behavior of bees has been adapted in a Bee Colony Optimization algorithm (BCO). This approach is a simple and an efficient metaheuristic that has been successfully used to solve many complex optimization problems in different domains, mostly in transportation, location and scheduling fields. In this study, we develop two algorithms for the Daily Car Pooling Problem based on the BCO approach. The developed algorithms are experimentally tested on benchmark instances of different sizes. The computational results show that the proposed approaches can produce good solutions when compared with an exact method.