{'fraction_non_alphanumeric': 0.022703818369453045, 'fraction_numerical': 0.0, 'mean_word_length': 5.298701298701299, '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}}
Multi-objective memetic algorithm for solving pickup and delivery problem with dynamic customer requests and traffic information

This paper formulates one-to-many-to-one pickup and delivery problems with dynamic customer requests and traffic information. A multi-objective memetic algorithm namely prioLSH-MOMA is proposed to solve the problems. The new algorithm is characterized with a priority and locality-sensitive hashing based local search. prioLSH-MOMA is designed to find an optimal route of a dynamic pickup and delivery problem in terms of route length and workload. Particularly, a re-planning strategy is introduced to handle the dynamic information. Priority and locality-sensitive hashing based local search is applied to fine-tune the candidate routes during the evolution process. prioLSH-MOMA is evaluated with two dynamic pickup and delivery problems simulated on real-world maps and the results demonstrate the efficiency of the proposed algorithm.