Abstract
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..
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
