求解连续Minimax问题的粒子群优化方法

Particle Swarm Optimization Method for Solving Continuous Minimax Problems

Minimax问题是一类十分重要同时也是比较困难的优化问题。提出了一种基于粒子群优化的连续minimax问题求解 方法。方法的基本思想是维持两个在不同搜索空间中不对称共同进化的群体并采用粒子群优化算法获得原minimax问题的 一个解。仿真结果显示此方法可以有效求解对称和非对称连续minimax问题。

Minimax problems are a class of important and difficult optimization problems. A particle swarm optimization based method for solving continuous minimax problems is proposed. The basic idea is that the method maintains two populations coevolving asymmetrically in two different search spaces, and a particle swarm optimization algorithm is employed to find a good solution to the minimax problems. Simulation results show that the proposed method can effectively solve symmetric and asymmetric continuous minimax problems.