Parallel Multiagent Coordination Optimization Algorithm: Implementation, Evaluation, and Applications

Abstract

In this paper, a parallel computing implementation of a multiagent coordination optimization (MCO) algorithm is introduced using $\mathtt {parfor}$ , a built-in MATLAB function. As a novel variation of particle swarm optimization (PSO), the MCO algorithm has demonstrated significant performance improvement, in terms of both accuracy and efficiency, in solving real-time optimization problems when compared with PSO. However, the ability to handle large-scale optimization problems or use more particles in the algorithm is limited by the sequential implementation of the original MCO algorithm. A numerical evaluation of the parallel MCO algorithm was conducted using the supercomputers in the High Performance Computing Center at Texas Tech University. Based on the results of this evaluation, it was determined that the performance of the parallel MCO is not only superior to that of PSO but is highly efficient as it reduces the computational time. The parallel binary MCO (BMCO) algorithm is presented here as well. By combining the parallel MCO with parallel BMCO algorithms, a new parallel mixed-binary nonlinear programming MCO solver is proposed. Finally, a load balancing coordination problem, a multiagent formation control problem, and a power system vulnerability analysis problem are solved using the corresponding parallel MCO algorithm.