混合择优的多目标免疫粒子群优化算法  

Multi-objective immune particle swarm optimization algorithm with a hybird global best selecting strategy

作　　者：仲昭明[1] 李向阳 逄珊[3] 

机构地区：[1]鲁东大学物理与光电工程学院,山东烟台264025 [2]烟台联通信息化支撑中心,山东烟台264001 [3]鲁东大学信息科学与工程学院,山东烟台264025

出　　处：《计算机工程与应用》2013年第13期43-47,共5页Computer Engineering and Applications

基　　金：国家自然科学青年基金(No.61102167);山东省科技发展计划项目(No.2011YD04049)

摘　　要：为解决多目标粒子群优化算法存在解的多样性差、分布不均等问题,提出一种混合择优机制:在迭代过程中每个粒子依概率,根据解集信息熵或Sigma值确定其全局极值;并直接对解集进行基于信息熵的克隆选择,根据支配关系更新解集,充分发掘分布性更好的解。测试函数的仿真实验结果表明,该算法在保持较好的收敛性能的同时,其求解的分布性指标要明显优于其他算法,这说明混合择优机制能够有效地提升多目标粒子群优化算法求解的多样性和分布性。In order to solve the problems of loss in diversity and poor distribution of Pareto solutions in Multi-Objective Particle Swarm Optimization（MOPSO）, a hybrid global best selecting strategy is proposed. Each particle＇s global best is selected according to information entropy or Sigma value of solutions with a varying selecting probability. And clone selection strategy is used to update Pareto solution set according to dominance relationships. As a result, the better distributed solutions are exploited. Results on several benchmark functions show that the proposed algorithm has better distribution performance while maintains a good convergence. This indicates that the proposed hybrid strategy is effective in improving the diversity and distribution of MOPSO.

关 键 词：多目标优化 粒子群 信息熵 克隆选择 

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