Search

This study proposes the One-to-One-Based Optimizer (OOBO), a new optimization technique for solving optimization problems in various scientific areas. The key idea in designing the suggested OOBO is to effectively use the knowledge of all members in the process of updating the algorithm population while preventing the algorithm from relying on specific members of the population. We use a one-to-one correspondence between the two sets of population members and the members selected as guides to increase the involvement of all population members in the update process. Each population member is chosen just once as a guide and is only utilized to update another member of the population in this one-to-one interaction. The proposed OOBO's performance in optimization is evaluated with fifty-two objective functions, encompassing unimodal, high-dimensional multimodal, and fixed-dimensional multimodal types, and the CEC 2017 test suite. The optimization results highlight the remarkable capacity of OOBO to strike a balance between exploration and exploitation within the problem-solving space during the search process. The quality of the optimization results achieved using the proposed OOBO is evaluated by comparing them to eight well-known algorithms. The simulation findings show that OOBO outperforms the other algorithms in addressing optimization problems and can give more acceptable quasi-optimal solutions. Also, the implementation of OOBO in six engineering problems shows the effectiveness of the proposed approach in solving real-world optimization applications. [ABSTRACT FROM AUTHOR]

In this paper, based on the concept of the NFL theorem, that there is no unique algorithm that has the best performance for all optimization problems, a new human-based metaheuristic algorithm called Language Education Optimization (LEO) is introduced, which is used to solve optimization problems. LEO is inspired by the foreign language education process in which a language teacher trains the students of language schools in the desired language skills and rules. LEO is mathematically modeled in three phases: (i) students selecting their teacher, (ii) students learning from each other, and (iii) individual practice, considering exploration in local search and exploitation in local search. The performance of LEO in optimization tasks has been challenged against fifty-two benchmark functions of a variety of unimodal, multimodal types and the CEC 2017 test suite. The optimization results show that LEO, with its acceptable ability in exploration, exploitation, and maintaining a balance between them, has efficient performance in optimization applications and solution presentation. LEO efficiency in optimization tasks is compared with ten well-known metaheuristic algorithms. Analyses of the simulation results show that LEO has effective performance in dealing with optimization tasks and is significantly superior and more competitive in combating the compared algorithms. The implementation results of the proposed approach to four engineering design problems show the effectiveness of LEO in solving real-world optimization applications. [ABSTRACT FROM AUTHOR]

In this paper, a new stochastic optimization algorithm is introduced, called Driving Training-Based Optimization (DTBO), which mimics the human activity of driving training. The fundamental inspiration behind the DTBO design is the learning process to drive in the driving school and the training of the driving instructor. DTBO is mathematically modeled in three phases: (1) training by the driving instructor, (2) patterning of students from instructor skills, and (3) practice. The performance of DTBO in optimization is evaluated on a set of 53 standard objective functions of unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and IEEE CEC2017 test functions types. The optimization results show that DTBO has been able to provide appropriate solutions to optimization problems by maintaining a proper balance between exploration and exploitation. The performance quality of DTBO is compared with the results of 11 well-known algorithms. The simulation results show that DTBO performs better compared to 11 competitor algorithms and is more efficient in optimization applications. [ABSTRACT FROM AUTHOR]

In this paper, a new optimization algorithm called hybrid leader-based optimization (HLBO) is introduced that is applicable in optimization challenges. The main idea of HLBO is to guide the algorithm population under the guidance of a hybrid leader. The stages of HLBO are modeled mathematically in two phases of exploration and exploitation. The efficiency of HLBO in optimization is tested by finding solutions to twenty-three standard benchmark functions of different types of unimodal and multimodal. The optimization results of unimodal functions indicate the high exploitation ability of HLBO in local search for better convergence to global optimal, while the optimization results of multimodal functions show the high exploration ability of HLBO in global search to accurately scan different areas of search space. In addition, the performance of HLBO on solving IEEE CEC 2017 benchmark functions including thirty objective functions is evaluated. The optimization results show the efficiency of HLBO in handling complex objective functions. The quality of the results obtained from HLBO is compared with the results of ten well-known algorithms. The simulation results show the superiority of HLBO in convergence to the global solution as well as the passage of optimally localized areas of the search space compared to ten competing algorithms. In addition, the implementation of HLBO on four engineering design issues demonstrates the applicability of HLBO in real-world problem solving. [ABSTRACT FROM AUTHOR]

This paper introduces a new human-based metaheuristic algorithm called Sewing Training-Based Optimization (STBO), which has applications in handling optimization tasks. The fundamental inspiration of STBO is teaching the process of sewing to beginner tailors. The theory of the proposed STBO approach is described and then mathematically modeled in three phases: (i) training, (ii) imitation of the instructor's skills, and (iii) practice. STBO performance is evaluated on fifty-two benchmark functions consisting of unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and the CEC 2017 test suite. The optimization results show that STBO, with its high power of exploration and exploitation, has provided suitable solutions for benchmark functions. The performance of STBO is compared with eleven well-known metaheuristic algorithms. The simulation results show that STBO, with its high ability to balance exploration and exploitation, has provided far more competitive performance in solving benchmark functions than competitor algorithms. Finally, the implementation of STBO in solving four engineering design problems demonstrates the capability of the proposed STBO in dealing with real-world applications. [ABSTRACT FROM AUTHOR]

Metaheuristic algorithms have a wide range of applications in handling optimization problems. In this study, a new metaheuristic algorithm, called the chef-based optimization algorithm (CBOA), is developed. The fundamental inspiration employed in CBOA design is the process of learning cooking skills in training courses. The stages of the cooking training process in various phases are mathematically modeled with the aim of increasing the ability of global search in exploration and the ability of local search in exploitation. A collection of 52 standard objective functions is utilized to assess the CBOA's performance in addressing optimization issues. The optimization results show that the CBOA is capable of providing acceptable solutions by creating a balance between exploration and exploitation and is highly efficient in the treatment of optimization problems. In addition, the CBOA's effectiveness in dealing with real-world applications is tested on four engineering problems. Twelve well-known metaheuristic algorithms have been selected for comparison with the CBOA. The simulation results show that CBOA performs much better than competing algorithms and is more effective in solving optimization problems. [ABSTRACT FROM AUTHOR]

Finding a suitable solution to an optimization problem designed in science is a major challenge. Therefore, these must be addressed utilizing proper approaches. Based on a random search space, optimization algorithms can find acceptable solutions to problems. Archery Algorithm (AA) is a new stochastic approach for addressing optimization problems that is discussed in this study. The fundamental idea of developing the suggested AA is to imitate the archer's shooting behavior toward the target panel. The proposed algorithm updates the location of each member of the population in each dimension of the search space by a member randomly marked by the archer. The AA is mathematically described, and its capacity to solve optimization problems is evaluated on twenty-three distinct types of objective functions. Furthermore, the proposed algorithm's performance is compared vs. eight approaches, including teaching-learning based optimization, marine predators algorithm, genetic algorithm, grey wolf optimization, particle swarm optimization, whale optimization algorithm, gravitational search algorithm, and tunicate swarm algorithm. According to the simulation findings, the AA has a good capacity to tackle optimization issues in both unimodal and multimodal scenarios, and it can give adequate quasi-optimal solutions to these problems. The analysis and comparison of competing algorithms' performance with the proposed algorithm demonstrates the superiority and competitiveness of the AA. [ABSTRACT FROM AUTHOR]

Optimization plays an effective role in various disciplines of science and engineering. Optimization problems should either be optimized using the appropriate method (i.e., minimization or maximization). Optimization algorithms are one of the efficient and effective methods in providing quasi-optimal solutions for these type of problems. In this study, a new algorithm called the Mutated Leader Algorithm (MLA) is presented. The main idea in the proposed MLA is to update the members of the algorithm population in the search space based on the guidance of a mutated leader. In addition to information about the best member of the population, the mutated leader also contains information about the worst member of the population, as well as other normal members of the population. The proposed MLA is mathematically modeled for implementation on optimization problems. A standard set consisting of twenty-three objective functions of different types of unimodal, fixed-dimensional multimodal, and high-dimensional multimodal is used to evaluate the ability of the proposed algorithm in optimization. Also, the results obtained from the MLA are compared with eight well-known algorithms. The results of optimization of objective functions show that the proposed MLA has a high ability to solve various optimization problems. Also, the analysis and comparison of the performance of the proposed MLA against the eight compared algorithms indicates the superiority of the proposed algorithm and ability to provide more suitable quasi-optimal solutions. [ABSTRACT FROM AUTHOR]

Optimization plays a key role in various disciplines of science in order to achieve the optimal solution among all available solutions. Innovation and contribution of this paper is in introducing a new optimization algorithm called Puzzle Optimization Algorithm (POA) to solve various optimization problems. The main idea in the design of the proposed POA is the mathematical simulation of the process of solving a puzzle as an evolutionary optimizer. The various steps of POA are explained and then its mathematical model is presented. The main advantage and feature of the proposed POA is that it has no control parameters and therefore does not require parameter setting. The performance of the proposed POA is tested on twenty-three different objective functions. Also, in order to analyse the performance of POA in optimization, its results are compared with eight other optimization algorithms. The optimization results indicate the high and acceptable ability of the proposed POA to solve optimization problems. In addition, the simulation results show that the proposed POA is far better and much more competitive than the eight compared optimization algorithms. [ABSTRACT FROM AUTHOR]

Designed optimization problems in different disciplines of science should be solved using appropriate techniques. Optimization algorithms are among the most effective and widely used methods in solving optimization problems that are able to provide suitable solutions for these problems. Innovation and scientific contribution of this article in designing a new optimizer called Random Selected Leader Based Optimizer (RSLBO) in order to be used in optimizing the objective functions of optimization problems and achieving the desired solutions. The main idea of the proposed RSLBO is to increase the search power using a random leader. In fact, instead of the algorithm population update relying on several specific members, such as the best member or the worst member, any ordinary member of the population can be a leader in guiding and updating the algorithm population. RSLBO is described, then mathematically modelled to be used in solving optimization problems. The main feature and advantage of the proposed RSLBO is that its implementation and relationships are very simple and understandable, and it also lacks control parameters. The performance of the proposed RSLBO is evaluated on a set of twenty-three standard functions. Also, in order to analyse the quality of the proposed RSLBO in providing appropriate solutions to optimization problems, the results obtained from the proposed algorithm are compared with eight well-known algorithms including Flow Direction Algorithm (FDA), Hide Object Game Optimizer (HOGO), Whale Optimization Algorithm (WOA), Grey Wolf Optimization (GWO), Teaching-Learning-Based Optimization (TLBO), Gravitational Search Algorithm (GSA), Particle Swarm Optimization (PSO), and Genetic Algorithm (GA). The results of optimization of objective functions indicate the high ability of the RSLBO to solve optimization problems and provide appropriate and acceptable solutions. Also, the analysis and comparison of the performance of the eight well-known optimization algorithms against the proposed RSLBO shows that the RSLBO has provided more appropriate solutions and is superior and much more competitive than the eight compared algorithms. [ABSTRACT FROM AUTHOR]

One of the most important and efficient methods in providing suitable solutions for various optimization problems is population-based optimization algorithms. The main contribution and innovation of this paper is to present a new optimization method called Three Influential Members Based Optimizer (TIMBO) which is used for implementation in solving optimization problems. The main idea in designing the proposed TIMBO is to use three important population members with the titles of best member, worst member, and member as mean population in updating the position of population members of the algorithm in the problem search space. The most important feature and advantage of the TIMBO is that it does not have any control parameters, which means that there is no need to control the parameter in this algorithm. TIMBO has been mathematically modeled for use in solving various optimization problems. The efficiency of the TIMBO is analyzed in order to provide suitable quasi-optimal solutions on a set of twenty-three standard objective functions of different types unimodal, high-dimensional multimodal, and fixed-dimensional. Evaluation of unimodal functions indicates the high exploitation power of the proposed TIMBO and evaluation of multimodal functions indicates the appropriate exploration power of the TIMBO. Also, the results obtained from the TIMBO are compared with the performance of eight other well-known optimization algorithms including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Teaching-Learning-Based Optimization (TLBO), Grey Wolf Optimization (GWO), Grasshopper Optimisation Algorithm (GOA), Hide Object Game Optimizer (HOGO), and Flow Direction Algorithm (FDA). The results of optimization of standard objective functions indicate the high capability of the TIMBO in providing quasi-optimal solutions suitable for various optimization problems. In addition, analyzing and comparing the performance of the other eight optimization algorithms shows that the TIMBO has a more effective ability to solve optimization problems and is much more competitive. [ABSTRACT FROM AUTHOR]

There are numerous optimization problems in various sciences that need to be solved using the appropriate technique. One of the most widely used techniques for solving optimization problems are population-based optimization algorithms. The innovation and contribution of this paper is to design a new optimizer called Mixed Leader Based Optimizer (MLBO) to solve optimization problems. The main idea in the proposed MLBO is to create a new member as a leader by mixing the best population member and a random member to guide the algorithm population. The main advantage and feature of the proposed MLBO is that it has no control parameters and therefore no need to adjust the parameter. The proposed MLBO algorithm is mathematically formulated to implement in solving various optimization problems. The capability of the proposed optimizer in optimizing and providing appropriate solutions has been tested on a set of twenty-three standard objective functions. These objective functions are selected from three different types including unimodal, high-dimensional multimodal, and fixed-dimensional multimodal in order to analyze different aspects of optimization algorithms. Also, in order to analyze the obtained optimization results, the performance of the MLBO is compared with eight other well-known algorithms including Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Teaching Learning-Based Optimization (TLBO), Gravitational Search Algorithm (GSA), Gray Wolf Optimizer (GWO), Emperor Penguin Optimizer (EPO), Shell Game Optimization (SGO), and Hide Objects Game Optimization (HOGO). The obtained optimization results from the MLBO show the proper performance of the proposed algorithm in solving various optimization problems. On the other hand, comparing the performance of the MLBO with the other eight optimization algorithms indicates the superiority of the proposed optimizer over the compared algorithms. [ABSTRACT FROM AUTHOR]

Numerous designed optimization problems in different disciplines of science should be solved using appropriate techniques. population based optimization algorithms are one of the powerful tools in solving optimization problems. The innovation of this paper is to present a new optimization algorithm called Mixed Best Members Based Optimizer (MBMBO) that can be used to solve various optimization problems. The main idea in designing the proposed MBMBO algorithm is to create a mixed member of several top members of the population in order to guide and update the algorithm population. The main feature and advantage of the MBMBO is the lack of control parameters. Therefore, the proposed MBMBO does not need to adjust the parameter. The various steps of the MBMBO are described and then mathematically modeled for implementation in solving optimization problems. The performance of the MBMBO in solving optimization problems is evaluated on a set of twenty-three standard objective functions. These objective functions are of three different types, including seven unimodal objective functions, six high dimensional multi-model objective functions, and ten fixed dimensional multi-model objective functions. The results of evaluation of single-model objective functions indicate the high exploitation power and also the results of evaluation of multi-model objective functions indicate the high exploration power of the proposed MBMBO algorithm. Also, the results obtained from the simulation of the MBMBO are compared with the results of eight other well-known optimization algorithms including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Teaching Learning-Based Optimization (TLBO), Gray Wolf Optimizer (GWO), Emperor Penguin Optimizer (EPO), Hide Objects Game Optimization (HOGO), and Shell Game Optimization (SGO). The results of optimizing the objective functions of unimodal and multi-modal types using MBMBO show the acceptable ability of the proposed algorithm to provide suitable solutions. Comparison of the simulation results shows that the proposed MBMBO is much more competitive than the other eight optimization algorithms. [ABSTRACT FROM AUTHOR]

Optimization is the science that presents a solution among the available solutions considering an optimization problem's limitations. Optimization algorithms have been introduced as efficient tools for solving optimization problems. These algorithms are designed based on various natural phenomena, behavior, the lifestyle of living beings, physical laws, rules of games, etc. In this paper, a new optimization algorithm called the good and bad groups-based optimizer (GBGBO) is introduced to solve various optimization problems. In GBGBO, population members update under the influence of two groups named the good group and the bad group. The good group consists of a certain number of the population members with better fitness function than other members and the bad group consists of a number of the population members with worse fitness function than other members of the population. GBGBO is mathematically modeled and its performance in solving optimization problems was tested on a set of twenty-three different objective functions. In addition, for further analysis, the results obtained from the proposed algorithm were compared with eight optimization algorithms: genetic algorithm (GA), particle swarm optimization (PSO), gravitational search algorithm (GSA), teaching–learning-based optimization (TLBO), gray wolf optimizer (GWO), and the whale optimization algorithm (WOA), tunicate swarm algorithm (TSA), and marine predators algorithm (MPA). The results show that the proposed GBGBO algorithm has a good ability to solve various optimization problems and is more competitive than other similar algorithms. [ABSTRACT FROM AUTHOR]

There are many optimization problems in different scientific disciplines that should be solved and optimized using appropriate techniques. Population-based optimization algorithms are one of the most widely used techniques to solve optimization problems. This paper is focused on presenting a new population-based optimization approach called Ring Toss Game-Based Optimization (RTGBO) algorithm. The main idea of RTGBO is to simulate the behaviour of players and rules of the ring toss game in the design of the proposed algorithm. The main feature of the proposed RTGBO algorithm is the lack of control parameters. Steps of implementing RTGBO are described in detail and the proposed algorithm is mathematically modeled. The ability of RTGBO to solve optimization problems is evaluated on a set of twenty-three standard objective functions. These functions are selected from three different groups including unimodal, high-dimensional multimodal, and fixed-dimensional multimodal. The performance of RTGBO is also compared with eight other well-known optimization algorithms including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Teaching Learning-Based Optimization (TLBO), Gray Wolf Optimizer (GWO), Emperor Penguin Optimizer (EPO), Hide Objects Game Optimization (HOGO), and Shell Game Optimization (SGO). The results of optimization of objective functions of unimodal type indicate the high exploitation ability of RTGBO in solving optimization problems. On the other hand, the results of optimizing the multi-model type objective functions indicate the acceptable exploration ability of RTGBO. The results also confirm the superiority of the proposed RTGBO algorithm over mentioned optimization techniques. [ABSTRACT FROM AUTHOR]

Optimization problems in various fields of science and engineering should be solved using appropriate methods. Stochastic search-based optimization algorithms are a widely used approach for solving optimization problems. In this paper, a new optimization algorithm called "the good, the bad, and the ugly" optimizer (GBUO) is introduced, based on the effect of three members of the population on the population updates. In the proposed GBUO, the algorithm population moves towards the good member and avoids the bad member. In the proposed algorithm, a new member called ugly member is also introduced, which plays an essential role in updating the population. In a challenging move, the ugly member leads the population to situations contrary to society's movement. GBUO is mathematically modeled, and its equations are presented. GBUO is implemented on a set of twenty-three standard objective functions to evaluate the proposed optimizer's performance for solving optimization problems. The mentioned standard objective functions can be classified into three groups: unimodal, multimodal with high-dimension, and multimodal with fixed dimension functions. There was a further analysis carried-out for eight well-known optimization algorithms. The simulation results show that the proposed algorithm has a good performance in solving different optimization problems models and is superior to the mentioned optimization algorithms. [ABSTRACT FROM AUTHOR]

One of the most powerful tools for solving optimization problems is optimization algorithms (inspired by nature) based on populations. These algorithms provide a solution to a problem by randomly searching in the search space. The design's central idea is derived from various natural phenomena, the behavior and living conditions of living organisms, laws of physics, etc. A new population-based optimization algorithm called the Binary Spring Search Algorithm (BSSA) is introduced to solve optimization problems. BSSA is an algorithm based on a simulation of the famous Hooke's law (physics) for the traditional weights and springs system. In this proposal, the population comprises weights that are connected by unique springs. The mathematical modeling of the proposed algorithm is presented to be used to achieve solutions to optimization problems. The results were thoroughly validated in different unimodal and multimodal functions; additionally, the BSSA was compared with high-performance algorithms: binary grasshopper optimization algorithm, binary dragonfly algorithm, binary bat algorithm, binary gravitational search algorithm, binary particle swarm optimization, and binary genetic algorithm. The results show the superiority of the BSSA. The results of the Friedman test corroborate that the BSSA is more competitive. [ABSTRACT FROM AUTHOR]

In this paper, a new metaheuristic algorithm called the Coati Optimization Algorithm (COA) is introduced, which mimics coati behavior in nature. The fundamental idea of COA is the simulation of the two natural behaviors of coatis: (i) their behavior when attacking and hunting iguanas and (ii) their escape from predators. The implementation steps of COA are described and mathematically modeled in two phases of exploration and exploitation. COA performance is evaluated on fifty-one objective functions, including twenty-nine functions from the IEEE CEC-2017 test suite and twenty-two real-world applications from the IEEE CEC-2011 test suite. COA's results are compared to those of eleven well-known metaheuristic algorithms. The simulation results indicate that COA has an evident superiority over the compared algorithms by balancing exploration in global search and exploitation in local search, and is far more competitive. To assess the COA's effectiveness in real-world applications, the proposed approach is implemented on the IEEE CEC-2011 test functions and four practical optimization problems, which the simulation results indicate the high capability of COA in dealing with these types of optimization problems. • A new optimization algorithm called Coati Optimization Algorithm (COA) is designed to model the natural behaviors of coatis. • COA's fundamental inspirations include attacking and hunting coatis and the escape behavior of coatis when confronted by predators. • The various stages of COA are described, then mathematically modeled in two phases of exploration and exploitation. • Sixty-eight standard benchmark functions have been employed to evaluate COA performance in solving optimization problems. • The performance of the COA in presenting the optimization results is compared with eight well-known metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

With the advancement of science and technology, new complex optimization problems have emerged, and the achievement of optimal solutions has become increasingly important. Many of these problems have features and difficulties such as non-convex, nonlinear, discrete search space, and a non-differentiable objective function. Achieving the optimal solution to such problems has become a major challenge. To address this challenge and provide a solution to deal with the complexities and difficulties of optimization applications, a new stochastic-based optimization algorithm is proposed in this study. Optimization algorithms are a type of stochastic approach for addressing optimization issues that use random scanning of the search space to produce quasi-optimal answers. The Selecting Some Variables to Update-Based Algorithm (SSVUBA) is a new optimization algorithm developed in this study to handle optimization issues in various fields. The suggested algorithm's key principles are to make better use of the information provided by different members of the population and to adjust the number of variables used to update the algorithm population during the iterations of the algorithm. The theory of the proposed SSVUBA is described, and then its mathematical model is offered for use in solving optimization issues. Fifty-three objective functions, including unimodal, multimodal, and CEC 2017 test functions, are utilized to assess the ability and usefulness of the proposed SSVUBA in addressing optimization issues. SSVUBA's performance in optimizing real-world applications is evaluated on four engineering design issues. Furthermore, the performance of SSVUBA in optimization was compared to the performance of eight well-known algorithms to further evaluate its quality. The simulation results reveal that the proposed SSVUBA has a significant ability to handle various optimization issues and that it outperforms other competitor algorithms by giving appropriate quasi-optimal solutions that are closer to the global optima. [ABSTRACT FROM AUTHOR]

Numerous optimization problems designed in different branches of science and the real world must be solved using appropriate techniques. Population-based optimization algorithms are some of the most important and practical techniques for solving optimization problems. In this paper, a new optimization algorithm called the Cat and Mouse-Based Optimizer (CMBO) is presented that mimics the natural behavior between cats and mice. In the proposed CMBO, the movement of cats towards mice as well as the escape of mice towards havens is simulated. Mathematical modeling and formulation of the proposed CMBO for implementation on optimization problems are presented. The performance of the CMBO is evaluated on a standard set of objective functions of three different types including unimodal, high-dimensional multimodal, and fixed-dimensional multimodal. The results of optimization of objective functions show that the proposed CMBO has a good ability to solve various optimization problems. Moreover, the optimization results obtained from the CMBO are compared with the performance of nine other well-known algorithms including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Teaching-Learning-Based Optimization (TLBO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Marine Predators Algorithm (MPA), Tunicate Swarm Algorithm (TSA), and Teamwork Optimization Algorithm (TOA). The performance analysis of the proposed CMBO against the compared algorithms shows that CMBO is much more competitive than other algorithms by providing more suitable quasi-optimal solutions that are closer to the global optimal. [ABSTRACT FROM AUTHOR]

Population-based optimization algorithms are one of the most widely used and popular methods in solving optimization problems. In this paper, a new population-based optimization algorithm called the Teamwork Optimization Algorithm (TOA) is presented to solve various optimization problems. The main idea in designing the TOA is to simulate the teamwork behaviors of the members of a team in order to achieve their desired goal. The TOA is mathematically modeled for usability in solving optimization problems. The capability of the TOA in solving optimization problems is evaluated on a set of twenty-three standard objective functions. Additionally, the performance of the proposed TOA is compared with eight well-known optimization algorithms in providing a suitable quasi-optimal solution. The results of optimization of objective functions indicate the ability of the TOA to solve various optimization problems. Analysis and comparison of the simulation results of the optimization algorithms show that the proposed TOA is superior and far more competitive than the eight compared algorithms. [ABSTRACT FROM AUTHOR]

There are many optimization problems in the different disciplines of science that must be solved using the appropriate method. Population-based optimization algorithms are one of the most efficient ways to solve various optimization problems. Population-based optimization algorithms are able to provide appropriate solutions to optimization problems based on a random search of the problem-solving space without the need for gradient and derivative information. In this paper, a new optimization algorithm called the Group Mean-Based Optimizer (GMBO) is presented; it can be applied to solve optimization problems in various fields of science. The main idea in designing the GMBO is to use more effectively the information of different members of the algorithm population based on two selected groups, with the titles of the good group and the bad group. Two new composite members are obtained by averaging each of these groups, which are used to update the population members. The various stages of the GMBO are described and mathematically modeled with the aim of being used to solve optimization problems. The performance of the GMBO in providing a suitable quasi-optimal solution on a set of 23 standard objective functions of different types of unimodal, high-dimensional multimodal, and fixed-dimensional multimodal is evaluated. In addition, the optimization results obtained from the proposed GMBO were compared with eight other widely used optimization algorithms, including the Marine Predators Algorithm (MPA), the Tunicate Swarm Algorithm (TSA), the Whale Optimization Algorithm (WOA), the Grey Wolf Optimizer (GWO), Teaching–Learning-Based Optimization (TLBO), the Gravitational Search Algorithm (GSA), Particle Swarm Optimization (PSO), and the Genetic Algorithm (GA). The optimization results indicated the acceptable performance of the proposed GMBO, and, based on the analysis and comparison of the results, it was determined that the GMBO is superior and much more competitive than the other eight algorithms. [ABSTRACT FROM AUTHOR]

Optimization seeks to find inputs for an objective function that result in a maximum or minimum. Optimization methods are divided into exact and approximate (algorithms). Several optimization algorithms imitate natural phenomena, laws of physics, and behavior of living organisms. Optimization based on algorithms is the challenge that underlies machine learning, from logistic regression to training neural networks for artificial intelligence. In this paper, a new algorithm called two-stage optimization (TSO) is proposed. The TSO algorithm updates population members in two steps at each iteration. For this purpose, a group of good population members is selected and then two members of this group are randomly used to update the position of each of them. This update is based on the first selected good member at the first stage, and on the second selected good member at the second stage. We describe the stages of the TSO algorithm and model them mathematically. Performance of the TSO algorithm is evaluated for twenty-three standard objective functions. In order to compare the optimization results of the TSO algorithm, eight other competing algorithms are considered, including genetic, gravitational search, grey wolf, marine predators, particle swarm, teaching-learning-based, tunicate swarm, and whale approaches. The numerical results show that the new algorithm is superior and more competitive in solving optimization problems when compared with other algorithms. [ABSTRACT FROM AUTHOR]