The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
On the computation of all global minimizers through particle swarm optimization
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
The particle swarm optimization algorithm presents a new way for finding an optimal solution of complex optimization problems, where each particle represents a solution to the problem. In this paper a modified particle swarm optimization algorithm is applied to the optimization of the antenna array. Adding an item of integral control and the contractive factor in the modified algorithm can improve its global search ability. Simulation results show that the optimal pattern of the antenna array is able to approach the desired pattern. The results also demonstrate that the modified algorithm is superior to the original algorithm and the nonlinear least-square method.