AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (3 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Dynamic allocation of opposition-based learning in differential evolution for multi-role individuals

Jian Guan1,2Fei Yu1,2( )Hongrun Wu1,2( )Yingpin Chen1,2Zhenglong Xiang3Xuewen Xia1,2Yuanxiang Li4
School of Physics and Information Engineering, Minnan Normal University, Zhangzhou 363000, China
Key Lab of Intelligent Optimization and Information Processing, Minnan Normal University, Zhangzhou 363000, China
School of Software, Nanjing University of Information Science and Technology, Nanjing 210044, China
School of Computer Science, Wuhan University, Wuhan 430072, China
Show Author Information

Abstract

Opposition-based learning (OBL) is an optimization method widely applied to algorithms. Through analysis, it has been found that different variants of OBL demonstrate varying performance in solving different problems, which makes it crucial for multiple OBL strategies to co-optimize. Therefore, this study proposed a dynamic allocation of OBL in differential evolution for multi-role individuals. Before the population update in DAODE, individuals in the population played multiple roles and were stored in corresponding archives. Subsequently, different roles received respective rewards through a comprehensive ranking mechanism based on OBL, which assigned an OBL strategy to maintain a balance between exploration and exploitation within the population. In addition, a mutation strategy based on multi-role archives was proposed. Individuals for mutation operations were selected from the archives, thereby influencing the population to evolve toward more promising regions. Experimental results were compared between DAODE and state of the art algorithms on the benchmark suite presented at the 2017 IEEE conference on evolutionary computation (CEC2017). Furthermore, statistical tests were conducted to examine the significance differences between DAODE and the state of the art algorithms. The experimental results indicated that the overall performance of DAODE surpasses all state of the art algorithms on more than half of the test functions. Additionally, the results of statistical tests also demonstrated that DAODE consistently ranked first in comprehensive ranking.

References

【1】
【1】
 
 
Electronic Research Archive
Pages 3241-3274

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Guan J, Yu F, Wu H, et al. Dynamic allocation of opposition-based learning in differential evolution for multi-role individuals. Electronic Research Archive, 2024, 32(5): 3241-3274. https://doi.org/10.3934/era.2024149

0

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 20 February 2024
Revised: 23 April 2024
Accepted: 28 April 2024
Published: 15 May 2024
©2024 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)