拥挤距离排序的多目标文化粒子群优化算法.pdfVIP

第27 卷 第9 期 控 制 与 决 策 2012 年 9 月 Vol. 27 No. 9 Control and Decision Sep. 2012 文章编号: 1001-0920 (2012) 09-1406-05 拥挤距离排序的多目标文化粒子群优化算法 李中凯, 李艾民, 朱真才 (中国矿业大学机电工程学院，江苏徐州221116) 摘 要: 为解决工程优化设计问题, 引入文化进化框架, 提出一种拥挤距离排序的多目标文化粒子群算法. 采用拥挤 距离排序算子, 并删除密集区域的多余粒子, 以保证Pareto 前沿的分布均匀性; 基于拥挤距离值, 从精英知识和条件 知识中选择处于最分散区域的粒子, 并将其分别作为全局和局部最优, 以增强算法全局寻优能力; 依据拥挤距离的变 化, 动态调整粒子群飞行参数, 以提高算法收敛效率. 通过标准测试问题以及与其他算法的对比, 表明了所提出算法 的有效性和鲁棒性. 关键词: 文化粒子群算法；多目标进化算法；自适应参数调整；拥挤距离 中图分类号: TP18 文献标志码: A Cultural based multi-objective particle swarm optimization algorithm using crowding distance sorting method LI Zhong-kai, LI Ai-min, ZHU Zhen-cai (School of Mechatronics Engineering，China University of Mining and Technology，Xuzhou 221116 ，China. Correspondent ：LI Zhong-kai ，E-mail ：lizk@cumt.edu.cn) Abstract ：：：To solve the engineering design problems, by introducing cultural evolution framework, a cultural based multi- objective particle swarm optimization algorithm with crowding distance sorting is proposed. The redundant particles in the crowded area are deleted with the distance sorting operator to guarantee the elitism’s uniform distribution. With the distance value, the global and local best of the particles are selected from the most disperse region in the elitism and situational knowledge, respectively, so as to enhance its global searching capability. The evolution parameters are adjusted dynamically according to the changing of distance to improve the convergence speed. Some standard test problems and the comparison with other algorithms show the effectiveness and robustness of the algorithm. Key words ：：：cultural based particle swarm optimiza