A multi-objective multi-factorial evolutionary algorithm with reference-point-based approach

Huynh Thi Thanh Binh, N. Q. Tuan, Doan Cao Thanh Long
{"title":"A multi-objective multi-factorial evolutionary algorithm with reference-point-based approach","authors":"Huynh Thi Thanh Binh, N. Q. Tuan, Doan Cao Thanh Long","doi":"10.1109/CEC.2019.8790034","DOIUrl":null,"url":null,"abstract":"In recent years, multi-task optimization is one of the emerging topics among evolutionary computation researchers. Multi-Factorial Evolutionary Algorithm (MFEA) is developed based on that individuals, from various cultures, exchange their underlying similarities to improve the convergence characteristic. However, in terms of Multi-Objective Multi-Factorial Optimization (MOMFO), current algorithms employing nondominated front ranking and crowding distance still meet difficulties when the number of objective functions arises. In this paper, we propose a Muli-Objective Multi-Factorial Evolutionary Algorithm (MO-MFEA) with reference-point-based approach to improve the multitasking framework. Rather than using crowding distance to compute individual ranking in the context of MOMFO, we employ a set of reference points to determine the diversity of current population. On the other hand, we improve the guided method that automatically adapt the Random Mating Probability (RMP) in order to exploit shared knowledge among high similar task. Further improvement on genetic operators with JADE crossover and NSLS. The conducted experiments demonstrate our approach performs better than the baseline results.","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"65 1","pages":"2824-2831"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Congress on Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2019.8790034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In recent years, multi-task optimization is one of the emerging topics among evolutionary computation researchers. Multi-Factorial Evolutionary Algorithm (MFEA) is developed based on that individuals, from various cultures, exchange their underlying similarities to improve the convergence characteristic. However, in terms of Multi-Objective Multi-Factorial Optimization (MOMFO), current algorithms employing nondominated front ranking and crowding distance still meet difficulties when the number of objective functions arises. In this paper, we propose a Muli-Objective Multi-Factorial Evolutionary Algorithm (MO-MFEA) with reference-point-based approach to improve the multitasking framework. Rather than using crowding distance to compute individual ranking in the context of MOMFO, we employ a set of reference points to determine the diversity of current population. On the other hand, we improve the guided method that automatically adapt the Random Mating Probability (RMP) in order to exploit shared knowledge among high similar task. Further improvement on genetic operators with JADE crossover and NSLS. The conducted experiments demonstrate our approach performs better than the baseline results.
基于参考点的多目标多因子进化算法
多任务优化是近年来进化计算研究的新兴课题之一。多因子进化算法(MFEA)是基于来自不同文化的个体交换其潜在的相似性来提高收敛特性而发展起来的。然而,在多目标多因子优化(MOMFO)中,当目标函数数量增加时,现有的采用非支配前沿排序和拥挤距离的算法仍然存在困难。本文提出了一种基于参考点的多目标多因子进化算法(MO-MFEA)来改进多任务框架。在MOMFO的背景下,我们使用一组参考点来确定当前种群的多样性,而不是使用拥挤距离来计算个体排名。另一方面,我们改进了自动适应随机匹配概率(RMP)的引导方法,以利用高相似度任务之间的共享知识。进一步改进JADE交叉和NSLS遗传算子。实验结果表明,我们的方法优于基线结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信