{'fraction_non_alphanumeric': 0.014527845036319613, 'fraction_numerical': 0.0, 'mean_word_length': 5.424870466321243, '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}}
Discrete particle swarm optimization for solving a single to multiple destinations in evacuation planning

During the evacuation process, the most challenging task is to move people to safer locations. As time is the decision factor in the evacuation process, urgent and firmly decisions are required. An evacuation plan should be efficiently constructed by taking into account the routes of vehicle. This paper explored the feasibility of using a discrete particle swarm optimization (DPSO) algorithm to solve evacuation vehicle routing problem (EVRP) problem focusing on a static vehicle routing. A linear mathematical formulation is constructed with the objective to find a minimum total travelling of the capacitated vehicles from vehicle location to various number flooded areas. A solution representation based on a search decomposition procedure is proposed to accommodate the routing process and mapped to the discrete multi-valued particle in DPSO. Computational experiment involves datasets from the event of flash flood. Comparative analyses were carried on both DPSO and GA. The results indicate that the DPSO are highly competitive and showed good performance in both fitness value (total travelling time) and processing time.