arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1306.0225math.OCcs.NEmath.DS
收藏

多智能体协调Optimization算法的收敛性分析及并行计算实现

Convergence Analysis and Parallel Computing Implementation for the Multiagent Coordination Optimization Algorithm

Qing Hui, Haopeng Zhang

摘要:

在这份报告中,一种新的变种粒子群优化(PSO)算法,称为多智能体协调优化(MCO),实现了在一个并行计算的方式,为实际使用,通过引入MATLAB内置功能“parfor”到MCO。然后利用半稳定性理论严格分析了MCO的整体收敛性。MCO算法除了与PSO算法共享全局最优解外,还通过共享邻居之间的速度和位置信息,将多个Agent的协作行为融入到更新公式中,从而提高了算法的性能。并行MCO算法的数值评估提供了在报告中所提出的算法在超级计算机上运行在德克萨斯理工大学的高性能计算中心。特别是,通过求解几个基准函数,分别与PSO和串行MCO的最优值和耗时进行了比较。仿真结果表明,并行MCO算法不仅在求解非线性、非凸最优化问题时性能优于PSO算法,而且在节省计算时间的同时具有较高的效率。

英文摘要:

In this report, a novel variation of Particle Swarm Optimization (PSO) algorithm, called Multiagent Coordination Optimization (MCO), is implemented in a parallel computing way for practical use by introducing MATLAB built-in function "parfor" into MCO. Then we rigorously analyze the global convergence of MCO by means of semistability theory. Besides sharing global optimal solutions with the PSO algorithm, the MCO algorithm integrates cooperative swarm behavior of multiple agents into the update formula by sharing velocity and position information between neighbors to improve its performance. Numerical evaluation of the parallel MCO algorithm is provided in the report by running the proposed algorithm on supercomputers in the High Performance Computing Center at Texas Tech University. In particular, the optimal value and consuming time are compared with PSO and serial MCO by solving several benchmark functions in the literature, respectively. Based on the simulation results, the performance of the parallel MCO is not only superb compared with PSO for solving many nonlinear, noncovex optimization problems, but also is of high efficiency by saving the computational time.

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

↑