共查询到15条相似文献,搜索用时 218 毫秒
1.
高维多目标优化问题普遍存在且难以解决, 到目前为止, 尚缺乏有效解决该问题的进化优化方法. 本文提出一种基于目标分解的高维多目标并行进化优化方法, 首先, 将高维多目标优化问题分解为若干子优化问题, 每一子优化问题除了包含原优化问题的少数目标函数之外, 还具有由其他目标函数聚合成的一个目标函数, 以降低问题求解的难度; 其次, 采用多种群并行进化算法, 求解分解后的每一子优化问题, 并在求解过程中, 充分利用其他子种群的信息, 以提高Pareto非被占优解的选择压力; 最后, 基于各子种群的非被占优解形成外部保存集, 从而得到高维多目标优化问题的Pareto 最优解集. 性能分析表明, 本文提出的方法具有较小的计算复杂度. 将所提方法应用于多个基准优化问题, 并与NSGA-II、PPD-MOEA、ε-MOEA、HypE和MSOPS等方法比较, 实验结果表明, 所提方法能够产生收敛性、分布性, 以及延展性优越的Pareto最优解集. 相似文献
2.
为了提高进化算法在求解高维多目标优化问题时的收敛性和多样性,提出了采用放松支配关系的高维多目标微分进化算法。该算法采用放松的Pareto支配关系,以增加个体的选择压力;采用群体和外部存储器协同进化的方案,并通过混合微分变异算子,生成子代群体;采用基于指标的方法计算个体的适应度并对群体进行更新;采用基于Lp范数(0
相似文献
3.
高维多目标优化问题一般指目标个数为4个 或以上时的多目标优化问题.由于种群中非支配解数量随着目标数量的增加而急剧增多,导致进化算法的进化压力严重降低,求解效率低.针对该问题,提出一种基于粒子群的高维多目标问题求解方法,在目标空间中引入一系列的参考点,根据参考点筛选出能兼顾多样性和收敛性的非支配解作为粒子的全局最优,以增大选择压力.同时,提出了基于参考点的外部档案维护策略,以保持最后所得解集的多样性.在标准测试函数DTLZ2上的仿真结果表明,所提方法在求解高维多目标问题时能够得到收敛性和分布性都较好的解集. 相似文献
4.
进化多目标优化算法研究 总被引:50,自引:1,他引:50
进化多目标优化主要研究如何利用进化计算方法求解多目标优化问题,已经成为进化计算领域的研究热点之一.在简要总结2003年以前的主要算法后,着重对进化多目标优化的最新进展进行了详细讨论.归纳出当前多目标优化的研究趋势,一方面,粒子群优化、人工免疫系统、分布估计算法等越来越多的进化范例被引入多目标优化领域,一些新颖的受自然系统启发的多目标优化算法相继提出;另一方面,为了更有效的求解高维多目标优化问题,一些区别于传统Pareto占优的新型占优机制相继涌现;同时,对多目标优化问题本身性质的研究也在逐步深入.对公认的代表性算法进行了实验对比.最后,对进化多目标优化的进一步发展提出了自己的看法. 相似文献
5.
尽管区间参数高维多目标优化问题普遍存在且非常重要, 但是, 目前求解该问题的方法却很少. 本文提出一种有效解决该问题的集合进化优化方法, 通过在进化过程中融入决策者的偏好, 以得到符合决策者偏好的Pareto解集. 该方法将原优化问题转化为以超体积、不确定度、决策者满意度为新目标的确定型3目标优化问题; 为了求解转化后的优化问题, 采用集合Pareto占优关系比较个体, 并设计融入决策者偏好的延展性测度, 以进一步区分具有相同序值的个体; 此外, 还提出集合变异与重组策略, 以生成高性能的子代种群. 采用4个基准高维多目标优化问题和1个汽车驾驶室设计问题测试所提方法的性能, 并将其与另外3种方法进行对比. 实验结果验证, 该方法能得到收敛性、延展性、不确定度, 以及决策者满意度均衡的Pareto解集. 相似文献
6.
传统的基于Pareto支配关系的多目标进化算法(MOEA)难以有效求解高维多目标优化问题(MaOP). 提出一种利用PBI效用函数的双距离构造的支配关系, 且无需引入额外的参数. 其次, 利用双距离定义了一种多样性保持方法, 该方法不仅考虑了解个体的双距离, 而且还可以根据优化问题的目标数目自适应地调整多样性占比, 以较好地平衡高维目标解群的收敛性和多样性. 最后, 将基于双距离构造的支配关系和多样性保持方法嵌入到NSGA-II算法框架中, 设计了一种基于双距离的高维多目标进化算法MaOEA/d2. 该算法与其他5种代表性的高维多目标进化算法一同在5-、10-、15-和20-目标的DTLZ和WFG基准测试问题上进行了IGD和HV性能测试, 结果表明, MaOEA/d2算法具有较好的收敛性和多样性. 由此表明, MaOEA/d2算法是一种颇具前景的高维多目标进化算法. 相似文献
7.
高维多目标优化问题是广泛存在于实际应用中的复杂优化问题,目前的研究方法大都限于进化算法.本文利用粒子群优化算法求解高维多目标优化问题,提出了一种基于r支配的多目标粒子群优化算法.采用r支配关系进行粒子的比较与选择,并结合粒子群优化算法收敛速度快的优势,使得算法在目标个数增加时仍保持较强的搜索能力;为了弥补由此造成的群体多样性的丢失,优化非r支配阈值的取值策略;此外,引入决策空间的拥挤距离测度,并给出新的外部存储器更新方法,从而进一步防止算法陷入局部最优.对多个基准测试函数的仿真结果表明所得解集在收敛性、多样性以及围绕参考点的分布性上均优于其他两种算法. 相似文献
8.
尽管许多高维多目标进化算法已被提出,但大多仍无法有效处理具有不规则Pareto前沿的高维多目标优化问题.鉴于此,提出基于目标迁移和条件替代的高维多目标进化算法(MaOEA-OTCR),在环境选择过程中利用目标迁移策略和条件替代准则协作逐一选择收敛性和多样性好的个体进入下一代.前者首先选择位于Pareto前沿边界的极值解进入下一代,以确定Pareto前沿的范围,同时选择收敛性最好的若干个体进入下一代,以加速种群收敛;然后迁移已选解集且利用迁移解集和未迁移解集的最大距离来选择收敛性和多样性好的个体进入下一代.后者利用基于角度和收敛性评估的条件取代准则来防止前者过度强调多样性.此外,提出一个多标准决策的匹配选择策略,旨在增加具有良好收敛性和多样性种群个体结合的概率,进一步提升算法的搜索效率.为了验证MaOEA-OTCR的有效性,在3个测试集上与8个先进的高维多目标进化算法进行对比实验.实验结果表明, MaOEA-OTCR在处理高维多目标优化问题时不仅能够获得较强的竞争性能,而且有能力处理具有不规则Pareto前沿的高维多目标优化问题. 相似文献
9.
10.
为提高4目标以上高维多目标优化问题的求解性能,提出一种基于改进K支配排序的高维多目标进化算法(KS-MODE).该算法针对K支配的支配关系和排序方法进行改进,避免循环支配并增强选择压力;设计新的全局密度估计方法提高局部密度估计精确性;设计新的精英选择策略和适应度值评价函数;采用CAO局部搜索算子加速收敛.在4~30个目标标准测试函数上的实验结果表明,KS-MODE能够在保证解集分布性的同时大幅提升收敛性和稳定性,能够有效求解高维多目标优化问题. 相似文献
11.
In evolutionary many-objective optimization, diversity maintenance plays an important role in pushing the population towards the Pareto optimal front. Existing many-objective evolutionary algorithms mainly focus on convergence enhancement, but pay less attention to diversity enhancement, which may fail to obtain uniformly distributed solutions or fall into local optima. This paper proposes a radial space division based evolutionary algorithm for many-objective optimization, where the solutions in high-dimensional objective space are projected into the grid divided 2-dimensional radial space for diversity maintenance and convergence enhancement. Specifically, the diversity of the population is emphasized by selecting solutions from different grids, where an adaptive penalty based approach is proposed to select a better converged solution from the grid with multiple solutions for convergence enhancement. The proposed algorithm is compared with five state-of-the-art many-objective evolutionary algorithms on a variety of benchmark test problems. Experimental results demonstrate the competitiveness of the proposed algorithm in terms of both convergence enhancement and diversity maintenance. 相似文献
12.
Recently, angle-based approaches have shown promising for unconstrained many-objective optimization problems (MaOPs), but few of them are extended to solve constrained MaOPs (CMaOPs). Moreover, due to the difficulty in searching for feasible solutions in high-dimensional objective space, the use of infeasible solutions comes to be more important in solving CMaOPs. In this paper, an angle based evolutionary algorithm with infeasibility information is proposed for constrained many-objective optimization, where different kinds of infeasible solutions are utilized in environmental selection and mating selection. To be specific, an angle-based constrained dominance relation is proposed for non-dominated sorting, which gives infeasible solutions with good diversity the same priority to feasible solutions for escaping from the locally feasible regions. As for diversity maintenance, an angle-based density estimation is developed to give the infeasible solutions with good convergence a chance to survive for next generation, which is helpful to get across the large infeasible barrier. In addition, in order to utilize the potential of infeasible solutions in creating high-quality offspring, a modified mating selection is designed by considering the convergence, diversity and feasibility of solutions simultaneously. Experimental results on two constrained many-objective optimization test suites demonstrate the competitiveness of the proposed algorithm in comparison with five existing constrained many-objective evolutionary algorithms for CMaOPs. Moreover, the effectiveness of the proposed algorithm on a real-world problem is showcased. 相似文献
13.
现实中大量存在的高维多目标优化问题对以往高效的多目标进化算法提出了严峻的挑战.通过将分解策略和协同策略相结合提出一种高维多目标进化算法MaOEA/DCE.该算法利用混合水平正交实验方法在聚合系数空间产生一组均匀分布的权重向量以改善初始种群的分布性;其次,算法将差分进化算子和自适应SBX算子进行协同进化,以产生高质量的子代个体,并改善算法的收敛性.该算法与另外5种高性能的多目标进化算法在基准测试函数集DTLZ{1,2,4,5}上进行对比实验,利用改进的反转世代距离指标IGD+评估各算法的性能.实验结果表明,Ma OEA/DCE算法与其他对比算法相比,在总体上具有较为显著的收敛性和分布性优势. 相似文献
14.
The interest for many-objective optimization has grown due to the limitations of Pareto dominance based Multi-Objective Evolutionary Algorithms when dealing with problems of a high number of objectives. Recently, some many-objective techniques have been proposed to avoid the deterioration of these algorithms' search ability. At the same time, the interest in the use of Particle Swarm Optimization (PSO) algorithms in multi-objective problems also grew. The PSO has been found to be very efficient to solve multi-objective problems (MOPs) and several Multi-Objective Particle Swarm Optimization (MOPSO) algorithms have been proposed. This work presents a study of the behavior of MOPSO algorithms in many-objective problems. The many-objective technique named control of dominance area of solutions (CDAS) is used on two Multi-Objective Particle Swarm Optimization algorithms. An empirical analysis is performed to identify the influence of the CDAS technique on the convergence and diversity of MOPSO algorithms using three different many-objective problems. The experimental results are compared applying quality indicators and statistical tests. 相似文献
15.
For many-objective optimization problems, due to the low selection pressure of the Pareto-dominance relation and the ineffectivity of diversity maintenance scheme in the environmental selection, the current Pareto-dominance based multi-objective evolutionary algorithms (MOEAs) fail to balance between convergence and diversity. This paper proposes a many-objective evolutionary algorithm based on hyperplane projection and penalty distance selection (we call it MaOEA-HP). Firstly, the normalization method is used to construct an unit hyperplane and the population is projected onto the unit hyperplane. Then, a harmonic average distance is applied to calculate the crowding density of the projected points on the unit hyperplane. Finally, the perpendicular distance from the individual to the hyperplane as convergence information is added into the diversity maintenance phase, and a penalty distance selection scheme is designed to balance between convergence and diversity of solutions. Compared with six state-of-the-art many-objective evolutionary algorithms, the experimental results on two well-known many-objective optimization test suites show that MaOEA-HP has more advantage than the other algorithms, could improve the convergence and ensure the uniform distribution. 相似文献