Abstract
Parallel implementation of Ant Colony Optimization(ACO) can reduce the computational time obviously for the large scale Combinatorial Optimization problem. A novel parallel ACO algorithm is proposed in this paper, which use dynamic transition probability to enlarge the search space by stimulating more ants choosing new path at early stage of the algorithm; use new parallel strategies to improve the parallel efficiency. We implement the algorithm on the Dawn 400L parallel computer using MPI and C language. The Numerical result indicates that: (1) the algorithm proposed in this paper can improve convergence speed effectively with the better solution quality; (2) more computational nodes can reduce the computational time obviously and obtain significant speedup; (3) the algorithm is more efficient for the large scale traveling salesman problem with fine quality of solution.
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.
