戴永彬. 基于偏好信息的双阈值多目标粒子群算法[J]. 北京工业大学学报, 2016, 42(4): 492-498. DOI: 10.11936/bjutxb2015020001
    引用本文: 戴永彬. 基于偏好信息的双阈值多目标粒子群算法[J]. 北京工业大学学报, 2016, 42(4): 492-498. DOI: 10.11936/bjutxb2015020001
    DAI Yongbin. Multi-objective Particle Swarm Optimization Algorithm With Double Thresholds Based on Preference Information[J]. Journal of Beijing University of Technology, 2016, 42(4): 492-498. DOI: 10.11936/bjutxb2015020001
    Citation: DAI Yongbin. Multi-objective Particle Swarm Optimization Algorithm With Double Thresholds Based on Preference Information[J]. Journal of Beijing University of Technology, 2016, 42(4): 492-498. DOI: 10.11936/bjutxb2015020001

    基于偏好信息的双阈值多目标粒子群算法

    Multi-objective Particle Swarm Optimization Algorithm With Double Thresholds Based on Preference Information

    • 摘要: 以获取偏好解为研究重点,提出了一种双阈值多目标粒子群(multi-objective particle swarm optimization with double thresholds,DT-MOPSO)算法.该算法利用g-支配增加选择压力,借助光束距离阈值σ控制非劣解的数量.另外,引入多样性指标的阈值实现对解集的分布性的控制.当解集的多样性指标低于阈值时,采用自适应网格技术增加解的多样性.通过对典型问题的测试,验证了改进算法的正确性和有效性.

       

      Abstract: This paper focused on how to obtain optimal set effectively in preference regions. A multiobjective particle swarm optimization algorithm with double thresholds( DT-MOPSO) was proposed. The algorithm used g-dominated to increase selection pressure and controled the number of non-inferior solutions by means of the beam distance threshold. The diversity threshold value was introduced to adjust the solution diversity. When the diversity value was lower than the threshold value,the adaptive grid algorithms was used to improve the diversity. Simulation results of a series of classical problems show the correctness and effectiveness of this algorithm.

       

    /

    返回文章
    返回