首页 | 本学科首页   官方微博 | 高级检索  
     

基于OPENMP求解旅行商问题的并行蚁群算法
引用本文:刘向娇,吴素萍,刘佳梅. 基于OPENMP求解旅行商问题的并行蚁群算法[J]. 微电子学与计算机, 2011, 28(7)
作者姓名:刘向娇  吴素萍  刘佳梅
作者单位:宁夏大学,数学计算机学院,宁夏,银川,750021
基金项目:国家自然科学基金项目(60963004)
摘    要:蚁群算法具有自组织性、正反馈性、较强的鲁棒性和天生的并行性等优点,不足之处是需要较长的搜索时间.为了解决其搜索时间过长的问题,文中提出了一种并行实现策略,用OPENMP应用编程接口采用C++语言编程实现,能明显减少搜索所用的时间.给出了一种解决旅行商问题(TSP)的并行蚁群算法,并通过串并算法执行时间的比较,说明并行算法的优越性.

关 键 词:蚁群算法  并行算法  OPENMP  旅行商问题  

Parallel Ant Colony Algorithm Based on Openmp for TSP
LIU Xiang-jiao,WU Su-ping,LIU Jia-mei. Parallel Ant Colony Algorithm Based on Openmp for TSP[J]. Microelectronics & Computer, 2011, 28(7)
Authors:LIU Xiang-jiao  WU Su-ping  LIU Jia-mei
Affiliation:LIU Xiang-jiao,WU Su-ping,LIU Jia-mei(School of Mathematics and Computer Science,Ningxia University,Yinchuan 750021,China)
Abstract:Ant colony algorithm has some advantages,such as the algorithm,feedback,strong and robustness and parallelism.Its disadvantage is to take a long searching time.To solve this problem,this paper presents a parallel strategy besed on OPENMP and C++ programming language,it reduces the searching time markedly.An parallel ant colony algorithm for TSP is given,by comparing the performing time between the seriral and parallel approach,it shows the superiority of the parallel algorithm.
Keywords:ant colony algorithm  parallel algorithm  OPENMP  TSP  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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