The Shortest Path Optimization Based on Mutation Particle Swarm Optimization Algorithm
2014 ◽
Vol 1049-1050
◽
pp. 1690-1693
◽
Keyword(s):
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..
2021 ◽
Vol 15
(4)
◽
pp. 1-23
2021 ◽
Vol 15
(4)
◽
pp. 0-0
2013 ◽
Vol 427-429
◽
pp. 1934-1938
2020 ◽
2012 ◽
pp. 520-527
◽
2013 ◽
Vol 5
(7)
◽
pp. 533-540
2016 ◽
Vol 11
(1)
◽
pp. 58-67
◽
2019 ◽
Vol 49
(10)
◽
pp. 3641-3651
◽