Multi-UAV Delivery Path Optimization Based on Fuzzy C-Means Clustering Algorithm Based on Annealing Genetic Algorithm and Improved Hopfield Neural Network

This study develops an MTSP model for multi-UAV delivery optimization from a central hub, proposing a hybrid algorithm that integrates genetic simulated annealing-enhanced clustering with an improved Hopfield neural network to minimize the total flight distance. The proposed methodology initially employs an enhanced fuzzy C-means clustering technique integrated with genetic simulated annealing (GSA) to effectively partition the MTSP formulation into multiple discrete traveling salesman problem (TSP) instances. The subsequent phase implements an enhanced Hopfield neural network (HNN) architecture incorporating three key modifications: data normalization procedures, adaptive step-size control mechanisms, and simulated annealing integration, collectively improving the TSP solution quality and computational efficiency. The proposed algorithm’s effectiveness is validated through comprehensive case studies, demonstrating significant performance improvements in the computational efficiency and solution quality compared to conventional methods. The results show that during clustering, the improved clustering algorithm is more stable in its clustering effect. With regard to path optimization, the improved neural network algorithm has a higher computational efficiency and makes it easier to obtain the global optimal solution. Compared with the genetic algorithm and ant colony algorithm, its iteration times, path length, and delivery time are reduced to varying degrees. To sum up, the hybrid optimization algorithm has obvious advantages for solving a multi-UAV collaborative distribution path optimization problem.