The shortest path optimization based on mutation particle swarm optimization algorithm

摘要

The traditional evolutionary algorithm is cannot converge faster to solve the path optimization problems, and the path that is computed is not the shortest path, in allusion to the disadvantage of this algorithm, a mutation particle swarm optimization algorithm is proposed. The algorithm introduces the adaptive mutation strategy, and accelerated the speed to search for the global optimal solution. For seven examples experiment in standard database, the result shows that the algorithm is more efficient..