模拟退火与蚁群混合并行算法解旅行商问题
首发时间:2009-06-26
摘要:本文研究了蚁群算法、模拟退火算法以及两者的混合算法的并行实现方法,建立了PC机群实验平台,基于MPI环境对蚁群算法、模拟退火算法以及混合算法的并行算法进行了测试。根据理论研究和实际测试的结果,比较了并行算法和传统串行算法的性能差异,总结了利用PC机群系统求解旅行商问题的并行求解的可行性,得出了关于并行效率等方面的一些有意义的结论。
关键词: 旅行商问题 模拟退火与蚁群混合算法 并行计算
For information in English, please click here
Using Ant Colony Algorithm and Simulated Annealing Parallel Algorithm to Solve Traveling Salesman Problem
Abstract:This paper discussed the parallel methods to implement the ant colony algorithm, the simulated annealing and the hybrid algorithm, established a cluster of PCs system, and tested the parallel algorithms in MPI. Based on the theoretic and practical study, the performance differences between parallel algorithms and traditional algorithms were analyzed, the feasibility of proceeding parallel algorithm to solve TSP in cluster of PCs was discussed and some meaningful conclusions about parallel efficiency were achieved.
Keywords: TSP Simulated Annealing and Ant Colony Hybrid Algorithm parallel computing
基金:
论文图表:
引用
No.3346248284612460****
同行评议
共计0人参与
勘误表
模拟退火与蚁群混合并行算法解旅行商问题
评论
全部评论0/1000