检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机工程与应用》2012年第21期45-48,74,共5页Computer Engineering and Applications
基 金:陕西省教育厅科学研究计划项目(No.11JK0506)
摘 要:动态多目标约束优化问题是一类NP-Hard问题,定义了动态环境下进化种群中个体的序值和个体的约束度,结合这两个定义给出了一种选择算子。在一种环境变化判断算子下给出了求解环境变量取值于正整数集+的一类带约束动态多目标优化问题的进化算法。通过几个典型的Benchmark函数对算法的性能进行了测试,其结果表明新算法能够较好地求出带约束动态多目标优化问题在不同环境下质量较好、分布较均匀的Pareto最优解集。Dynamic multi-objective constrained optimization problem is a kind of NP-hard problem.The rank and the scalar constraint violation of the individual for evolution population under the dynamic environments are defined.Based on the two definitions,a new selection operator is presented.Based on an environment changing operator,a new dynamic constrained multi-objective optimization evolutionary algorithm,which is used to solve a class of constrained dynamic multi-objective optimization problems in which the environment variable is defined on the positive integer set,is given.The proposed algorithm has been tested on two constrained dynamic multi-objective optimization benchmark problems.The results obtained have been compared with the other algorithm.Simulations demonstrate the new algorithm can obtain good quality and uniformed distribution solution set in different environments for constrained dynamic multi-objective optimization problems.
关 键 词:约束动态多目标优化 进化算法 环境变化 PARETO最优解
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145