{'fraction_non_alphanumeric': 0.022667829119442023, 'fraction_numerical': 0.0, 'mean_word_length': 5.635838150289017, '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 adaptive simulated annealing and artificial fish swarm algorithm for the optimization of multi-depot express delivery vehicle routing

In this paper, the Capacitated Vehicle Routing Problem (CVRP) of multi-depot express delivery is investigated based on the actual express delivery business in Beijing and driving intention-based road network. An Adaptive Simulated Annealing and Artificial Fish Swarm Algorithm (A-SAAFSA) is proposed to solve the CVRP. The basic ideas are use a “certainty” probability to accept the worst solution through the Metropolis criterion in the search process, and a strategy of adjusting the swimming direction to avoid falling into the local optimal solution. Moreover, an adaptive visual strategy, which adjusts the visual range adaptively in real time according to the current solution quality, is used to ensure the efficient searching and accuracy of the algorithm. Experimental results show that the A-SAAFSA algorithm outperforms four well-known algorithms, namely simulated annealing and artificial fish swarm algorithm, artificial fish swarm algorithm, simulated annealing algorithm, and genetic algorithm.