PLoS One. 2023 Jan 25;18(1):e0280512. doi: 10.1371/journal.pone.0280512. eCollection 2023.
ABSTRACT
In this article, an improved slime mould algorithm (SMA-CSA) is proposed for solving global optimization and the capacitated vehicle routing problem (CVRP). This improvement is based on the mixed-strategy optimization of Cauchy mutation and simulated annealing to alleviate the lack of global optimization capability of the SMA. By introducing the Cauchy mutation strategy, the optimal solution is perturbed to increase the probability of escaping from the local extreme value; in addition, the annealing strategy is introduced, and the Metropolis sampling criterion is used as the acceptance criterion to expand the global search space to enhance the exploration phase to achieve optimal solutions. The performance of the proposed SMA-CSA algorithm is evaluated using the CEC 2013 benchmark functions and the capacitated vehicle routing problem. In all experiments, SMA-CSA is compared with ten other state-of-the-art metaheuristics. The results are also analyzed by Friedman and the Wilcoxon rank-sum test. The experimental results and statistical tests demonstrate that the SMA-CSA algorithm is very competitive and often superior compared to the algorithms used in the experiments. The results of the proposed algorithm on the capacitated vehicle routing problem demonstrate its efficiency and discrete solving ability.
PMID:36696386 | DOI:10.1371/journal.pone.0280512
