Search

This review aims to exploit a study on different benchmark test functions used to evaluate the performance of Meta-Heuristic (MH) optimization techniques. The performance of the MH optimization techniques is evaluated with the different sets of mathematical benchmark test functions and various real-world engineering design problems. These benchmark test functions can help to identify the strengths and weaknesses of newly proposed MH optimization techniques. This review paper presents 215 mathematical test functions, including mathematical equations, characteristics, search space and global minima of the objective function and 57 real-world engineering design problems, including mathematical equations, constraints, and boundary conditions of the objective functions carried out from the literature. The MATLAB code references for mathematical benchmark test functions and real-world design problems, including the Congress of Evolutionary Computation (CEC) and Genetic and Evolutionary Computation Conference (GECCO) test suite, are presented in this paper. Also, the winners of CEC are highlighted with their reference papers. This paper also comprehensively reviews the literature related to benchmark test functions and real-world engineering design challenges using a bibliometric approach. This bibliometric analysis aims to analyze the number of publications, prolific authors, academic institutions, and country contributions to assess the field's growth and development. This paper will inspire researchers to innovate effective approaches for handling inequality and equality constraints. [ABSTRACT FROM AUTHOR]

The necessity of employing renewable energy sources within microgrid-based Power-to-X (P2X) systems has been emphasized by the imperatives of reducing global warming and fossil fuel consumption. Due to their numerous advantages, solar and wind energy have acquired prominence in contemporary power systems. However, their intermittent nature presents challenges. To overcome these challenges, energy storage devices are utilized. Batteries, however, are plagued by issues such as high maintenance needs, self-discharge, and diminishing storage capacity with age. Consequently, investigating alternatives such as hydrogen storage has become a financially viable option, especially for high-power applications. However, the intrinsically slow dynamics of hydrogen production from electricity contrast with the rapid responses of contemporary power electronic devices. This paper presents a versatile technique for optimizing hydrogen production in the presence of stochastic fluctuations in solar irradiance and wind speed. The proposed method combines a modified version of the Symbiotic Differential Whale Optimization Algorithm (m-SDWOA) with power converters to maximize production from renewable sources and electrolyzers. Using extensive simulations to demonstrate the efficacy of the proposed method by comparing its performance to that of the Whale Optimization Algorithm (WOA) and Particle Swarm Optimization (PSO). The results demonstrate the superior performance of the m-SDWOA-integrated method and pave the way for improved hydrogen generation in microgrid-based P2X systems. • Innovative control framework coordinates WT, PV, BESS, and HESS. • Maximizes hydrogen production while maintaining power quality. • Efficient controllers stabilize DC-bus voltage amidst WT/PV variability. • Ensures consistent, reliable power supply in microgrid. • Efficient energy management via m-SDWOA for resource optimization. [ABSTRACT FROM AUTHOR]

This paper provides six metaheuristic algorithms, namely Fast Cuckoo Search (FCS), Salp Swarm Algorithm (SSA), Dynamic control Cuckoo search (DCCS), Gradient-Based Optimizer (GBO), Northern Goshawk Optimization (NGO), Opposition Flow Direction Algorithm (OFDA) to efficiently solve the optimal power flow (OPF) issue. Under standard and conservative operating settings, the OPF problem is modeled utilizing a range of objectives, constraints, and formulations. Five case studies have been conducted using IEEE 30-bus and IEEE 118-bus standard test systems to evaluate the effectiveness and robustness of the proposed algorithms. A performance evaluation procedure is suggested to compare the optimization techniques' strength and resilience. A fresh comparison methodology is created to compare the proposed methodologies with other well-known methodologies. Compared to previously reported optimization algorithms in the literature, the obtained results show the potential of GBO to solve various OPF problems efficiently. [ABSTRACT FROM AUTHOR]

Using Hybrid optimization algorithms for nonlinear systems analysis is a novel approach. It is a powerful technique that uses the exploitation ability of one algorithm and the exploration ability of another algorithm, to find the best solution. Literature survey reveals that hybrid algorithms not only show quality response but also give faster convergence of error for nonlinear systems. In this paper, hybrid optimization techniques based proportional integral derivative (PID) controller is used for benchmark problems: Continuous stirred tank reactor (CSTR), Inverted pendulum and blood glucose system. Two recent hybrid algorithms: Particle swarm optimization‐Gravitational search algorithm (PSO‐GSA) and Particle swarm optimization‐Grey wolf algorithm (PSO‐GWO) are implemented to control the temperature and concentration of CSTR, pendulum angle of inverted pendulum, glucose concentration and insulin level of blood glucose system. In PID and PSOGWO algorithms, the exploration abilities of GSA and GWO combined with the exploitation ability of PSO have been used. The performance of these algorithms is then compared with individual PSO, GSA, and GWO algorithms proving their superiority. Stability is ensured using the Lyapunov approach while the robustness of the systems is checked using the parameter perturbation technique. Simulation results show substantial improvement in the performance of these systems by using these meta‐heuristic hybrid optimization techniques. A comparative analysis of these algorithms has also been done. [ABSTRACT FROM AUTHOR]

This article develops two metaheuristics optimization techniques, Grey Wolf Optimizer (GWO) and Harris Hawks Optimization (HHO), to handle multi-objective optimal power flow (MOOPF) issues. Multi Objective GWO (MOGWO) and Multi Objective HHO (MOHHO) are the names of the developed techniques. By combining these optimization techniques with Pareto techniques, the non-dominated solution set can be obtained. These developed approaches are characterized by simplicity and have few control parameters. Fuel cost, emissions, real power losses, and voltage deviation were the four objective functions considered. The theories used to determine the best compromise solution and organize the Pareto front options are the fuzzy membership equation and the crowding distance approach, respectively. To validate and evaluate the performance of the presented techniques, two standard IEEE bus systems—30-bus and 57-bus power systems—were proposed. Bi, Tri, and Quad objective functions with 21 case studies are the types of objective functions and the scenarios that were applied in this paper. As compared to the results of the most recent optimization techniques documented in the literature, the comparative analysis results for the proposed methodologies demonstrated the superiority and robustness of MOGWO and MOHHO. [ABSTRACT FROM AUTHOR]

This paper presents an improved arithmetic optimization algorithm that incorporates hybrid elite pool strategies to address the limitations of the arithmetic optimization algorithm (AOA). In AOA, the linear mathematical optimization acceleration (MOA) function cannot balance global exploitation and local exploration well. Therefore, the accuracy and convergence speed of the algorithm cannot be guaranteed. To improve the performance of AOA, this paper reconstructed a nonlinear MOA function, which is expected to balance the exploitation and the exploration of AOA. Furthermore, four hybrid elite pool strategies are integrated to enhance the ability to escape local optima. The proposed algorithm inherits the fast convergence of AOA and develops the performance of escaping local optima. Numerical experiment results on benchmark functions and engineering problems show that the proposed algorithm outperforms other compared meta-heuristic algorithms in terms of convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

A multi-modal search space can be defined as having multiple attraction basins - each basin has a single local optimum which is reached from all points in that basin when greedy local search is used. Optimization in multi-modal search spaces can then be viewed as a two-phase process. The first phase is exploration in which the most promising attraction basin is identified. The second phase is exploitation in which the best solution (i.e. the local optimum) within the previously identified attraction basin is attained. The goal of thresheld convergence is to improve the performance of search techniques during the first phase of exploration. The effectiveness of thresheld convergence has been demonstrated through applications to existing metaheuristics such as particle swarm optimization and differential evolution, and through the development of novel metaheuristics such as minimum population search and leaders and followers. [ABSTRACT FROM AUTHOR]

Several optimization-based population search methods have been proposed; they use various operators that permit exploring the search space. These methods typically suffer from local search (LS) problems and are unbalanced between exploration and exploitation. Consequently, recent researchers sought to modify the algorithms to avoid search problems using local search techniques to intensify the exploitation when is necessary. This paper proposes a novel single-based local search optimization algorithm called the non-monopolize search (NO). The NO is a single-solution metaphor-free algorithm, and its operators are designed based to explore and exploit along the iterative process. The NO works only with a candidate solution, and the operators modify the dimension to move the current solution along the search space. The NO is an effective LS method that combines the benefits of exploration with exploitation. Different from other LS, the NO can escape from suboptimal solutions thanks to the randomness incorporated into its operators. This is the main advantage of the NO. Experiments are conducted on standard benchmark functions to validate the performance of the proposed non-monopolize search optimization technique. The results are compared with other well-known methods, and the proposed NO got better results. Moreover, the proposed NO can be considered a powerful alternative to improve the optimization algorithms' performance and help avoid local search problems. Source codes of NO are publicly available at https://www.mathworks.com/matlabcentral/fileexchange/156154-the-non-monopolize-search-no. [ABSTRACT FROM AUTHOR]

The built environment is a significant contributor to global energy consumption and greenhouse gas emissions. Advancements in the adoption of environmentally friendly building technology have become crucial in promoting sustainable development. These advancements play a crucial role in conserving energy. The aim is to achieve an optimal design by balancing various interrelated factors. The emergence of innovative techniques to address energy conservation have been witnessed in the built environment. This review examines existing research articles that explore different metaheuristic optimization techniques (MOTs) for energy conservation in buildings. The focus is on evaluating the simplicity and stochastic nature of these optimization techniques. The findings of the review present theoretical and mathematical models for each algorithm and assess their effectiveness in problem solving. A systematic analysis of selected algorithms using MOT is conducted, considering factors that influence wellbeing, occupant health, and indoor environmental quality. The study examines the variations among swarm intelligence MOTs based on complexity, advantages, and disadvantages. The algorithms' performances are based on the concept of uncertainty in consistently providing optimal solutions. The paper highlights the application of each technique in achieving energy conservation in buildings. [ABSTRACT FROM AUTHOR]

Teaching–learning-based optimization (TLBO) algorithm is an excellent human-inspired optimization technique. This paper proposes an innovative improved version of TLBO—collectivism teaching–learning-based optimization (CTLBO) algorithm. This algorithm imitates group and individual behaviours in the reality of teaching and learning, applies group-individual multi-mode cooperation strategies to form new search mechanism. The CTLBO contains three phases, i.e. preparation phase, teaching and learning phases. In the preparation phase, there are two operators, i.e. teacher self-learning and teacher-learner interaction operators. In the teaching phase, class teaching and performance-based group teaching operators are implied. In the learning phase, neighbour learning, student self-learning and team-learning strategies are mixed together to form three operators. Two sets of experiments are conducted to test the performance of CTLBO. The first set of experiments validates the improvement effect of CTLBO by comparing it with the original TLBO and other authors' improved versions of TLBO. The second set of experiments illustrates the advantage of CTLBO by comparing it with other 17 meta-heuristic algorithms in solving 30 general benchmark functions and 15 CEC2015 test suit functions. The results of experiments show that CTLBO algorithm has significant improvement effect compared with TLBO. It is the most effective one amongst the improved versions of TLBO selected for comparison, and outperforms all other 17 meta-heuristic algorithms. The algorithm can significantly improve the convergence ability and the accuracy in solving different-scale complex optimization models. [ABSTRACT FROM AUTHOR]

Algorithms for machine learning have found extensive use in numerous fields and applications. One important aspect of effectively utilizing these algorithms is tuning the hyperparameters to match the specific task at hand. The selection and configuration of hyperparameters directly impact the performance of machine learning models. Achieving optimal hyperparameter settings often requires a deep understanding of the underlying models and the appropriate optimization techniques. While there are many automatic optimization techniques available, each with its own advantages and disadvantages, this article focuses on hyperparameter optimization for well-known machine learning models. It explores cutting-edge optimization methods such as metaheuristic algorithms, deep learning-based optimization, Bayesian optimization, and quantum optimization, and our paper focused mainly on metaheuristic and Bayesian optimization techniques and provides guidance on applying them to different machine learning algorithms. The article also presents real-world applications of hyperparameter optimization by conducting tests on spatial data collections for landslide susceptibility mapping. Based on the experiment's results, both Bayesian optimization and metaheuristic algorithms showed promising performance compared to baseline algorithms. For instance, the metaheuristic algorithm boosted the random forest model's overall accuracy by 5% and 3%, respectively, from baseline optimization methods GS and RS, and by 4% and 2% from baseline optimization methods GA and PSO. Additionally, for models like KNN and SVM, Bayesian methods with Gaussian processes had good results. When compared to the baseline algorithms RS and GS, the accuracy of the KNN model was enhanced by BO-TPE by 1% and 11%, respectively, and by BO-GP by 2% and 12%, respectively. For SVM, BO-TPE outperformed GS and RS by 6% in terms of performance, while BO-GP improved results by 5%. The paper thoroughly discusses the reasons behind the efficiency of these algorithms. By successfully identifying appropriate hyperparameter configurations, this research paper aims to assist researchers, spatial data analysts, and industrial users in developing machine learning models more effectively. The findings and insights provided in this paper can contribute to enhancing the performance and applicability of machine learning algorithms in various domains. [ABSTRACT FROM AUTHOR]

Particle swarm optimization algorithms (PSOA) is a metaheuristic algorithm used to optimize computational problems using candidate solutions or particles based on selected quality measures. Despite the extensive research published, studies that critically examine its recent scientific developments and research impact are lacking. Therefore, the publication trends and research landscape on PSOA research were examined. The Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) and bibliometric analysis techniques were applied to identify and analyze the published documents indexed in Scopus from 2001 to 2021. The published documents on PSOA increased from 8 to 1,717 (21,362.50%) due to the growing applications of PSOA in solving computational problems. "Conference papers" is the most common document type, whereas the most prolific researcher on PSOA is Andries P. Engelbrecht (South Africa). The most active affiliation (Ministry of Education) and funding organization (National Natural Science Foundation) are based in China. The research landscape on PSOA revealed high levels of publications, citations, and collaborations among the top authors, institutions, and countries worldwide. Keywords co-occurrence analysis revealed that "particle swarm optimization (PSO)" occurred more frequently than others. The findings of the study could provide researchers and policymakers with insights into the prospects and challenges of PSOA research relative to similar algorithms in the literature. [ABSTRACT FROM AUTHOR]

The convergence rate has been widely accepted as a performance measure for choosing a better metaheuristic algorithm. So, we propose a novel technique to improve the performance of the existing Grey Wolf Optimization (GWO) algorithm in terms of its convergence rate. The proposed approach also prioritizes the test cases that are obtained after executing the input benchmark programs. This paper has three technical contributions. In our first contribution, we generate test cases for the input benchmark programs. Our second contribution prioritizes test cases using an improved version of the existing GWO algorithm (CGWO). Our third contribution analyzes the obtained result and compares it with state-of-the-art metaheuristic techniques. This work is validated after running the proposed model on six benchmark programs. The obtained results show that our proposed approach has achieved 48% better APFD score for the prioritized order of test cases than the non-prioritized order. We also achieved a better convergence rate, which takes around 4000 fewer iterations, when compared with the existing methods on the same platform. [ABSTRACT FROM AUTHOR]

Circuit design plays a pivotal role in engineering, ensuring the creation of efficient, reliable, and cost-effective electronic devices. The complexity of modern circuit design problems has led to the exploration of multi-objective optimization techniques for circuit design optimization, as traditional optimization tools fall short in handling such problems. While metaheuristic algorithms, especially genetic algorithms, have demonstrated promise, their susceptibility to premature convergence poses challenges. This paper proposes a pioneering approach, the chaotic multi-objective Runge–Kutta algorithm (CMRUN), for circuit design optimization, building upon the Runge–Kutta optimization algorithm. By infusing chaos into the core RUN structure, a refined balance between exploration and exploitation is obtained, critical for addressing complex optimization landscapes, enabling the algorithm to navigate nonlinear and nonconvex optimization challenges effectively. This approach is extended to accommodate multiple objectives, ultimately generating Pareto Fronts for the multiple circuit design goals. The performance of CMRUN is rigorously evaluated against 11 multiobjective algorithms, encompassing 15 benchmark test functions and practical circuit design scenarios. The findings of this study underscore the efficiency and real-world applicability of CMRUN, offering valuable insights for tailoring optimization algorithms to the real-world circuit design challenges. [ABSTRACT FROM AUTHOR]

When the meta-heuristic algorithm solves the joint resource allocation problem of multi-beam satellites, the computational complexity increases and the algorithm is difficult to converge due to the time delay constraint and capacity constraint. This paper introduced a penalty mechanism in the objective function, and added a penalty value to the objective function of the invalid solution, so that the optimized solution adaptively satisfied these two constraints. Based on this, this paper proposed a joint resource allocation algorithm based on quantum-behaved particle swarm optimization. Simulation results show that the introduction of the penalty strategy solves the problem of difficulty in handling the delay constraint and capacity constraint when applying the meta-heuristic algorithm. The quantum-behaved particle swarm optimization algorithm with penalty mechanism outperforms the existing joint allocation algorithm in terms of allocation fairness index and total system capacity. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of the seagull optimization algorithm (SOA), which has low solution accuracy, and rela-tively poor population diversity, and is easy to trap in local optimal, this paper proposed an enhanced seagull optimization algorithm (ESOA) that integrated multiple improvement strategies. Firstly, this paper used an improved self-adaptive differential mutation strategy to perform differential mutation operation on a single seagull individual in each iteration process which could expand the global search range of seagulls and improve the diversity of the population.Secondly, it established a processing mechanism for the worst position of individual seagulls based on particle swarm algorithm.Finally, for the optimal position of the seagull, it adopted a dynamic lens mapping strategy to jump out of the local optimum for the optimal position of the seagull. This paper used 14 functions in the CEC2017 test suite as the benchmark function to compare the performance of ESOA, algorithm with sparrow search algorithm (SSA), moth-flame optimization algorithm (MFO), grey wolf optimizer (GWO), and the improved GSCSOA and CCSOA. The experimental results show that ESOA has a statistically significant performance advantage. [ABSTRACT FROM AUTHOR]

This paper represents the execution of a reliable, steady and wideband fractional order digital integrator (FODI) in respect of infinite impulse response (IIR) filter using a recent nature inspired meta-heuristic optimization technique known as mayfly optimization algorithm (MOA). MOA significantly functions stronger against some of the popular algorithms like real-coded genetic algorithm (RGA), particle swarm optimization (PSO), differential evolution (DE), improved particle swarm optimization (IPSO), whale optimization algorithm (WOA) and chaotic oppositional whale optimization algorithm (COWOA) with reference to different magnitude error performances, explanation character accuracy, convergence profile and computational time required to find the optimal solution. In this paper, the authors thoroughly analyze the convergence behavior and magnitude error metrices of the different order FODI's using WOA, COWOA and MOA. MATLAB simulation results also powerfully uphold the magnitude response efficiency and stability of the proposed different order FODI's over some recently published research papers. [ABSTRACT FROM AUTHOR]

Simulation-based metamodels or surrogate models are simplified models that capture the relationship between inputs and outputs of the simulation model. The analytical expression of metamodels is defined using a sample of input/output points obtained from the simulation model. This analytical expression is then embedded in an optimization process that usually provides solutions much faster than other simulation-based optimization techniques such as metaheuristics or mathematical modeling. The goal of this paper is to describe the simulation-based metamodeling approach and to provide a thorough review of the literature on its applications to emergency healthcare systems. For this purpose, we examine the recent literature (journals and conference proceedings) published in the last 15 years (2008–2022). Finally, we identify findings and avenues of research in simulation-based metamodeling that deserve special attention from the scientific community and allow the potential of this approach to be used for better decision-making in emergency healthcare. [ABSTRACT FROM AUTHOR]

The pursuit of achieving total power network observability in smart grids using Phasor Measurement Units (PMUs) carries a significant promise of real-time Wide-Area Monitoring, Protection, and Control (WAMPAC). PMU applications eliminate periodical measurements, thereby increasing accuracy through a high sampling rate of the measured power systems quantities. The high costs of installation of PMUs for total power system observability presents a challenge in the implementation of PMUs. This is due to the expensive costs of PMU devices. This has led to a prominent optimal PMU placement (OPP) problem that researchers tirelessly aim to solve by ensuring a complete power network observability while using the least installed PMU devices possible. In this paper, a novel Binary Firefly Algorithm (BFA) based on the node degree centrality scores of each bus is proposed to minimize PMU installations. The BFA solves the OPP problem in consideration of the effect of Zero Injection Buses (ZIBs) under normal operation and single PMU outage (SPO). The robustness and efficiency of the proposed algorithm is tested on IEEE-approved test systems and visualized with a force-directed technique on an undirected power network graph. The proposed BFA yields the same but better optimal PMU numbers, obtained by existing meta-heuristic optimization techniques found in the literature for each of the IEEE test cases, as well as highlighting the cost–benefit of having a robust system against single PMU loss while considering the ZIB effect for an improved system measurement availability. [ABSTRACT FROM AUTHOR]

The equilibrium optimizer (EO) is a recently developed physics-based optimization technique for complex optimization problems. Although the algorithm shows excellent exploitation capability, it still has some drawbacks, such as the tendency to fall into local optima and poor population diversity. To address these shortcomings, an enhanced EO algorithm is proposed in this paper. First, a spiral search mechanism is introduced to guide the particles to more promising search regions. Then, a new inertia weight factor is employed to mitigate the oscillation phenomena of particles. To evaluate the effectiveness of the proposed algorithm, it has been tested on the CEC2017 test suite and the mobile robot path planning (MRPP) problem and compared with some advanced metaheuristic techniques. The experimental results demonstrate that our improved EO algorithm outperforms the comparison methods in solving both numerical optimization problems and practical problems. Overall, the developed EO variant has good robustness and stability and can be considered as a promising optimization tool. [ABSTRACT FROM AUTHOR]

Sliding-mode control (SMC) is a robust technique used in power electronics (PE) for controlling the behavior of power converters. This paper presents simulations and experimental results of an optimal SMC strategy applied to Semi-Bridgeless Boost Converters (SBBC), which includes Power Factor Correction (PFC). As the main contribution, the optimal coefficients of the SMC strategy are obtained using two metaheuristic approaches, namely the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). The main objective is to obtain the sliding coefficients that ensure the best converter response in terms of the input current and output voltage, both during start-up and under disturbances (including changes in load, source, and references). The fitness function to be minimized includes two coefficients, namely the Integrative Absolute Error (IAE) and the Integral Time Absolute Error (ITAE), for both the input current and output voltage. These coefficients measure the converter's effort to follow the control references. The IAE penalizes errors during start-up, whereas the ITAE penalizes errors in the steady state. The tests carried out demonstrated the effectiveness of the GA and PSO techniques in the optimization process; nonetheless, the GA outperformed the PSO approach, providing sliding coefficients that allowed for a reduction in the input current overshoot during start-up of up to 24.15% and a reduction in the setting time of the output voltage of up to 99%. The experimental results were very similar when tuning with the GA and PSO techniques; nevertheless, tuning with the GA technique produced a better response in the face of disturbances compared to the PSO technique. [ABSTRACT FROM AUTHOR]

The wireless sensor network (WSN) is an essential technology of the Internet of Things (IoT) but has the problem of low coverage due to the uneven distribution of sensor nodes. This paper proposes a novel enhanced whale optimization algorithm (WOA), incorporating Lévy flight and a genetic algorithm optimization mechanism (WOA-LFGA). The Lévy flight technique bolsters the global search ability and convergence speed of the WOA, while the genetic optimization mechanism enhances its local search and random search capabilities. WOA-LFGA is tested with 29 mathematical optimization problems and a WSN coverage optimization model. Simulation results demonstrate that the improved algorithm is highly competitive compared with mainstream algorithms. Moreover, the practicality and the effectiveness of the improved algorithm in optimizing wireless sensor network coverage are confirmed. [ABSTRACT FROM AUTHOR]

The Arithmetic Optimization Algorithm (AOA) is a meta-heuristic algorithm inspired by mathematical operators, which may stagnate in the face of complex optimization issues. Therefore, the convergence and accuracy are reduced. In this paper, an AOA variant called ASFAOA is proposed by integrating a double-opposite learning mechanism, an adaptive spiral search strategy, an offset distribution estimation strategy, and a modified cosine acceleration function formula into the original AOA, aiming to improve the local exploitation and global exploration capability of the original AOA. In the proposed ASFAOA, a dual-opposite learning strategy is utilized to enhance population diversity by searching the problem space a lot better. The spiral search strategy of the tuna swarm optimization is introduced into the addition and subtraction strategy of AOA to enhance the AOA's ability to jump out of the local optimum. An offset distribution estimation strategy is employed to effectively utilize the dominant population information for guiding the correct individual evolution. In addition, an adaptive cosine acceleration function is proposed to perform a better balance between the exploitation and exploration capabilities of the AOA. To demonstrate the superiority of the proposed ASFAOA, two experiments are conducted using existing state-of-the-art algorithms. First, The CEC 2017 benchmark function was applied with the aim of evaluating the performance of ASFAOA on the test function through mean analysis, convergence analysis, stability analysis, Wilcoxon signed rank test, and Friedman's test. The proposed ASFAOA is then utilized to solve the wireless sensor coverage problem and its performance is illustrated by two sets of coverage problems with different dimensions. The results and discussion show that ASFAOA outperforms the original AOA and other comparison algorithms. Therefore, ASFAOA is considered as a useful technique for practical optimization problems. [ABSTRACT FROM AUTHOR]

Archimedes optimization algorithm (AOA) is a new meta-heuristic algorithm which is based on Archimedes principle and mimics the buoyancy force received by an object in water. The AOA is designed according to physical principles and has been the object of many scholars' research because of its simple and reliable performance. In the course of the study, this paper finds that the AOA is flawed. In the iterative update of the algorithm, the buoyancy principle applied to the object is not completely followed. Through the investigation and analysis of this problem, it is found that the algorithm design which follows the buoyancy principle completely is more advantageously and persuasively, and named the corrected algorithm CAOA. The performance of the CAOA and other comparison optimization algorithms is tested in benchmark functions CEC2017 under equal conditions to verify the ideas proposed in this paper. In the solution accuracy with dimensions of 30 and 50, the comprehensive score of the CAOA is 31 and 33 and ranks first in all algorithms. In the statistical analysis, the CAOA compared with other algorithms one by one, and achieved the best results in all test functions. When compared with other algorithms, the CAOA ranked first. It is hoped that the verification of the ideas in this paper will help the AOA to develop better and optimize the development of the algorithm. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) are a fundamental component of intelligent transportation systems in smart cities. With the support of open and real-time data, these networks of inter-connected vehicles constitute an 'Internet of vehicles' with the potential to significantly enhance citizens' mobility and last-mile delivery in urban, peri-urban, and metropolitan areas. However, the proper coordination and logistics of VANETs raise a number of optimization challenges that need to be solved. After reviewing the state of the art on the concepts of VANET optimization and open data in smart cities, this paper discusses some of the most relevant optimization challenges in this area. Since most of the optimization problems are related to the need for real-time solutions or to the consideration of uncertainty and dynamic environments, the paper also discusses how some VANET challenges can be addressed with the use of agile optimization algorithms and the combination of metaheuristics with simulation and machine learning methods. The paper also offers a numerical analysis that measures the impact of using these optimization techniques in some related problems. Our numerical analysis, based on real data from Open Data Barcelona, demonstrates that the constructive heuristic outperforms the random scenario in the CDP combined with vehicular networks, resulting in maximizing the minimum distance between facilities while meeting capacity requirements with the fewest facilities. [ABSTRACT FROM AUTHOR]

Unconstrained continuous large-scale global optimization (LSGO) is still a challenging task for a wide range of modern metaheuristic approaches. A cooperative coevolution approach is a good tool for increasing the performance of an evolutionary algorithm in solving high-dimensional optimization problems. However, the performance of cooperative coevolution approaches for LSGO depends significantly on the problem decomposition, namely, on the number of subcomponents and on how variables are grouped in these subcomponents. Also, the choice of the population size is still an open question for population-based algorithms. This paper discusses a method for selecting the number of subcomponents and the population size during the optimization process ("on fly") from a predefined pool of parameters. The selection of the parameters is based on their performance in the previous optimization steps. The main goal of the study is the improvement of coevolutionary decomposition-based algorithms for solving LSGO problems. In this paper, we propose a novel self-adapt evolutionary algorithm for solving continuous LSGO problems. We have tested this algorithm on 15 optimization problems from the IEEE LSGO CEC'2013 benchmark suite. The proposed approach, on average, outperforms cooperative coevolution algorithms with a static number of subcomponents and a static number of individuals. [ABSTRACT FROM AUTHOR]

A vital subject of engineering structures is mechanical oscillations. If the mechanical oscillation is uncontrolled, it can lead to structural failure due to large dynamic stresses developed, as the collapse occurred on the Broughton Suspension bridge due to soldiers walking in step. This paper addresses mechanical oscillation problems employing a proposed modified variant of coyote optimizer. Coyote optimization algorithm (COA) is a new meta-heuristic which mimics the social behavior of coyotes. COA suffers with stagnation problems and immature convergence while solving optimization problems. In this paper, the COA is hybridized with Laplace Crossover operator and new culture tendency strategies are adapted, modified variants of coyote optimization algorithm (MvCOA). The proposed MvCOA is presented to approximately solve mechanical oscillation problems independently of their order, form, and stated conditions. With the fundamental concepts of ordinary differential equations and Fourier series expansion, mechanical oscillation problems can be modeled as a problem of optimization whereby the optimization task is achieved using the proposed MvCOA. Five different ordinary differential equations and four mechanical oscillation problems are solved approximately and then compared with their corresponding exact solutions. The statistical analysis validates that the presented MvCOA is an effective algorithm for different optimization problems. However, from the empirical results, it is visible that the suggested MvCOA approximate approach was able to reach a successful performance solving different mechanical oscillation problems. [ABSTRACT FROM AUTHOR]

The hybrid optimization of modern cementitious materials requires concrete to meet many competing objectives (e.g., mechanical properties, cost, workability, environmental requirements, and durability). This paper reviews the current literature on optimizing mixing ratios using machine learning and metaheuristic optimization algorithms based on past studies on varying methods. In this review, we first discuss the conventional methods for mixing optimization of cementitious materials. Then, the problem expression of hybrid optimization is discussed, including decision variables, constraints, machine learning algorithms for modeling objectives, and metaheuristic optimization algorithms for searching the best mixture ratio. Finally, we explore the development prospects of this field, including, expanding the database by combining field data, considering more influencing variables, and considering more competitive targets in the production of functional cemented materials. In addition, to overcome the limitation of the swarm intelligence-based multi-objective optimization (MOO) algorithm in hybrid optimization, this paper proposes a new MOO algorithm based on individual intelligence (multi-objective beetle antenna search algorithm). The development of computationally efficient robust MOO models will continue to make progress in the field of hybrid optimization. This review is adapted for engineers and researchers who want to optimize the mixture proportions of cementitious materials using machine learning and metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

Inspired by cloud computing, cloud manufacturing (CMfg) is a service-oriented manufacturing paradigm on an on-demand and pay-as-you-go business model through the internet. More specifically, new challenges for production planning and decision-making process have emerged in that resource scheduling and have gained the most attention, and there is an urgent need to determine the current status and identify issues and matters to be addressed in the future. This review paper is aiming to discuss aspects of the cloud-based resource scheduling problem through investigating the literature to date to identify the existing gaps and recommending the potential paths moving forward for researchers in this field. So far, literature reviews focused on a broad scope of cloud-based scheduling, as a new approach taking a "narrow scope" by focusing on resource scheduling and various steps of it in the cloud environment are considered. Using the data gathered from the popular databases, a comprehensive statistical analysis on the existing literatures is provided, and the rational sequences of the systematic literature review (SLR) are elaborated. The mathematical models in resource scheduling are thoroughly elucidated. Then, a comprehensive analysis of the main aspects of resource scheduling including the objective functions, constraints, and optimization algorithms is presented. Discussion of the findings of the review paper illustrates that time and cost gain more attention (almost 80%) among all objective functions, and the metaheuristic algorithms are the most widely used in the recent research papers. Finally, suggestions for potential future research to further consolidate this field have been enumerated. [ABSTRACT FROM AUTHOR]

Human facial analysis (HFA) has recently become an attractive topic for computer vision research due to technological progress and mobile applications. HFA explores several issues as gender recognition (GR), facial expression, age, and race recognition for automatically understanding social life. This study explores HFA from the angle of recognizing a person's gender from their face. Several hard challenges are provoked, such as illumination, occlusion, facial emotions, quality, and angle of capture by cameras, making gender recognition more difficult for machines. The Archimedes optimization algorithm (AOA) was recently designed as a metaheuristic-based population optimization method, inspired by the Archimedes theory's physical notion. Compared to other swarm algorithms in the realm of optimization, this method promotes a good balance between exploration and exploitation. The convergence area is increased By incorporating extra data into the solution, such as volume and density. Because of the preceding benefits of AOA and the fact that it has not been used to choose the best area of the face, we propose utilizing a wrapper feature selection technique, which is a real motivation in the field of computer vision and machine learning. The paper's primary purpose is to automatically determine the optimal face area using AOA to recognize the gender of a human person categorized by two classes (Men and women). In this paper, the facial image is divided into several subregions (blocks), where each area provides a vector of characteristics using one method from handcrafted techniques as the local binary pattern (LBP), histogram-oriented gradient (HOG), or gray-level co-occurrence matrix (GLCM). Two experiments assess the proposed method (AOA): The first employs two benchmarking datasets: the Georgia Tech Face dataset (GT) and the Brazilian FEI dataset. The second experiment represents a more challenging large dataset that uses Gallagher's uncontrolled dataset. The experimental results show the good performance of AOA compared to other recent and competitive optimizers for all datasets. In terms of accuracy, the AOA-based LBP outperforms the state-of-the-art deep convolutional neural network (CNN) with 96.08% for the Gallagher's dataset. [ABSTRACT FROM AUTHOR]

In this paper, a new Modified Meta-Heuristic algorithm is proposed. This method contains some modifications to improve the performance of the simulated-annealing algorithm (SA). Most authors who deal with improving the SA algorithm presented some improvements and modifications to one or more of the five standard features of the SA algorithm. In this paper, we improve the SA algorithm by presenting some suggestions and modifications to all five standard features of the SA algorithm. Through these suggestions and modifications, we obtained a new algorithm that finds the approximate solution to the global minimum of a non-convex function. The new algorithm contains novel parameters, which are updated at each iteration. Therefore, the variety and alternatives in choosing these parameters demonstrated a noticeable impact on the performance of the proposed algorithm. Furthermore, it has multiple formulas by which the candidate solutions are generated. Diversity in these formulas helped the proposed algorithm to escape a local point while finding the global minimizer of a non-convex function. The efficiency of the proposed algorithm is reported through extensive numerical experiments on some well-known test problems. The performance profiles are used to evaluate and compare the performance of our proposed algorithm against the other five meta-heuristic algorithms. The comparison results between the performance of our suggested algorithm and the other five algorithms indicate that the proposed algorithm is competitive with, and in all cases superior to, the five algorithms in terms of the efficiency, reliability, and effectiveness for finding the global minimizers of non-convex functions. This superiority of the new proposed algorithm is due to those five modified standard features. [ABSTRACT FROM AUTHOR]

This paper presents a Chaos–Infused Moth–Flame Optimizer (CI-MFO). The parent algorithm is modified to account for deviations in search agent (moth) flight trajectory and variations in the flame orientation for an enhanced balance between exploration and exploitation tendencies. Actual photographic evidence showing light traces of such phototactic moths in-flight has been used to model flight path deviations using Chaos Theory. This approach considers their intelligence and erratic flight behavior (when subjected to excessive crowding). The performance of the developed CI-MFO algorithm is investigated comprehensively using a suite of fifty-eight benchmarking functions, including seven unimodal, six multimodal, ten fixed-dimension multimodal, six CEC-2005 hybrid-composite, and twenty-nine CEC-2017 hybrid-composite functions. The proposed algorithm's effectiveness is tested against several classical algorithms and some modified metaheuristic optimization algorithms in terms of obtained mean optima and standard deviations, and scalability analysis is also performed. The paper concludes by solving several real-world problems and comparing the proposed algorithm's performance against several reported algorithms. The proposed algorithm exhibited a substantially better solution-finding ability. [ABSTRACT FROM AUTHOR]

• Importance and challenges of relay coordination in Microgrid. • Overview of different adaptive schemes opted for relay coordination. • Different optimization techniques which have been used for the calculation of relay settings. • Evolvement of algorithms from conventional to Hybrid methods which combines two different metaheuristic methods to solve a complex, non- linear optimization problem in an efficient way for optimized relay coordination. • Future directions of research for further modifications possible in Algorithms are stated at the end. Concept of microgrids (MGs) have gained significant attention in order to enhance the resilience and efficiency of modern Power Systems. MG offers bi-directional power flow so an effective protection and control becomes a vital requirement to ensure the reliable operation of MGs. Relay coordination being an integral part of the protection system, plays a critical role in prevention of power disturbances and equipment damage due to the presence of bi-directional power flow. This review paper focuses on the optimization of relay coordination in MGs, and highlights the importance of adaptive and intelligent approaches involved for the efficacy of MG operation. This paper overviews different schemes used to adapt while determining the DOCRs settings with different contingencies considered. The paper depicts the key challenges associated with relay coordination in MGs; varying fault currents, and bidirectional power flows. To overcome these challenges, recent researches have explored advanced techniques that includes intelligent algorithms to operate on collected real-time data. Additionally, the impact of communication technologies for relay coordination in real-time has been discussed for Grid connected and Islanded mode of operation. This review covers a wide range of optimization methods such as; Traditional, Meta-Heuristic, and Hybrid algorithms, which allows adaptive and reliable protection schemes during different modes of MG operations. [ABSTRACT FROM AUTHOR]

Accurate parameter identification plays an integral role in the modeling of an optimized solar module which in turn helps in the error-free prediction of its output. Five important parameters: the photoelectric current (Iph), ideality factor(α), saturation current (Io), series resistance (Rs), and shunt resistance (Rsh) are required for the accurate modeling of the PV cells/modules and need to be extracted as these parameters are not provided by the manufacturer in the datasheet. This paper proposes a new metaheuristic jellyfish optimization (JFO) algorithm for the parameter extraction of a solar module. The JFO algorithm achieves the optimal solution without being trapped in local solutions in less time. The parameter extraction using the JFO algorithm is done on two different solar modules i.e., Soltech-1STH-215P and PWP-201. The results are compared in terms of extracted parameters (Iph, α, Io, Rs, and Rsh) with the well-known optimization techniques like PSO, GA, and others available in the literature and with the manufacturer I–V and P–V characteristics. The proposed technique I–V and P–V characteristics are validated at different environmental conditions and are found to be similar to that of PSO and GA. It is also observed that the extracted parameters obtained using JFO are comparable with the other twenty-two techniques, and the proposed technique is one of the highly efficient techniques that can be utilized for parameter extraction of PV modules and to predict solar cell characteristics for all commercial modules without setting up any experimental measurements. MATLAB/simulation software is used for implementation and performance validation. [ABSTRACT FROM AUTHOR]

In recent years, many studies have been used in feed-forward neural network (FNN) to develop decision-making systems. The primary objective is to get the least error by finding the best combination of control parameters. It has been observed that FNNs using meta-heuristics techniques always converges very quickly towards the optimal positions but suffers from slow searching speeds at later stages of generation. Due to slow convergence, it is a prevalent phenomenon that traditional optimization does not ensure to find global optima. As a result, it falls under local optima. Recently, another meta-heuristic optimization-based algorithm called sine cosine algorithms (SCA) was introduced to solve the aforementioned issues. The algorithm is fundamentally predicated on two trigonometric functions, one being sine and the other being cosine. However, like other traditional approaches, SCA has a tendency to be stuck in sub-optimal regions due to poor exploration and exploitation capabilities. This paper proposes an improved version of SCA named chaotic oppositional SCA (COSCA) by integrating with chaos theory and oppositional based learning into the SCA optimization process. It is an incipient training method employed to train an FNN. Three benchmark problems are used to examine the precision and performance of FNNs equipped with COSCA, COPSO, OSCA, SCA, PSO, and backpropagation. The experimental results showed that, relative to other meta-heuristic optimization techniques, the COSCA technique is able to improve performance. [ABSTRACT FROM AUTHOR]

Precision object handling and manipulation require the accurate positioning of industrial robots. A common practice for performing end effector positioning is to read joint angles and use industrial robot forward kinematics (FKs). However, industrial robot FKs rely on the robot Denavit–Hartenberg (DH) parameter values, which include uncertainties. Sources of uncertainty associated with industrial robot FKs include mechanical wear, manufacturing and assembly tolerances, and robot calibration errors. It is therefore necessary to increase the accuracy of DH parameter values to reduce the impact of uncertainties on industrial robot FKs. In this paper, we use differential evolution, particle swarm optimization, an artificial bee colony, and a gravitational search algorithm to calibrate industrial robot DH parameters. A laser tracker system, Leica AT960-MR, is utilized to register accurate positional measurements. The nominal accuracy of this non-contact metrology equipment is less than 3 μm/m. Metaheuristic optimization approaches such as differential evolution, particle swarm optimization, an artificial bee colony and a gravitational search algorithm are used as optimization methods to perform the calibration using laser tracker position data. It is observed that, using the proposed approach with an artificial bee colony optimization algorithm, the accuracy of industrial robot FKs in terms of mean absolute errors of static and near-static motion over all three dimensions for the test data decreases from its measured value of 75.4 μm to 60.1 μm (a 20.3% improvement). [ABSTRACT FROM AUTHOR]

In this paper, a novel population-based technique called dung beetle optimizer (DBO) algorithm is presented, which is inspired by the ball-rolling, dancing, foraging, stealing, and reproduction behaviors of dung beetles. The newly proposed DBO algorithm takes into account both the global exploration and the local exploitation, thereby having the characteristics of the fast convergence rate and the satisfactory solution accuracy. A series of well-known mathematical test functions (including both 23 benchmark functions and 29 CEC-BC-2017 test functions) are employed to evaluate the search capability of the DBO algorithm. From the simulation results, it is observed that the DBO algorithm presents substantially competitive performance with the state-of-the-art optimization approaches in terms of the convergence rate, solution accuracy, and stability. In addition, the Wilcoxon signed-rank test and the Friedman test are used to evaluate the experimental results of the algorithms, which proves the superiority of the DBO algorithm against other currently popular optimization techniques. In order to further illustrate the practical application potential, the DBO algorithm is successfully applied in three engineering design problems. The experimental results demonstrate that the proposed DBO algorithm can effectively deal with real-world application problems. [ABSTRACT FROM AUTHOR]

Because of the connection constraints of quantum devices, the quantum gate cannot operate directly on nonadjacent qubits. Quantum circuit mapping transforms a logical quantum circuit to a circuit that satisfies the connection constraints by adding SWAP gates for nonadjacent qubits. Global and local heuristic reordering strategies are proposed in this paper for quantum circuit mapping over linear nearest neighbor (LNN) architectures, which are one-dimensional topology structures, to reduce the number of SWAP gates added. Experiment results show that the average improvements of the two methods are 13.19% and 15.46%, respectively. In this paper, we consider the quantum circuit mapping problem for linear nearest neighbor (LNN) architectures. We propose a global heuristic qubit reordering optimization algorithm and a local heuristic qubit reordering optimization algorithm. Compared with the other algorithm results, the average improvements of the two methods for quantum cost are 13.19% and 15.46%, respectively. The two methods apply to the realization of quantum circuit neighboring over one-dimensional quantum architectures and can be extended to algorithms that work for other quantum architectures of different topologies. [ABSTRACT FROM AUTHOR]

Grasshopper optimization algorithm (GOA) is a meta-heuristic algorithm for solving optimization problems by modeling the biological habit and social behavior of grasshopper swarms in nature. Compared with other optimization algorithms, GOA still has room to improve its performance on solving complex problems. Therefore, this paper proposes an improved grasshopper optimization algorithm (EMGOA) based on dynamic dual elite learning and sinusoidal mutation. First of all, dynamic elite learning strategy is adopted to improve the influence of elites on the update process, enabling the algorithm to have a faster convergence speed. Then, sinusoidal function is utilized to guide the mutation of the current global optimal individual during each iteration to avoid the algorithm falling into the local optimum and improve the convergence accuracy of the algorithm. In order to investigate the performance of the proposed EMGOA algorithm, experiments are conducted on 26 benchmark functions and CEC2019 in this paper. The experimental results show that the optimization performance of EMGOA is obviously better than GOA, and EMGOA is competitive with six state-of-the-art meta-heuristic optimization algorithms. [ABSTRACT FROM AUTHOR]

This paper presents an approach to overcome economic load dispatch (ELD) using a metaheuristic algorithm. Economic load dispatch (ELD) is one of the most important problems in a power system, and solving it quickly is extremely important. The main problem that will be addressed in this paper is how to optimize the economy of the power grid with various operational limitations, the loss in transmission line power, and consider minimizing the fuel costs produced. In this study, some of the newest metaheuristics inspired by nature will be explored, namely Seagull Optimization Algorithm (SOA), Marine Predator Algorithm (MPA), Sine Tree-Seed Algorithm (STSA), Chimp Optimization Algorithm (ChOA), Equilibrium Optimizer (EO), and Giza Pyramids Construction (GPC). The performance appraisal of the method applied in this study was tested using 2 case studies, namely a system with 3 and 6 power system units. The results are presented by comparing between metaheuristic and mathematical methods. The experimental results is showed that the Sine Tree-Seed Algorithm (STSA) is presented the best performance with various case studies with constraints. [ABSTRACT FROM AUTHOR]

Summary: Wireless sensor networks (WSNs) plays an indispensable role in the human life by supporting a diversified number of applications that includes military, environment monitoring, manufacturing, education, agriculture, etc. However, the sensor node batteries cannot be replaced under its deployment in an unattended or remote area due to their wireless existence. Cluster‐based routing is significant in handling the issue of energy stability and network lifetime. The meta‐heuristic algorithms‐based cluster head (CH) selection is determined to be highly promising for attaining the objective of CH selection that results in acquiring an optimal network performance. In this paper, a Hybrid Grasshopper and Improved Cat Swarm Optimization Algorithm (HGICSOA)‐based clustering scheme is proposed for attaining potential CH selection and guarantee significant sink mobility‐based data transmission. The capability of GHOA that controls the rate of exploitation and exploration degree is utilized for CH selection. It specifically adopted OBL‐based GHOA for optimal CH selection based on the objective function, which is formulated using node density, residual energy, and distance between sensor node and sink. It incorporated new CSOA for mobility‐based data transmission for increasing population diversity. It also utilized the benefits of ICSOA with a predominant local search strategy for achieving better sink mobility‐based data transmission. Simulation and statistical results confirmed that the proposed HGICSOA is better in attaining maximum energy stability by 17.21% and improved network lifetime by 23.82%, compared to the benchmarked schemes used for investigation. Moreover, the prevention rate of worst sensor nodes selected as CH is improved by 21.38%, better than baseline approaches. [ABSTRACT FROM AUTHOR]

Chimp optimization algorithm (ChOA) is a meta-heuristic algorithm inspired by individual intelligence and sexual motivation during group hunting. It is designed to speed up the convergence of the optimal solution. Because of its simplicity and low computational cost, the algorithm has been widely used to solve complex global optimization problem. But in the process of searching, it is easy to fall into the local optima, and the balance between exploitation and exploration cannot be realized well. In this paper, an adaptive chimp optimization algorithm called AChOA is proposed. Firstly, the Tent chaotic map is firstly used to initialize the chimp population to obtain a better initial solutions and improve convergence precision. Secondly, adaptive non linear convergence factor and adaptive weight are introduced in the global search stage, and the parameters vary adaptively according to the number of iterations and population diversity, so as to improve the population diversity. Thirdly, the Lévy flight strategy is introduced into the position update formula to mitigate the shortcomings of ChOA algorithm, such as finding the local optima rather than the global optima, and lack of balance between the exploitation and exploration process. Finally, a comparison with 10 famous algorithms on 19 benchmark functions of the solving accuracy and convergence speed of AChOA is presented. The results show that AChOA has the advantages of fast convergence speed, high solution accuracy. [ABSTRACT FROM AUTHOR]

In classical power systems, frequency measurements are transferred via a specialised communication channel, resulting in time delay. The time delay plays a major role in a power system, which can reduce the dynamic performance of the load–frequency control (LFC) system and can destabilise the system. The research to date has tended to focus on developing a new algorithm to determine the delay margin (DM) rather than looking into a hybrid algorithm which includes a nature-inspired metaheuristic optimisation technique. This paper introduces a novel method for computing the DM based on grey wolf optimisation (GWO), specifically for the constant time delay. In the proposed method, GWO is employed to optimise the minimum error of the spectral radius and to determine the best design variable of the crossing frequency. With the help of the proposed method, the sweeping range is no longer required, which improves the accuracy of the result. To evaluate the proposed method, a two-area network power system is considered as a case study. Furthermore, the effect of the PI controller gains on the DM is taken into account. The proposed method efficacy is demonstrated by comparing it with the most recently published methods. The results demonstrate that the proposed method is remarkably better than the existing methods found in the literature, where the smallest percentage inaccuracy using the simulation-based DM based on GWO is found to be 0.000%. [ABSTRACT FROM AUTHOR]

With the rapid growth of the number of web services on the Internet, various service providers provide many similar services with the same function but different quality of service (QoS) attributes. It is a key problem to be solved urgently to select the service composition quickly, meeting the users' QoS requirements from many candidate services. Optimization of web service composition is an NP-hard issue and intelligent optimization algorithms have become the mainstream method to solve this complex problem. This paper proposed a hybrid strategy improved whale optimization algorithm, which is based on the concepts of chaos initialization, nonlinear convergence factor and mutation. By maintaining a balance between exploration and exploitation, the problem of slow or early convergence is overcome to a certain extent. To evaluate its performance more accurately, the proposed algorithm was first tested on a set of standard benchmarks. After, simulations were performed using the real quality of web service dataset. Experimental results show that the proposed algorithm is better than the original version and other meta-heuristic algorithms on average, as well as verifies the feasibility and stability of web service composition optimization. [ABSTRACT FROM AUTHOR]

In this paper, a multi-objective modified seagull optimization algorithm (MOMSOA) is proposed to handle multi-objective environmental economic power dispatch (EED) problems. The algorithm utilizes logistic map to randomize the parameter u, which increases the diversity of the algorithm and speeds up the convergence rate. Besides, the mutation operator is combined to enlarge the range of the search and to avoid falling into the local optimum. The exploration as well as exploitation capabilities for MOSOA are balanced by non-linearizing the original linear parameter A through a cosine dynamic variation strategy. Furthermore, with the assistance of a unique constraint handling approach and non-inferior sorting, MOMSOA can obtain a set of uniform Pareto optimal solution (POS). In order to verify the effectiveness of MOMSOA, experiments were conducted on diverse test systems including IEEE30-Bus, IEEE57-Bus and IEEE118-Bus test systems. During the experimental process, MOSOA and MOPSO/MODE are compared with MOMSOA. Eight trials were conducted, and optimized objective functions include fuel cost, fuel cost with valve point effect, power loss and pollution emission. The results of experiments demonstrate that the proposed MOMSOA can obtain more uniform Pareto fronts (PFs) and optimal best compromise solution (BCS). Finally, two metrics that measure the performance of multi-objective algorithms, SP and HV, are employed to evaluate the results of each algorithm, and the results reveal that solutions obtained by MOMSOA are the most uniform, with the broadest diversity and the best convergence. [ABSTRACT FROM AUTHOR]

The efficiency and the effectiveness of a machine learning (ML) model are greatly influenced by feature selection (FS), a crucial preprocessing step in machine learning that seeks out the ideal set of characteristics with the maximum accuracy possible. Due to their dominance over traditional optimization techniques, researchers are concentrating on a variety of metaheuristic (or evolutionary) algorithms and trying to suggest cutting-edge hybrid techniques to handle FS issues. The use of hybrid metaheuristic approaches for FS has thus been the subject of numerous research works. The purpose of this paper is to critically assess the existing hybrid FS approaches and to give a thorough literature review on the hybridization of different metaheuristic/evolutionary strategies that have been employed for supporting FS. This article reviews pertinent documents on hybrid frameworks that were published in the period from 2009 to 2022 and offers a thorough analysis of the used techniques, classifiers, datasets, applications, assessment metrics, and schemes of hybridization. Additionally, new open research issues and challenges are identified to pinpoint the areas that have to be further explored for additional study. [ABSTRACT FROM AUTHOR]

The artificial Gorilla Troop Optimization (GTO) algorithm (GTO) is a metaheuristic optimization algorithm that simulates the social life of gorillas. This paper proposes three innovative strategies considering the GTO algorithm's insufficient convergence accuracy and low convergence speed. First, a shrinkage control factor fusion strategy is proposed to expand the search space and reduce search blindness by strengthening the communication between silverback gorillas and other gorillas to improve global optimization performance. Second, a sine cosine interaction fusion strategy based on closeness is proposed to stabilize the performance of silverback gorillas and other gorilla individuals and improve the convergence ability and speed of the algorithm. Finally, a gorilla individual difference identification strategy is proposed to reduce the difference between gorilla and silverback gorillas to improve the quality of the optimal solution. In order to verify the optimization effect of the modified artificial gorilla troop optimization (MGTO) algorithm, we used 23 classic benchmark functions, 30 CEC2014 benchmark functions, and 10 CEC2020 benchmark functions to test the performance of the proposed MGTO algorithm. In this study, we used a total of 63 functions for algorithm comparison. At the same time, we carried out the exploitation and exploration balance experiment of 30 CEC2014 and 10 CEC2020 functions for the MGTO algorithm. In addition, the MGTO algorithm was also applied to test seven practical engineering problems, and it achieved good results. [ABSTRACT FROM AUTHOR]

In recent years, finding the optimal solution for image segmentation has become more important in many applications. The whale optimization algorithm (WOA) is a metaheuristic optimization technique that has the advantage of achieving the global optimal solution while also being simple to implement and solving many real-time problems. If the complexity of the problem increases, the WOA may stick to local optima rather than global optima. This could be an issue in obtaining a better optimal solution. For this reason, this paper recommends a hybrid algorithm that is based on a mixture of the WOA and gray wolf optimization (GWO) for segmenting the brain sub regions, such as the gray matter (GM), white matter (WM), ventricle, corpus callosum (CC), and hippocampus (HC). This hybrid mixture consists of two steps, i.e., the WOA and GWO. The proposed method helps in diagnosing Alzheimer's disease (AD) by segmenting the brain sub regions (SRs) by using a hybrid of the WOA and GWO (H-WOA-GWO, which is represented as HWGO). The segmented region was validated with different measures, and it shows better accuracy results of 92%. Following segmentation, the deep learning classifier was utilized to categorize normal and AD images. The combination of WOA and GWO yields an accuracy of 90%. As a result, it was discovered that the suggested method is a highly successful technique for identifying the ideal solution, and it is paired with a deep learning algorithm for classification. [ABSTRACT FROM AUTHOR]