Abstract
PDF HTML阅读 XML下载 导出引用 引用提醒 一种基于正态分布交叉的ε-MOEA DOI: 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: Supported by the Overseas Young Scholars Collaborative Research Grant of the National Natural Science Foundation of China under Grant No.60428202 (国家自然科学基金委海外青年学者合作研究基金) A Normal Distribution Crossover for ε-MOEA Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:实数编码的多目标进化算法常使用模拟二进制交叉(simulated binary crossover,简称SBX)算子.通过对SBX以及进化策略中变异算子进行对比分析,并引入进化策略中的离散重组算子,提出了一种正态分布交叉(normal distribution crossover,简称NDX)算子.首先在一维搜索空间实例中对NDX与SBX算子进行比较和分析,然后将NDX算子应用于Deb等人提出的稳态多目标进化算法ε-MOEA(ε-dominance based multiobjective evolutionary algorithm)中.采用NDX算子的ε-MOEA(记为ε-MOEA/NDX)算法在多目标优化标准测试集ZDT和DTLZ的10个函数上进行了实验比较.实验结果和分析表明,采用NDX的?-MOEA所求得的Pareto最优解集质量明显优于经典算法ε-MOEA/SBX和NSGA-II. Abstract:The simulated binary crossover (SBX) has been extensively adopted in the real-coded multiobjective evolutionary algorithms (MOEAs). Through the comparisons and analyses of the SBX and the mutation operator in the evolution strategy (ES), this paper proposes a normal distribution crossover (NDX) with the introduction of discrete recombination operator in ES. The NDX and SBX operators are compared and analyzed through an example designed in the one dimensional search space, and then the NDX is applied to a steady-state multiobjective evolutionary algorithm named ε-MOEA (ε-dominance based multiobjective evolutionary algorithm) proposed by Deb, et al. The algorithmε-MOEA with NDX (ε-MOEA/NDX) has been tested and compared on the 10 benchmark functions taken from the ZDT and DTLZ standard test suites. Experimental results demonstrate that algorithmε-MOEA/NDX is distinctly superior to theε-MOEA/SBX and NSGA-II algorithms, which are representatives of the state-of-the-art in the area. 参考文献 相似文献 引证文献
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.