用于约束优化的简洁多目标微粒群优化算法  

Barebones Multi-Objective Particle Swarm Optimizer for Constrained Optimization Problems

作　　者：张勇[1] 巩敦卫[1] 任永强[1,2] 张建化[1] 

机构地区：[1]中国矿业大学信息与电气工程学院,江苏徐州221116 [2]徐州空军学院,江苏徐州221002

出　　处：《电子学报》2011年第6期1436-1440,共5页Acta Electronica Sinica

基　　金：国家自然科学基金资助(No.61005089);江苏省自然科学基金资助(No.BK2008125);高等学校博士学科点专项科研基金资助课题(No.20100095120016)

摘　　要：本文提出了一种少控制参数的约束多目标微粒群优化算法.该算法利用关于微粒全局和个体最优点的高斯分布来更新微粒的位置,无需设置惯性权重和学习因子等控制参数;利用非可行储备集保存所得非可行解,给出一种改进的储备集更新方法;为均衡微粒对未知可行域和已知可行域的开发/探索能力,提出一种线性递减策略,用来分配微粒从非可行储备集中选择全局最优点的概率.最后,实验验证了所提算法的有效性.This paper presents a constrained multi-objective particle swarm optimization algorithm with few control parameters to solve constrained multi-objective optimization problems.In this algorithm,a Gaussian distribution based on the global/local best positions is developed to update the particles＇ positions.It makes unnecessary to perform fine tuning on such control parameters as inertia weight and acceleration coefficients.Using an infeasible archive to save infeasible solutions,an improved update method of the infeasible archive is proposed.In order to balance the algorithm＇s capabilities to exploit known feasible regions and to explore unknown feasible regions,a linear decreasing strategy is introduced to assign the probability,based on which the particles select their global best positions from the infeasible archive.Finally,feasibility of the proposed algorithm is validated by simulation results.

关 键 词：多目标优化 约束 微粒群 高斯分布 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]