Abstract
When solving large scale combinatorial optimization problems, Max-Min Ant System requires long computation time. MPI-based Parallel Max-Min Ant System described in this paper can ensure the quality of the solution, as well as reduce the computation time. Numerical experiments on the multi-node cluster system show that when solving the traveling salesman problem, MPI-based Parallel Max-Min Ant System can get better computational efficiency.
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.
