In recent years, researchers have taken the many-objective optimization algorithm, which can optimize 5, 8, 10, 15, 20 objective functions simultaneously, as a new research topic. However, the current research on many-objective optimization technology also encounters some challenges. For example: Pareto resistance phenomenon, difficult diversity maintenance. Based on the above problems, this paper proposes a many-objective evolutionary algorithm based on three states (MOEA/TS). Firstly, a feature extraction operator is proposed. It can extract the features of the high-quality solution set, and then assist the evolution of the current individual. Secondly, based on Pareto front layer, the concept of "individual importance degree" is proposed. The importance degree of an individual can reflect the importance of the individual in the same Pareto front layer, so as to further distinguish the advantages and disadvantages of different individuals in the same front layer. Then, a repulsion field method is proposed. The diversity of the population in the objective space is maintained by the repulsion field, so that the population can be evenly distributed on the real Pareto front. Finally, a new concurrent algorithm framework is designed. In the algorithm framework, the algorithm is divided into three states, and each state focuses on a specific task. The population can switch freely among these three states according to its own evolution. The MOEA/TS algorithm is compared with 7 advanced many-objective optimization algorithms. The experimental results show that the MOEA/TS algorithm is more competitive in many-objective optimization problems.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11333576 | PMC |
http://dx.doi.org/10.1038/s41598-024-70145-8 | DOI Listing |
Sci Rep
November 2024
Yunnan Key Laboratory of Unmanned Autonomous System, Yunnan Minzu University, Kunming, 650504, China.
Multi-constraint UAV path planning problems can be viewed as many-objective optimization problems that can be solved by meta-heuristic algorithms with good self-organizing optimization capabilities. However, such algorithms mostly use random initializing methods, resulting in low-quality initial paths that reduce the efficiency of subsequent algorithmic searches. Moreover, as the number of objective functions increases, meta-heuristic algorithms face inadequate selection pressure and convergence capability, which lead to poor solution.
View Article and Find Full Text PDFPeerJ Comput Sci
September 2024
Department of Software Engineering, Firat (Euphrates) University, Elazig, Turkey.
Classification rule mining represents a significant field of machine learning, facilitating informed decision-making through the extraction of meaningful rules from complex data. Many classification methods cannot simultaneously optimize both explainability and different performance metrics at the same time. Metaheuristic optimization-based solutions, inspired by natural phenomena, offer a potential paradigm shift in this field, enabling the development of interpretable and scalable classifiers.
View Article and Find Full Text PDFSci Rep
August 2024
School of Computer Science and Technology, Hainan University, Haikou, 570228, China.
PeerJ Comput Sci
July 2024
Shanxi Key Laboratory of Big Data Analysis and Parallel Computing, Taiyuan University of Science and Technology, Taiyuan, ShanXi, China.
Constrained many-objective optimization problems (CMaOPs) have gradually emerged in various areas and are significant for this field. These problems often involve intricate Pareto frontiers (PFs) that are both refined and uneven, thereby making their resolution difficult and challenging. Traditional algorithms tend to over prioritize convergence, leading to premature convergence of the decision variables, which greatly reduces the possibility of finding the constrained Pareto frontiers (CPFs).
View Article and Find Full Text PDFHeliyon
June 2024
Computer Science Department, Al Al-Bayt University, Mafraq, 25113, Jordan.
Many-objective optimization (MaO) is an important aspect of engineering scenarios. In many-objective optimization algorithms (MaOAs), a key challenge is to strike a balance between diversity and convergence. MaOAs employs various tactics to either enhance selection pressure for better convergence and/or implements additional measures for sustaining diversity.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!