首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于均匀分布策略的NSGAII算法
引用本文:乔俊飞, 李霏, 杨翠丽. 一种基于均匀分布策略的NSGAII算法. 自动化学报, 2019, 45(7): 1325-1334. doi: 10.16383/j.aas.c180085
作者姓名:乔俊飞  李霏  杨翠丽
作者单位:1.北京工业大学信息学部 北京 100124;2.计算智能与智能系统北京市重点实验室 北京 100124
基金项目:国家自然科学基金61533002中国博士后科学基金,北京市朝阳区博士后工作经费资助项目2017ZZ-01-07北京市教委项目KM201710005025北京市博士后工作经费资助项目2017ZZ-028国家自然科学基金61603012
摘    要:针对局部搜索类改进型非劣分类遗传算法(Nondominated sorting genetic algorithm Ⅱ,NSGAⅡ)计算过程中种群分布不均的问题,提出一种基于均匀分布的NSGAⅡ(NSGAⅡ based on uniform distribution,NSGAⅡ-UID)多目标优化算法.首先,该算法将种群映射到目标函数对应的超平面,并在该平面上进行聚类以增加解的多样性.其次,为了提高解的分布性,将映射平面进行均匀分区.当分段区间不满足分布性条件时,需要激活分布性加强模块.与此同时在计算过程中分段区间可能会出现种群数量不足或无解的状况,为了保证每个区间所选个体数目相同.最后,采用将最优个体进行极限优化变异的方法来获得缺失个体.实验结果显示该算法可以保证种群跳出局部最优且提高收敛速度,并且在解的分布性和收敛性方面均优于文中其他多目标优化算法.

关 键 词:改进型非劣分类遗传算法   映射   聚类   分布性加强   局部变异
收稿时间:2018-02-05

An NSGAII Algorithm Based on Uniform Distribution Strategy
QIAO Jun-Fei, LI Fei, YANG Cui-Li. An NSGAII Algorithm Based on Uniform Distribution Strategy. ACTA AUTOMATICA SINICA, 2019, 45(7): 1325-1334. doi: 10.16383/j.aas.c180085
Authors:QIAO Jun-Fei  LI Fei  YANG Cui-Li
Affiliation:1. Faculty of Information Technology, Beijing University of Technology, Beijing 100124;2. Beijing Key Laboratory of Computational Intelligence and Intelligent System, Beijing 100124
Abstract:Because the population distribution is uneven during the local search process of nondominated sorting genetic algorithm Ⅱ (NSGAⅡ), a multi-objective optimization algorithm for NSGAⅡ based on uniform distribution (NSGAⅡ-UID) is proposed. Firstly, the population which has been clustered is mapped to the hyperplane of the corresponding objective function, then the diversity of population is increased. Secondly, in order to improve the distribution uniformity of the solution, the mapping plane is evenly partitioned. However, when the distribution condition is not satisfied in the corresponding partition, the distribution enhancement module is activated. At the same time the individuals may be insufficient or empty in the piecewise interval during the calculation process, in order to ensure that the number of selected individuals in each interval is the same, the local variation method of the best solution is proposed to get the missing individuals lastly. The experimental results show that the method ensures that the population can jump out the local optimal and the convergence speed can be improved. And the distribution and convergence of this algorithm is superior to the other multi-objective optimization algorithms.
Keywords:Nondominated sorting genetic algorithm Ⅱ (NSGAII)  map  cluster  distribution enhancement  local variation
点击此处可从《自动化学报》浏览原始摘要信息
点击此处可从《自动化学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号