摘要
蚁群算法具有自组织性、正反馈性、较强的鲁棒性和天生的并行性等优点,不足之处是需要较长的搜索时间.为了解决其搜索时间过长的问题,文中提出了一种并行实现策略,用OPENMP应用编程接口采用C++语言编程实现,能明显减少搜索所用的时间.给出了一种解决旅行商问题(TSP)的并行蚁群算法,并通过串并算法执行时间的比较,说明并行算法的优越性.
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.
出处
《微电子学与计算机》
CSCD
北大核心
2011年第7期149-151,155,共4页
Microelectronics & Computer
基金
国家自然科学基金项目(60963004)
