{'fraction_non_alphanumeric': 0.023291925465838508, 'fraction_numerical': 0.0, 'mean_word_length': 4.91743119266055, '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}}
A Hybrid PSO Algorithm for the CVRP Problem

The Capacitated Vehicle Routing Problem (CVRP) has been studied over five decades. The goal of CVRP is to minimize the total distance travelled by vehicles under the constraints of vehicles’ capacity. Because CVRP is a kind of NP-hard problem, a number of meta-heuristics have been proposed to solve the problem. The objective of this paper is to propose a hybrid algorithm combining Combinatorial Particle Swarm Optimization (CPSO) with Simulated Annealing (SA) for solving CVRP. The experimental results show that the proposed algorithm can be viewed as an effective approach for solving the CVRP.