Research on the Problem of the Shortest Path Based on the Glowworm Swarm Optimization Algorithm

Aiming at solving the shortest path problem, the authors propose a new swarm intelligence algorithm, the Glowworm Swarm Optimization algorithm, which has the virtue of simplicity, strong robustness, parallel processing, and so on. In combination with the practical demand of path generation and path selection, the algorithm is formed by integrating the Dijkstra algorithm and genetic operators into the basic Glowworm Swarm Optimization algorithm. The algorithm uses Matlab to realize and then is compared with the Genetic Algorithm. By analyzing the curve of average path value change under multiple iterations, the operation result accuracy, and run time, it shows that the Glowworm Swarm Optimization algorithm not only is effective, but also has higher speed of convergence and higher precision of optimization in solving the problem.