求多目标优化问题的粒子群优化算法  

Particle swarm optimization for multi-objective programming problems

作　　者：赵志刚[1] 李陶深[1] 杨林峰[1] 

机构地区：[1]广西大学计算机与电子信息学院,南宁530004

出　　处：《计算机工程与应用》2009年第29期37-40,74,共5页Computer Engineering and Applications

基　　金：广西自然科学基金(No.0640026);广西教育厅科研项目(桂教科研 No.200626)~~

摘　　要：将粒子群优化算法应用于求解多目标优化问题,提出一种双向搜索机制,指导粒子向着搜索空间中非劣目标区域以及粒子分布最为稀疏的区域这两个方向进行寻优,进而提出了求解多目标优化问题的基于粒子群优化算法的双向搜索法,该算法对粒子全局最优经验的选择策略以及粒子群的状态更新机制进行了改进。实验研究表明,该算法不仅能快速有效地获得多目标优化问题的非劣最优解集,而且求出的解集具有良好的分布性。Particle Swarm Optimization（P SO） is applied to solve Multi-Objective Programming（MOP） problems.First,a bidirectional searching strategy is proposed to guide each particle to search simultaneously in both the Pareto-optimal region and the region where particles are distributed sparsely.And then a bidirectional PSO based algorithm for solving MOP problems is put forward, which shifts the selection mechanism of the global optimum among all particles and updates the iteration manner of the whole swarm.The experimental studies show that the new algorithm can obtain effectively the Pareto-optimal sets of MOP problems,the distribution performance of which is improved as well.

关 键 词：多目标优化 粒子群优化算法 双向搜索 非劣最优解 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]