1
|
Kalita K, Pandya SB, Čep R, Jangir P, Abualigah L. Many-objective ant lion optimizer (MaOALO): A new many-objective optimizer with its engineering applications. Heliyon 2024; 10:e32911. [PMID: 39022051 PMCID: PMC11253286 DOI: 10.1016/j.heliyon.2024.e32911] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/27/2024] [Revised: 06/07/2024] [Accepted: 06/11/2024] [Indexed: 07/20/2024] Open
Abstract
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. With increase in number of objectives, the process becomes more complex, mainly due to challenges in achieving convergence during population selection. This paper introduces a novel Many-Objective Ant Lion Optimizer (MaOALO), featuring the widely-popular ant lion optimizer algorithm. This method utilizes reference point, niche preserve and information feedback mechanism (IFM), to enhance the convergence and diversity of the population. Extensive experimental tests on five real-world (RWMaOP1- RWMaOP5) optimization problems and standard problem classes, including MaF1-MaF15 (for 5, 9 and 15 objectives), DTLZ1-DTLZ7 (for 8 objectives) has been carried out. It is shown that MaOALO is superior compared to ARMOEA, NSGA-III, MaOTLBO, RVEA, MaOABC-TA, DSAE, RL-RVEA and MaOEA-IH algorithms in terms of GD, IGD, SP, SD, HV and RT metrics. The MaOALO source code is available at: https://github.com/kanak02/MaOALO.
Collapse
Affiliation(s)
- Kanak Kalita
- Department of Mechanical Engineering, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Avadi, 600 062, India
- University Centre for Research & Development, Chandigarh University, Mohali, 140413, India
| | - Sundaram B. Pandya
- Department of Electrical Engineering, Shri K.J. Polytechnic, Bharuch, 392 001, India
| | - Robert Čep
- Department of Machining, Assembly and Engineering Metrology, Faculty of Mechanical Engineering, VSB-Technical University of Ostrava, 70800, Ostrava, Czech Republic
| | - Pradeep Jangir
- Department of Biosciences, Saveetha School of Engineering. Saveetha Institute of Medical and Technical Sciences, Chennai, 602 105, India
| | - Laith Abualigah
- Computer Science Department, Al Al-Bayt University, Mafraq, 25113, Jordan
- MEU Research Unit, Middle East University, Amman, 11831, Jordan
- Applied Science Research Center, Applied Science Private University, Amman, 11931, Jordan
- Jadara Research Center, Jadara University, Irbid, 21110, Jordan
- Artificial Intelligence and Sensing Technologies (AIST) Research Center, University of Tabuk, Tabuk, 71491, Saudi Arabia
| |
Collapse
|
2
|
Peng C, Dai C, Xue X. A Many-Objective Evolutionary Algorithm Based on Dual Selection Strategy. ENTROPY (BASEL, SWITZERLAND) 2023; 25:1015. [PMID: 37509962 PMCID: PMC10378021 DOI: 10.3390/e25071015] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Received: 05/21/2023] [Revised: 06/21/2023] [Accepted: 06/22/2023] [Indexed: 07/30/2023]
Abstract
In high-dimensional space, most multi-objective optimization algorithms encounter difficulties in solving many-objective optimization problems because they cannot balance convergence and diversity. As the number of objectives increases, the non-dominated solutions become difficult to distinguish while challenging the assessment of diversity in high-dimensional objective space. To reduce selection pressure and improve diversity, this article proposes a many-objective evolutionary algorithm based on dual selection strategy (MaOEA/DS). First, a new distance function is designed as an effective distance metric. Then, based distance function, a point crowding-degree (PC) strategy, is proposed to further enhance the algorithm's ability to distinguish superior solutions in population. Finally, a dual selection strategy is proposed. In the first selection, the individuals with the best convergence are selected from the top few individuals with good diversity in the population, focusing on population convergence. In the second selection, the PC strategy is used to further select individuals with larger crowding distance values, emphasizing population diversity. To extensively evaluate the performance of the algorithm, this paper compares the proposed algorithm with several state-of-the-art algorithms. The experimental results show that MaOEA/DS outperforms other comparison algorithms in overall performance, indicating the effectiveness of the proposed algorithm.
Collapse
Affiliation(s)
- Cheng Peng
- School of Computer Science, Shaanxi Normal University, Xi'an 710119, China
| | - Cai Dai
- School of Computer Science, Shaanxi Normal University, Xi'an 710119, China
| | - Xingsi Xue
- Fujian Provincial Key Laboratory of Big Data Mining and Applications, Fujian University of Technology, Fuzhou 350118, China
| |
Collapse
|
3
|
Gu Q, Luo J, Li X, Lu C. An adaptive evolutionary algorithm with coordinated selection strategies for many-objective optimization. APPL INTELL 2022. [DOI: 10.1007/s10489-022-03982-7] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/24/2022]
|
4
|
Shen J, Wang P, Dong H, Li J, Wang W. A multistage evolutionary algorithm for many-objective optimization. Inf Sci (N Y) 2022. [DOI: 10.1016/j.ins.2021.12.096] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
|