基于余弦距离的多目标粒子群优化算法  

Multi-objective Particle Swarm Optimization Algorithm Based on Cosine Distance

作　　者：方欣欣[1] 龚如宾[1] 李大为[1] 

机构地区：[1]上海理工大学光电信息与计算机工程学院,上海200093

出　　处：《电子科技》2016年第3期48-52,57,共6页Electronic Science and Technology

摘　　要：针对粒子群优化算法具有的个体分布不均匀以及重复个体较多等缺陷,提出了一种基于余弦距离的多目标粒子群优化算法,该算法根据外部精英存储策略,利用余弦距离排挤机制来选取最分散的粒子,扩大Pareto最优解集的收敛性和多样性,增强算法的全局寻优能力。通过采用标准多目标优化问题ZDTl^ZDT3进行仿真实验与粒子群算法、混沌粒子群算法、基于拥挤距离的多目标优化算法对比表明,该算法在Pareto前沿的收敛性和多样性方面均优于基于拥挤距离排挤机制,并具有较高的效率。A multi-objective particle swarm optimization（ PSO） algorithm based on cosine distance is proposed to tackle the drawbacks such as uneven individual distribution redundant overlapping individuals existing in standard particle swarm optimization. Based upon external elite storage strategy,this algorithm utilizes cosine distance crowing mechanism to select the most widely distributed particles. It amplifies the convergence and diversity of best solution set and strengthens the capacity of global optimization. Standard multi-objective optimization ZDTl ~ ZDT3 are adopted in simulation experiments to compare the proposed algorithm with the particle swarm optimization,chaos particle swarm optimization and multi-objective optimization algorithm based on crowing mechanism. Results show that the proposed algorithm not only outperforms other algorithms in terms of Pareto＇s frontier convergence and diversity but also obtains preferable efficiency.

关 键 词：余弦距离 拥挤距离 多目标优化 粒子群 非支配解 

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