首页 | 官方网站   微博 | 高级检索  
     

基于MapReduce的并行蚁群算法研究与实现
引用本文:夏卫雷,王立松.基于MapReduce的并行蚁群算法研究与实现[J].电子科技,2013,26(2):146-149.
作者姓名:夏卫雷  王立松
作者单位:(南京航空航天大学 计算机科学与技术学院,江苏 南京 210016)
摘    要:蚁群算法在处理大规模TSP问题耗时较长,为解决这一不足,给出了一种基于MapReduce编程模式的并行蚁群算法。采用MapReduce的并行优化技术对蚁群算法中最耗时的循环迭代和循环赋值部分进行改进,同时运用PC集群环境的优势将具有一定规模的小蚁群分配到对应的PC机上,使其并行执行,减少运行时间。实验证明改进后的并行蚁群算法在大数据集上运行时间明显缩短,执行效率显著提高。

关 键 词:蚁群算法  TSP问题  MapReduce  并行优化  

Research on and Implementation of Parallel Ant Colony Algorithm Based on MapReduce
XIA Weilei , WANG Lisong.Research on and Implementation of Parallel Ant Colony Algorithm Based on MapReduce[J].Electronic Science and Technology,2013,26(2):146-149.
Authors:XIA Weilei  WANG Lisong
Affiliation:(College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China)
Abstract:As ant colony algorithm is time consuming in dealing with large-scale TSP problems,a parallel optimization algorithm based on MapReduce programming mode is proposed,which improves the loop and loop assignment part with the most time-consuming by MapReduce parallel optimization technique.Simultaneously,it takes advantage of PC integration environment to assign small ant colony with certain scale to corresponding PC machine and to make it execute in parallel as well as reduce its running time.Experiments show that the operation time of the improved parallel ant colony algorithm dealing with large data sets is significantly reduced and execution efficiency is significantly improved.
Keywords:ant colony algorithm  the problem of TSP  MapReduce  parallel optimization  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《电子科技》浏览原始摘要信息
点击此处可从《电子科技》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号