1
|
Wu X, Li S, Wu F, Jiang X. Teaching-Learning Optimization Algorithm Based on the Cadre-Mass Relationship with Tutor Mechanism for Solving Complex Optimization Problems. Biomimetics (Basel) 2023; 8:462. [PMID: 37887594 PMCID: PMC10604210 DOI: 10.3390/biomimetics8060462] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/25/2023] [Revised: 09/10/2023] [Accepted: 09/21/2023] [Indexed: 10/28/2023] Open
Abstract
The teaching-learning-based optimization (TLBO) algorithm, which has gained popularity among scholars for addressing practical issues, suffers from several drawbacks including slow convergence speed, susceptibility to local optima, and suboptimal performance. To overcome these limitations, this paper presents a novel algorithm called the teaching-learning optimization algorithm, based on the cadre-mass relationship with the tutor mechanism (TLOCTO). Building upon the original teaching foundation, this algorithm incorporates the characteristics of class cadre settings and extracurricular learning institutions. It proposes a new learner strategy, cadre-mass relationship strategy, and tutor mechanism. The experimental results on 23 test functions and CEC-2020 benchmark functions demonstrate that the enhanced algorithm exhibits strong competitiveness in terms of convergence speed, solution accuracy, and robustness. Additionally, the superiority of the proposed algorithm over other popular optimizers is confirmed through the Wilcoxon signed rank-sum test. Furthermore, the algorithm's practical applicability is demonstrated by successfully applying it to three complex engineering design problems.
Collapse
Affiliation(s)
- Xiao Wu
- School of Mechanical Engineering, Guizhou University, Guiyang 550025, China;
| | - Shaobo Li
- State Key Laboratory of Public Big Data, Guizhou University, Guiyang 550025, China; (F.W.); (X.J.)
| | - Fengbin Wu
- State Key Laboratory of Public Big Data, Guizhou University, Guiyang 550025, China; (F.W.); (X.J.)
| | - Xinghe Jiang
- State Key Laboratory of Public Big Data, Guizhou University, Guiyang 550025, China; (F.W.); (X.J.)
| |
Collapse
|
2
|
A comprehensive survey on the sine–cosine optimization algorithm. Artif Intell Rev 2022. [DOI: 10.1007/s10462-022-10277-3] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/02/2022]
Abstract
AbstractMetaheuristic algorithms based on intelligent rules have been successfully developed and applied to solve many optimization areas over the past few decades. The sine–cosine algorithm (SCA) imitates the behaviour of transcendental functions while the sine and cosine functions are presented to explore and exploit the search space. SCA starts by random population and executes iterative evolution processes to update the standard evolutionary algorithm’s destination or the best location. SCA used linear transition rules to balance the exploration and exploitation searches while searching for the best or optimal solutions. Since Mirjalili proposed it in 2016, SCA has attracted many researchers’ attention to deal with several optimization problems in many fields due to its strengths in solving optimization tasks that include the simple concept, easiness of implementation, and rapid convergence. This paper aims to provide researchers with a relatively comprehensive and extensive overview of the Sine–Cosine optimization algorithm in the literature to inspire further research. It examines the available publications, including improvements, binary, chaotic, hybridizations, multi-objective variants, and different applications. Some optimization formulations regarding single-objective optimization problems, multi-objective optimization problems, binary-objective optimization problems, and more classifications regarding the optimization types are discussed. An extensive bibliography is also included.
Collapse
|
3
|
An Overview of the Application of Harmony Search for Chemical Engineering Optimization. INTERNATIONAL JOURNAL OF CHEMICAL ENGINEERING 2022. [DOI: 10.1155/2022/1928343] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]
Abstract
Harmony search algorithm and its variants have been used in several applications in medicine, telecommunications, computer science, and engineering. This article reviews the global and multi-objective optimization for chemical engineering using harmony search. The main features of the HS method and several of its popular variants and hybrid versions including their relevant algorithm characteristics are described and discussed. A variety of global and multi-objective optimization problems from chemical engineering and their resolution using HS-based methods are also included. These problems involve thermodynamic calculations (phase stability analysis, phase equilibrium calculations, parameter estimation, and azeotrope calculation), heat exchanger design, distillation simulation, life cycle analysis, and water distribution systems, among others. Remarks on future developments of HS and its related algorithms for global and multi-objective optimization in chemical engineering are also provided in this review. HS is a reliable and promising stochastic optimizer to resolve challenging global and multi-objective optimization problems for process systems engineering.
Collapse
|
4
|
Abstract
Wild horse optimizer (WHO) is a recently proposed metaheuristic algorithm that simulates the social behavior of wild horses in nature. Although WHO shows competitive performance compared to some algorithms, it suffers from low exploitation capability and stagnation in local optima. This paper presents an improved wild horse optimizer (IWHO), which incorporates three improvements to enhance optimizing capability. The main innovation of this paper is to put forward the random running strategy (RRS) and the competition for waterhole mechanism (CWHM). The random running strategy is employed to balance exploration and exploitation, and the competition for waterhole mechanism is proposed to boost exploitation behavior. Moreover, the dynamic inertia weight strategy (DIWS) is utilized to optimize the global solution. The proposed IWHO is evaluated using twenty-three classical benchmark functions, ten CEC 2021 test functions, and five real-world optimization problems. High-dimensional cases (D = 200, 500, 1000) are also tested. Comparing nine well-known algorithms, the experimental results of test functions demonstrate that the IWHO is very competitive in terms of convergence speed, precision, accuracy, and stability. Further, the practical capability of the proposed method is verified by the results of engineering design problems.
Collapse
|
5
|
Zheng R, Jia H, Abualigah L, Wang S, Wu D. An improved remora optimization algorithm with autonomous foraging mechanism for global optimization problems. MATHEMATICAL BIOSCIENCES AND ENGINEERING : MBE 2022; 19:3994-4037. [PMID: 35341284 DOI: 10.3934/mbe.2022184] [Citation(s) in RCA: 5] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/14/2023]
Abstract
The remora optimization algorithm (ROA) is a newly proposed metaheuristic algorithm for solving global optimization problems. In ROA, each search agent searches new space according to the position of host, which makes the algorithm suffer from the drawbacks of slow convergence rate, poor solution accuracy, and local optima for some optimization problems. To tackle these problems, this study proposes an improved ROA (IROA) by introducing a new mechanism named autonomous foraging mechanism (AFM), which is inspired from the fact that remora can also find food on its own. In AFM, each remora has a small chance to search food randomly or according to the current food position. Thus the AFM can effectively expand the search space and improve the accuracy of the solution. To substantiate the efficacy of the proposed IROA, twenty-three classical benchmark functions and ten latest CEC 2021 test functions with various types and dimensions were employed to test the performance of IROA. Compared with seven metaheuristic and six modified algorithms, the results of test functions show that the IROA has superior performance in solving these optimization problems. Moreover, the results of five representative engineering design optimization problems also reveal that the IROA has the capability to obtain the optimal results for real-world optimization problems. To sum up, these test results confirm the effectiveness of the proposed mechanism.
Collapse
Affiliation(s)
- Rong Zheng
- School of Information Engineering, Sanming University, Sanming 365004, China
| | - Heming Jia
- School of Information Engineering, Sanming University, Sanming 365004, China
| | - Laith Abualigah
- Faculty of Computer Sciences and Informatics, Amman Arab University, Amman 11953, Jordan
- School of Computer Science, Universiti Sains Malaysia, Penang 11800, Malaysia
| | - Shuang Wang
- School of Information Engineering, Sanming University, Sanming 365004, China
| | - Di Wu
- School of Education and Music, Sanming University, Sanming 365004, China
| |
Collapse
|
6
|
Yin S, Luo Q, Zhou Y. EOSMA: An Equilibrium Optimizer Slime Mould Algorithm for Engineering Design Problems. ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2022. [DOI: 10.1007/s13369-021-06513-7] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/07/2023]
|
7
|
Zheng R, Jia H, Abualigah L, Liu Q, Wang S. An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems. MATHEMATICAL BIOSCIENCES AND ENGINEERING : MBE 2022; 19:473-512. [PMID: 34903000 DOI: 10.3934/mbe.2022023] [Citation(s) in RCA: 15] [Impact Index Per Article: 7.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/14/2023]
Abstract
Arithmetic optimization algorithm (AOA) is a newly proposed meta-heuristic method which is inspired by the arithmetic operators in mathematics. However, the AOA has the weaknesses of insufficient exploration capability and is likely to fall into local optima. To improve the searching quality of original AOA, this paper presents an improved AOA (IAOA) integrated with proposed forced switching mechanism (FSM). The enhanced algorithm uses the random math optimizer probability (RMOP) to increase the population diversity for better global search. And then the forced switching mechanism is introduced into the AOA to help the search agents jump out of the local optima. When the search agents cannot find better positions within a certain number of iterations, the proposed FSM will make them conduct the exploratory behavior. Thus the cases of being trapped into local optima can be avoided effectively. The proposed IAOA is extensively tested by twenty-three classical benchmark functions and ten CEC2020 test functions and compared with the AOA and other well-known optimization algorithms. The experimental results show that the proposed algorithm is superior to other comparative algorithms on most of the test functions. Furthermore, the test results of two training problems of multi-layer perceptron (MLP) and three classical engineering design problems also indicate that the proposed IAOA is highly effective when dealing with real-world problems.
Collapse
Affiliation(s)
- Rong Zheng
- School of Information Engineering, Sanming University, Sanming 365004, China
| | - Heming Jia
- School of Information Engineering, Sanming University, Sanming 365004, China
| | - Laith Abualigah
- Faculty of Computer Sciences and Informatics, Amman Arab University, Amman 11953, Jordan
- School of Computer Science, Universiti Sains Malaysia, Penang 11800, Malaysia
| | - Qingxin Liu
- School of Computer Science and Technology, Hainan University, Haikou 570228, China
| | - Shuang Wang
- School of Information Engineering, Sanming University, Sanming 365004, China
| |
Collapse
|
8
|
Deep Ensemble of Slime Mold Algorithm and Arithmetic Optimization Algorithm for Global Optimization. Processes (Basel) 2021. [DOI: 10.3390/pr9101774] [Citation(s) in RCA: 32] [Impact Index Per Article: 10.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022] Open
Abstract
In this paper, a new hybrid algorithm based on two meta-heuristic algorithms is presented to improve the optimization capability of original algorithms. This hybrid algorithm is realized by the deep ensemble of two new proposed meta-heuristic methods, i.e., slime mold algorithm (SMA) and arithmetic optimization algorithm (AOA), called DESMAOA. To be specific, a preliminary hybrid method was applied to obtain the improved SMA, called SMAOA. Then, two strategies that were extracted from the SMA and AOA, respectively, were embedded into SMAOA to boost the optimizing speed and accuracy of the solution. The optimization performance of the proposed DESMAOA was analyzed by using 23 classical benchmark functions. Firstly, the impacts of different components are discussed. Then, the exploitation and exploration capabilities, convergence behaviors, and performances are evaluated in detail. Cases at different dimensions also were investigated. Compared with the SMA, AOA, and another five well-known optimization algorithms, the results showed that the proposed method can outperform other optimization algorithms with high superiority. Finally, three classical engineering design problems were employed to illustrate the capability of the proposed algorithm for solving the practical problems. The results also indicate that the DESMAOA has very promising performance when solving these problems.
Collapse
|