一种求解高维复杂函数优化问题的混合粒子群优化算法

基金项目: 国家自然科学基金资助项目（70271035，60104004）；上海市启明星计划资助项目（03QG14053）；国家973计划资助项目（2002CB312202）

详细信息

A Hybrid Particle Swarm Optimization Algorithm for Solving Complex Functions with High Dimensions

School of Electronic and Information Engineering, Tongji University, Shanghai 200092, China

摘要: 对于高维复杂函数，传统的确定性算法易陷入局部最小，而单一的全局随机搜索算法收敛速度慢．本文通过将粒子群优化算法和单纯形法相结合，利用前者搜索速度快、搜索范围广和后者收敛速度快的特性，提出一种快速、易实现的混合粒子群优化算法．基于典型高维复杂函数的仿真表明：该混合算法效率高、优化性能好、对初值具有很强的鲁棒性，其性能大大优于单一的优化方法．
- 粒子群优化算法 /
- 单纯形法 /
- 群体智能
Abstract: For complex functions with high dimensions,canonical optimization methods are easy to be trapped in local minima and simple random search methods are slow on convergence.This paper proposes an effective hybrid optimization which combines particle swarm optimization with simple method,and it adopts quick and broad searching of the former,and quick convergence of the latter simultaneously.Simulation results on benchmark complex functions with high dimensions show that the hybrid algorithm is effective,efficient and fairly robust to initial conditions.The performance of the hybrid algorithm excels those of single optimization methods.
- particle swarm optimization algorithm /
- simplex method /
- swarm intelligence

[1]	Kennedy J,Eberhart R.Particle swarm optimization[A].Proceedings of the IEEE International Conference on Neural Networks[C].1995.1942～1948.
[2]	Eberhart R,Kennedy J.A new optimizer using particle swarm theory[A].Proceedings of the 6th International Symposium on Micro Machine and Human Science[C].1995.39～43.
[3]	Reynolds C.Flocks,herds,and schools:a distributed behavioral model[J].Computer Graphics,1987,21(4):25～34.
[4]	Nelder J A,Mead A.A simplex method for function minimization[J].Computer Journal,1965,7:308～313.