中文版 | English
Title

Constrained many-objective evolutionary algorithm based on adaptive infeasible ratio

Author
Corresponding AuthorZhu,Zexuan
Publication Years
2023-09-01
DOI
Source Title
ISSN
1865-9284
EISSN
1865-9292
Volume15Issue:3Pages:281-300
Abstract
Constrained many-objective optimization problems (CMaOPs) pose great challenges for evolutionary algorithms to reach an appropriate trade-off of solution feasibility, convergence, and diversity. To deal with this issue, this paper proposes a constrained many-objective evolutionary algorithm based on adaptive infeasible ratio (CMaOEA-AIR). In the evolution process, CMaOEA-AIR adaptively determines the ratio of infeasible solutions to survive into the next generation according to the number and the objective values of the infeasible solutions. The feasible solutions then undergo an exploitation-biased environmental selection based on indicator ranking and diversity maintaining, while the infeasible solutions undergo environmental selection based on adaptive selection criteria, aiming at the enhancement of exploration. In this way, both feasible and infeasible solutions are appropriately used to balance the exploration and exploitation of the search space. The proposed CMaOEA-AIR is compared with the other state-of-the-art constrained many-objective optimization algorithms on three types of CMaOPs of up to 15 objectives. The experimental results show that CMaOEA-AIR is competitive with the compared algorithms considering the overall performance in terms of solution feasibility, convergence, and diversity.
Keywords
URL[Source Record]
Indexed By
Language
English
SUSTech Authorship
Corresponding
Funding Project
Innovative Research Group Project of the National Natural Science Foundation of China[61871272];
WOS Research Area
Computer Science ; Operations Research & Management Science
WOS Subject
Computer Science, Artificial Intelligence ; Operations Research & Management Science
WOS Accession No
WOS:001044211000001
Publisher
Scopus EID
2-s2.0-85167404924
Data Source
Scopus
Citation statistics
Cited Times [WOS]:0
Document TypeJournal Article
Identifierhttp://kc.sustech.edu.cn/handle/2SGJ60CL/559656
Affiliation
1.College of Computer Science and Software Engineering,Shenzhen University,Shenzhen,518060,China
2.Central R &D Institute,ZTE Corporation,Shenzhen,518057,China
3.Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation,Southern University of Science and Technology,Shenzhen,518055,China
Corresponding Author AffilicationSouthern University of Science and Technology
Recommended Citation
GB/T 7714
Liang,Zhengping,Chen,Canran,Wang,Xiyu,et al. Constrained many-objective evolutionary algorithm based on adaptive infeasible ratio[J]. Memetic Computing,2023,15(3):281-300.
APA
Liang,Zhengping,Chen,Canran,Wang,Xiyu,Liu,Ling,&Zhu,Zexuan.(2023).Constrained many-objective evolutionary algorithm based on adaptive infeasible ratio.Memetic Computing,15(3),281-300.
MLA
Liang,Zhengping,et al."Constrained many-objective evolutionary algorithm based on adaptive infeasible ratio".Memetic Computing 15.3(2023):281-300.
Files in This Item:
There are no files associated with this item.
Related Services
Fulltext link
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Export to Excel
Export to Csv
Altmetrics Score
Google Scholar
Similar articles in Google Scholar
[Liang,Zhengping]'s Articles
[Chen,Canran]'s Articles
[Wang,Xiyu]'s Articles
Baidu Scholar
Similar articles in Baidu Scholar
[Liang,Zhengping]'s Articles
[Chen,Canran]'s Articles
[Wang,Xiyu]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Liang,Zhengping]'s Articles
[Chen,Canran]'s Articles
[Wang,Xiyu]'s Articles
Terms of Use
No data!
Social Bookmark/Share
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.