arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.05158cs.NE
收藏

求解二次分配问题的多群PSO算法--在OpenCL平台上的大规模并行实现

Multi-swarm PSO algorithm for the Quadratic Assignment Problem: a massive parallel implementation on the OpenCL platform

Piotr Szwed, Wojciech Chmiel

摘要:

针对二次分配问题(QAP),提出了一种基于OpenCL平台的多群粒子群优化算法。我们的工作是出于时间效率测试的结果进行了单群算法的实施,清楚地表明,并行执行平台的好处可以充分利用,如果处理的人口是大的。所描述的算法可以在两种模式下执行:独立群或迁移。我们讨论了算法的建设,以及我们报告的测试结果,从QAPLIB库的几个问题的情况下进行。在实验过程中,该算法被配置为处理大量人口。这使我们能够收集与单个粒子达到的目标函数值相关的统计数据。我们用它们来证明两个测试案例,虽然单个粒子似乎在优化过程中表现混乱,当整个人口进行分析,粒子将选择一个接近最优的解决方案的概率增长。

英文摘要:

This paper presents a multi-swarm PSO algorithm for the Quadratic Assignment Problem (QAP) implemented on OpenCL platform. Our work was motivated by results of time efficiency tests performed for single-swarm algorithm implementation that showed clearly that the benefits of a parallel execution platform can be fully exploited, if the processed population is large. The described algorithm can be executed in two modes: with independent swarms or with migration. We discuss the algorithm construction, as well as we report results of tests performed on several problem instances from the QAPLIB library. During the experiments the algorithm was configured to process large populations. This allowed us to collect statistical data related to values of goal function reached by individual particles. We use them to demonstrate on two test cases that although single particles seem to behave chaotically during the optimization process, when the whole population is analyzed, the probability that a particle will select a near-optimal solution grows.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑