Search

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]

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]

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]

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]

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]

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]

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 photovoltaic(PV) system's efficiency can be improved with the aid of effective solar PV cell modeling. However, flawed solar cell parameters affect PV cell modeling incorrectly. The manufacturers are usually not providing all the necessary data for the exact modeling of PV cells. It is therefore necessary to efficiently predict the parameters of the PV cell. The literature discusses various optimization algorithms, but the suboptimal outcomes are obtained by most of the algorithms due to their convergence toward local minima. This paper introduces a new stochastic optimization algorithm for the estimation of solar PV cell parameters. Therefore, for the evaluation of the solar cell, a new novel chaotic algorithm is introduced in this paper called the chaotic tunicate swarm algorithm (CTSA). The proposed algorithm has a new function called an outstanding mathematical model of adaptive weights to stimulate negative and positive inputs from the spreading wave in order to find the best way to connect food with an excellent exploitation tendency and exploratory ability. For the double‐diode model, the computation time of the chaotic variants (CTSA1‐1.1885, CTSA2‐1.2502, CTSA3‐1.2962, CTSA4‐1.1204, and CTSA5‐1.2214) is better than the rest of the compared algorithms (particle swarm optimization [PSO]‐17.4532, tunicate swarm algorithm (TSA)‐2.5278, Harris hawks optimization [HHO]‐10.8942, ant lion optimizer [ALO]‐15.0214, and atom search optimization [ASO]‐9.5214). For the triple‐diode model, the computation time of the chaotic variants (CTSA1‐1.2658, CTSA2‐1.3520, CTSA3‐1.3056, CTSA4‐1.2290, and CTSA5‐1.3859) is better than the rest of the compared algorithms (PSO‐18.5421, TSA‐3.2568, HHO‐9.8754, ALO‐13.5841, and ASO‐11.8412). The superiority of proposed algorithm is established using ranking test, statistical error analysis, and sensitivity temperature variation. [ABSTRACT FROM AUTHOR]

Segmentation refers to the process of dividing an image into multiple regions based on some criteria such as intensity and color. In recent years, color image segmentation has received considerable attention from the researchers. However, it is still a highly complicated task due to the presence of more attributes or components as compared to monochrome images. Numerous meta-heuristics algorithms are developed to determine the optimal threshold value for segmenting color images efficiently. This paper presents an enhanced sine cosine algorithm (ESCA) to seek threshold for segmenting color images. Sine cosine algorithm (SCA) is a population-based optimization algorithm which has the ability of preventing local minima problem. First an input image is transformed to CIE L*a*b* color reduced space. ESCA is applied to determine the optimal threshold values for segmentation. The performance of the proposed method is tested on color images from Berkeley database, and segmentation results are compared with two metaheuristic algorithms, namely particle swarm optimization (PSO) and standard SCA. Experimental results are validated by measuring peak signal–noise ratio (PSNR), structural similarity index and computation time for all the images investigated. Results revealed that the proposed method outperforms the other methods like PSO and SCA by achieving PSNR of 23 dB and SSIM of 0.93 and also require less time for finding optimal threshold values than PSO and SCA. [ABSTRACT FROM AUTHOR]

In small workshops, a more number of holes on aero engine parts are drilled successively in one process to confirm positional accuracy. Because of the fast time-varying drill wear, the surface roughness of the holes is unstable and difficult to be satisfied. To the present end, this paper presents a varying-parameter drilling (VPD) method to enhance machining efficiency and hole surface roughness for multi-hole parts manufactured from Al 7075 alloys. This method uses varying cutting parameters for every hole to adapt to the varying drill wear. The major problem of this method deceit in an optimization issue during which the optimal combination of setting of cutting parameters have to be found, with the target of the interval and also the constaint of the opening surface roughness, because sequence of cutting parameter encompasses a important aspect and therefore the surface roughness of all the holes must be guaranteed, the challenge of this optimization issue is that the strict constraint with a sophisticated non-linear boundary of the feasible zone. To cope with the convergence complexity of the searching algorithm, a metaheuristic method supported particle swarm optimization (PSO) algorithm with a self-adaptive penalty method (SAPM) is applied. The drilled hole surface roughness is predicted with a radial basis function (RBF) neural network. The various types of drill wear comprising flank wear, crater wear, chisel wear and outer corner wear are considered and the grey relational analysis (GRA) is deployed to pick the input drill wear parameters to the network. The PSO algorithms integrate with the SAPM is used to search the overall optimal solution of the optimization problem. It is found that the satisfied solutions can be searched in all the trials with the proposed metaheuristic algorithms, even though the proportion of feasible solutions is severely fluctuant during the searching process. The drilling experiment confirm that, when compared with the fixed-parameter drilling, the proposed VPD and the metaheuristic algorithm method for solving the optimization problem can effectively improve machining efficiency and surface quality for drilling Al 7075 alloy multi-hole parts. [ABSTRACT FROM AUTHOR]

This paper demonstrates a novel simple metaheuristic algorithm, the cone search (CS). This name comes from the distinct strategy of CS in searching the suboptimal solution. In the early iteration, its local search space is wide to facilitate exploration. The local search space is reduced linearly during the iteration so that the exploration changes to exploitation gradually. As a swarm intelligence, CS contains several autonomous agents and a collective intelligence called memory. This memory consists of several best solutions. In this work, CS is challenged to find the global optimal of 23 benchmark functions. In the simulation, CS is compared with four metaheuristic algorithms: particle swarm optimization (PSO), marine-predators algorithm (MPA), Komodo mlipir algorithm (KMA), and pelican optimization algorithm (POA). The result shows that CS performs well in solving these 23 functions. Moreover, it can find the global optimal of six fixeddimension multimodal functions: Branin, six hump camel, Hartman 6, Shekel 5, Shekel 7, and Goldstein price. CS beats PSO, MPA, KMA, and POA in solving 23, 22, 21, 22 functions respectively. [ABSTRACT FROM AUTHOR]

Identifying parameters in photovoltaic (PV) cell and module models is one of the primary challenges of the simulation and design of photovoltaic systems. Metaheuristic algorithms can find near-optimal solutions within a reasonable time for such challenging real-world optimization problems. Control parameters must be adjusted with many existing algorithms, making them difficult to use. In real-world problems, many of these algorithms must be combined or hybridized, which results in more complex and time-consuming algorithms. This paper presents a new artificial parameter-less optimization algorithm (APLO) for parameter estimation of PV models. New mutation operators are designed in the proposed algorithm. APLO's exploitation phase is enhanced by each individual searching for the best solution in this updating operator. Moreover, the current best, the old best, and the individual's current position are utilized in the differential term of the mutation operator to assist the exploration phase and control the convergence speed. The algorithm uses a random step length based on a normal distribution to ensure population diversity. We present the results of a comparative study using APLO and well-known existing parameter-less meta-heuristic algorithms such as grey wolf optimization, the salp swarm algorithm, JAYA, teaching-learning based optimization, colliding body optimization, as well as three major parameter-based algorithms such as differential evolution, genetic algorithm, and particle swarm optimization to estimate the parameters of PV the modules. The results revealed that the proposed algorithm could provide excellent exploration–exploitation balance and consistency during the iterations. Furthermore, the APLO algorithm shows high reliability and accuracy in identifying the parameters of PV cell models. [ABSTRACT FROM AUTHOR]

In recent years, detecting credit card fraud transactions has been a difficult task due to the high dimensions and imbalanced datasets. Selecting a subset of important features from a high-dimensional dataset has proven to be the most prominent approach for solving high-dimensional dataset issues, and the selection of features is critical for improving classification performance, such as the fraud transaction identification process. To contribute to the field, this paper proposes a novel feature selection (FS) approach based on a metaheuristic algorithm called Rock Hyrax Swarm Optimization Feature Selection (RHSOFS), inspired by the actions of rock hyrax swarms in nature, and implements supervised machine learning techniques to improve credit card fraud transaction identification approaches. This approach is used to select a subset of optimal relevant features from a high-dimensional dataset. In a comparative efficiency analysis, RHSOFS is compared with Differential Evolutionary Feature Selection (DEFS), Genetic Algorithm Feature Selection (GAFS), Particle Swarm Optimization Feature Selection (PSOFS), and Ant Colony Optimization Feature Selection (ACOFS) in a comparative efficiency analysis. The proposed RHSOFS outperforms existing approaches, such as DEFS, GAFS, PSOFS, and ACOFS, according to the experimental results. Various statistical tests have been used to validate the statistical significance of the proposed model. [ABSTRACT FROM AUTHOR]

Combined heat and power economic dispatch (CHPED) problem is one of the challenging issues in power system control, and operation, that searches for the optimal values of power and heat generation of different units to minimize the total operation cost. The interdependency of heat and power outputs of CHP units and valve point loading effects of power-only units make this problem very nonlinear and non-convex. So far, a wide variety of optimization algorithms based on simulation of various natural phenomena have been proposed and applied to solve this complex problem, claiming that the proposed algorithm is better than the similar optimization algorithms in terms of accuracy and run-time. In this paper, the CHPED problem is investigated in different case studies by using the imperialist competitive Harris hawks optimization (ICHHO) algorithm, as a combination of the imperialist competitive algorithm and Harris hawks optimization. The effectiveness of the proposed algorithm is first evaluated by testing it on the standard cases of 5, and 7 units as small-scale systems and 48-unit as the large-scale test system, considering the electrical losses. Also for the first time, the multi-zone CHPED (MZCHPED) problem is solved by a metaheuristic algorithm. The obtained results show that ICHHO algorithm reduces the operating costs in the range of 0.02–1.1%, compared to the best-reported results, in different single-zone CHPED (SZCHPED) problems. Also, the MZCHPED results, prove the effective performance of the algorithm compared to the similar SZCHPED problem. [ABSTRACT FROM AUTHOR]

A biomedical application of a novel metaheuristic optimizer is proposed in this paper by constructing an enhanced arithmetic optimization algorithm (AOA). The latter algorithm was constructed using the logarithmic spiral (Ls) search mechanism from the whale optimization algorithm and the greedy selection scheme from the differential evolution algorithm. The proposed algorithm (Ls-AOA) was tested against unimodal and multimodal benchmark functions and demonstrated better capability comparatively using other efficient metaheuristic algorithms reported in the literature. The constructed Ls-AOA algorithm was then proposed to design a proportional-integral-derivative (PID) controller employed in a functional electrical stimulation (FES) system for the first time. The initial statistical and convergence profile assessment showed better performance of the proposed algorithm. The comparative analyses for transient and frequency responses were performed for the PID-controlled FES system using the original AOA, sine–cosine and particle swarm optimization algorithms and the traditional Ziegler-Nichols tuning scheme. Similarly, the FES system tuned with the latter methods was also assessed for disturbance rejection and noise elimination. All the comparative analyses demonstrated that the proposed Ls-AOA has the greater capability for the challenging biomedical FES system. [ABSTRACT FROM AUTHOR]

Reporting the empirical results of swarm and evolutionary computation algorithms is a challenging task with many possible difficulties. These difficulties stem from the stochastic nature of such algorithms, as well as their inability to guarantee an optimal solution in polynomial time. This research deals with measuring the performance of stochastic optimization algorithms, as well as the confidence intervals of the empirically obtained statistics. Traditionally, the arithmetic mean is used for measuring average performance, but we propose quantiles for measuring average, peak and bad-case performance, and give their interpretations in a relevant context for measuring the performance of the metaheuristics. In order to investigate the differences between arithmetic mean and quantiles, and to confirm possible benefits, we conducted experiments with 7 stochastic algorithms and 20 unconstrained continuous variable optimization problems. The experiments showed that median was a better measure of average performance than arithmetic mean, based on the observed solution quality. Out of 20 problem instances, a discrepancy between the arithmetic mean and median happened in 6 instances, out of which 5 were resolved in favor of median and 1 instance remained unresolved as a near tie. The arithmetic mean was completely inadequate for measuring average performance based on the observed number of function evaluations, while the 0.5 quantile (median) was suitable for that task. The quantiles also showed to be adequate for assessing peak performance and bad-case performance. In this paper, we also proposed a bootstrap method to calculate the confidence intervals of the probability of the empirically obtained quantiles. Considering the many advantages of using quantiles, including the ability to calculate probabilities of success in the case of multiple executions of the algorithm and the practically useful method of calculating confidence intervals, we recommend quantiles as the standard measure of peak, average and bad-case performance of stochastic optimization algorithms. [ABSTRACT FROM AUTHOR]

Wireless powered communication network (WPCN) is a promising technique to resolve the power constraint issue faced by wireless nodes at the same time it also provides green and a safer solution. This paper studies, mutual sharing between WPCN and simultaneous wireless information and power transfer model where optimal resource allocation occurs between licensed/bandwidth group and an unlicensed/power group to enhance the system performance. The main aim of this paper is to maximize system weighted sum rate and minimize power consumption during transmission by optimal time allocation and energy beamforming vector allocation. These multiobjective combinatorial problems are solved using joint metaheuristic particle swarm optimization-cuckoo search algorithm to provide an optimal solution. The results are compared using a conventional mathematical optimization algorithm to set as a baseline for performance parameters. The obtained results demonstrate that the efficient joint metaheuristic approach provides a significant gain in the system performance and also offers a computationally less complex approach for solving a complicated non-convex multiobjective problem of wireless powered network. [ABSTRACT FROM AUTHOR]

The world is still trying to recover from the devastation caused by the wide spread of COVID-19, and now the monkeypox virus threatens becoming a worldwide pandemic. Although the monkeypox virus is not as lethal or infectious as COVID-19, numerous countries report new cases daily. Thus, it is not surprising that necessary precautions have not been taken, and it will not be surprising if another worldwide pandemic occurs. Machine learning has recently shown tremendous promise in image-based diagnosis, including cancer detection, tumor cell identification, and COVID-19 patient detection. Therefore, a similar application may be implemented to diagnose monkeypox as it invades the human skin. An image can be acquired and utilized to further diagnose the condition. In this paper, two algorithms are proposed for improving the classification accuracy of monkeypox images. The proposed algorithms are based on transfer learning for feature extraction and meta-heuristic optimization for feature selection and optimization of the parameters of a multi-layer neural network. The GoogleNet deep network is adopted for feature extraction, and the utilized meta-heuristic optimization algorithms are the Al-Biruni Earth radius algorithm, the sine cosine algorithm, and the particle swarm optimization algorithm. Based on these algorithms, a new binary hybrid algorithm is proposed for feature selection, along with a new hybrid algorithm for optimizing the parameters of the neural network. To evaluate the proposed algorithms, a publicly available dataset is employed. The assessment of the proposed optimization of feature selection for monkeypox classification was performed in terms of ten evaluation criteria. In addition, a set of statistical tests was conducted to measure the effectiveness, significance, and robustness of the proposed algorithms. The results achieved confirm the superiority and effectiveness of the proposed methods compared to other optimization methods. The average classification accuracy was 98.8%. [ABSTRACT FROM AUTHOR]

Data clustering is a process of arranging similar data in different groups based on certain characteristics and properties, and each group is considered as a cluster. In the last decades, several nature-inspired optimization algorithms proved to be efficient for several computing problems. Firefly algorithm is one of the nature-inspired metaheuristic optimization algorithms regarded as an optimization tool for many optimization issues in many different areas such as clustering. To overcome the issues of velocity, the firefly algorithm can be integrated with the popular particle swarm optimization algorithm. In this paper, two modified firefly algorithms, namely the crazy firefly algorithm and variable step size firefly algorithm, are hybridized individually with a standard particle swarm optimization algorithm and applied in the domain of clustering. The results obtained by the two planned hybrid algorithms have been compared with the existing hybridized firefly particle swarm optimization algorithm utilizing ten UCI Machine Learning Repository datasets and eight Shape sets for performance evaluation. In addition to this, two clustering validity measures, Compact-separated and David–Bouldin, have been used for analyzing the efficiency of these algorithms. The experimental results show that the two proposed hybrid algorithms outperform the existing hybrid firefly particle swarm optimization algorithm. [ABSTRACT FROM AUTHOR]

The development of a novel hybrid algorithm by modifying the arithmetic optimization algorithm (AOA) with the aid of simulated annealing technique is discussed in this paper. The novel algorithm, named modified arithmetic optimization algorithm (mAOA), is proposed as an effective tool for optimizing power system stabilizer (PSS) adopted in a single-machine infinite-bus power system. To perform the assessments, MATLAB/Simulink software was used. The evaluations on the proposed algorithm are initially performed using several benchmark functions that have unimodal and multimodal natures. The results are then compared with five of the other competitive approaches (arithmetic optimization algorithm, simulated annealing algorithm, genetic algorithm, particle swarm optimization and gravitational search algorithm). The comparisons with respect to those algorithms demonstrate the great promise of the constructed hybrid mAOA algorithm. This shows the greater balance between global and local search stages achieved by the mAOA algorithm. The performance of the developed mAOA algorithm is also assessed through designing an optimally performing PSS for further evaluation which allows the observation of its capability for complex real-world engineering problems. To do so, PSS damping controller is formulated as an optimization problem and the constructed mAOA algorithm is used to search for optimal controller parameters to demonstrate the applicability and the greater performance of the proposed hybrid algorithm for such a complex real-world engineering problem. The obtained results for the latter case are compared with the sine-cosine and symbiotic organisms search algorithms as they are the best performing reported algorithms. The comparisons have demonstrated the superiority of the mAOA algorithm over reported best performing algorithms in terms of PSS design, as well. [ABSTRACT FROM AUTHOR]

The arithmetic optimization algorithm (AOA) is a new metaheuristic algorithm inspired by arithmetic operators (addition, subtraction, multiplication, and division) to solve arithmetic problems. The algorithm is characterized by simple principles, fewer parameter settings, and easy implementation, and has been widely used in many fields. However, similar to other meta-heuristic algorithms, AOA suffers from shortcomings, such as slow convergence speed and an easy ability to fall into local optimum. To address the shortcomings of AOA, an improved arithmetic optimization algorithm (IAOA) is proposed. First, dynamic inertia weights are used to improve the algorithm's exploration and exploitation ability and speed up the algorithm's convergence speed; second, dynamic mutation probability coefficients and the triangular mutation strategy are introduced to improve the algorithm's ability to avoid local optimum. In order to verify the effectiveness and practicality of the algorithm in this paper, six benchmark test functions are selected for the optimization search test verification to verify the optimization search ability of IAOA; then, IAOA is used for the parameter optimization of support vector machines to verify the practical ability of IAOA. The experimental results show that IAOA has a strong global search capability, and the optimization-seeking capability is significantly improved, and it shows excellent performance in support vector machine parameter optimization. [ABSTRACT FROM AUTHOR]

The whale optimization algorithm (WOA) is a metaheuristic algorithm based on swarm intelligence and it mimics the hunting behavior of whales. It has the imperfection of premature convergence into local optima. In order to overcome this disadvantage, a multioperator WOA (MOWOA) is proposed. Four main strategies are introduced to the MOWOA to heighten the search capacity of WOA. The strategies include nonlinear adaptive parameter design, an exploration mechanism of honey badger, Cauchy factor strategy, and greedy strategy. This paper tests the versatility of MOWOA with three different types of benchmark functions, and a kind of seismic inversion problem are trialed run. From the experimental results, the performance of MOWOA outperforms the compared algorithms in global optimization. [ABSTRACT FROM AUTHOR]

This paper aims to present a novel hybrid algorithm named SPSOA to address problems of low search capability and easy to fall into local optimization of seagull optimization algorithm. Firstly, the Sobol sequence in the low-discrepancy sequences is used to initialize the seagull population to enhance the population's diversity and ergodicity. Then, inspired by the sigmoid function, a new parameter is designed to strengthen the ability of the algorithm to coordinate early exploration and late development. Finally, the particle swarm optimization learning strategy is introduced into the seagull position updating method to improve the ability of the algorithm to jump out of local optimization. Through the simulation comparison with other algorithms on 12 benchmark test functions from different angles, the experimental results show that SPSOA is superior to other algorithms in stability, convergence accuracy, and speed. In engineering applications, SPSOA is applied to blind source separation of mixed images. The experimental results show that SPSOA can successfully realize the blind source separation of noisy mixed images and achieve higher separation performance than the compared algorithms. [ABSTRACT FROM AUTHOR]

Plant competition is a fundamental process in plant communities. In one neighbourhood, different plants compete with each other to access shared resources. This paper presents a novel evolutionary algorithm, plant competition optimization (PCO) algorithm, inspired by plant competition processes. In this algorithm, each feasible solution to an optimization problem is assumed to be a plant, with the underlying assumption that each plant grows in competition with its neighbours. In contrast to other techniques inspired by natural phenomena, we attempted to fit the formulation with a known plant growth model, Richards' growth model, and simulate what happens in nature. As the number of plants in a specific area increases, the available resources are decreased, and competition occurs in smaller areas. So, to use this aspect of competition, we develop some mathematical formulation to simulate the decrease of neighbouring area for each plant related to its size to compete on the share resources with the other neighbouring plants. This competition will conduct a smart local search around the most fitted solutions in the optimization context. Furthermore, the reproduction is simulated by producing some seeds in their neighbouring area, which a few of them can migrate to far distances as well. Summing up together, the most powerful plants can grow more. Under competition pressure, their neighbouring area will decrease more than the others, producing more seeds in the next generation. Just as happened in nature, the losers of this competition will die. Our algorithm's efficiency is shown by performing numerical tests on well‐known optimization problems and comparing the results with the other evolutionary algorithms. The results confirm that PCO is effective and efficient in finding sub‐optimal solutions and gives better results than genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA), grasshopper optimisation algorithm (GOA), dragonfly algorithm (DA), salp swarm Algorithm (SSA), and comparable results with whale optimization algorithm (WOA) and marine predators algorithm (MPA) on multimodal optimization functions because it efficiently explores the entire search space efficiently and intelligently. [ABSTRACT FROM AUTHOR]

The arithmetic optimization algorithm is a recently proposed metaheuristic algorithm. In this paper, an improved arithmetic optimization algorithm (IAOA) based on the population control strategy is introduced to solve numerical optimization problems. By classifying the population and adaptively controlling the number of individuals in the subpopulation, the information of each individual can be used effectively, which speeds up the algorithm to find the optimal value, avoids falling into local optimum, and improves the accuracy of the solution. The performance of the proposed IAOA algorithm is evaluated on six systems of nonlinear equations, ten integrations, and engineering problems. The results show that the proposed algorithm outperforms other algorithms in terms of convergence speed, convergence accuracy, stability, and robustness. [ABSTRACT FROM AUTHOR]

The PID control algorithm for balancing robot attitude control suffers from the problem of difficult parameter tuning. Previous studies have proposed using metaheuristic algorithms to tune the PID parameters. However, traditional metaheuristic algorithms are subject to the criticism of premature convergence and the possibility of falling into local optimum solutions. Therefore, the present paper proposes a CFHBA-PID algorithm for balancing robot Dual-loop PID attitude control based on Honey Badger Algorithm (HBA) and CF-ITAE. On the one hand, HBA maintains a sufficiently large population diversity throughout the search process and employs a dynamic search strategy for balanced exploration and exploitation, effectively avoiding the problems of classical intelligent optimization algorithms and serving as a global search. On the other hand, a novel complementary factor (CF) is proposed to complement integrated time absolute error (ITAE) with the overshoot amount, resulting in a new rectification indicator CF-ITAE, which balances the overshoot amount and the response time during parameter tuning. Using balancing robot as the experimental object, HBA-PID is compared with AOA-PID, WOA-PID, and PSO-PID, and the results demonstrate that HBA-PID outperforms the other three algorithms in terms of overshoot amount, stabilization time, ITAE, and convergence speed, proving that the algorithm combining HBA with PID is better than the existing mainstream algorithms. The comparative experiments using CF prove that CFHBA-PID is able to effectively control the overshoot amount in attitude control. In conclusion, the CFHBA-PID algorithm has great control and significant results when applied to the balancing robot. [ABSTRACT FROM AUTHOR]

Over the last decade, the size and complexity of real-world problems have grown dramatically, necessitating more effective tools. Nature-inspired metaheuristic algorithms have proven to be a promising tool for solving such problems due to their performance in a variety of fields. JAYA algorithm is a novel population-based algorithm which could have been able to present reliable results. This is because it does not need any parameters to be set other than the population size and the maximum number of iteration. Despite its positive feedbacks, this algorithm should be modified to witness more efficiency. This paper aims to amend the original version of Jaya to present a high-efficiency version named Powerful Enhanced Jaya (PEJAYA). In other words, the methodology of updating position in Jaya is modified to enhance the convergence and search capabilities. This approach is assessed according to solve 20 well-known benchmark functions, feature selection, and statistical tests. The output results of proposed optimization algorithm are then evaluated by comparing it with other recent algorithms including crow search algorithm (CSA), standard version of JAYA, particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), moth-flame optimization (MFO) and sine–cosine algorithm (SCA). Solving a real-world problem is another way of checking the efficiency of this approach with other published works. Prompt escape from local minima, superior convergence, and stability demonstrate that the suggested approach is a very powerful instrument that may be employed in a variety of optimization situations. [ABSTRACT FROM AUTHOR]

The sailfish optimizer (SFO) is a new metaheuristic swarm intelligence optimization algorithm based on the hunting behavior of biological groups, simulating the elite strategy of the population, and the strategy of alternating sailfish attacking the sardines. It has the advantages of strong search ability, easy implementation and good robustness, and has better performance than popular metaheuristic algorithms. However, the classical SFO suffers from insufficient solution accuracy, slow convergence speed, premature convergence, and insufficient balance between global search and local search capabilities. This paper proposes a chaotic adaptive sailfish optimizer with genetic characteristics (CASFO). The CASFO algorithm first introduces the Tent chaos strategy to initialize the positions of sailfish and sardines to increase the diversity of the population. Secondly, the adaptive t-distribution is introduced to mutate individual sardines to balance and improve the exploration and exploitation capabilities of algorithms. Finally, genetic characteristics are introduced to carry out natural inheritance of sailfish and sardines to improve the solution accuracy and convergence speed of the algorithm. CASFO is tested with 20 mathematical optimization problems and 3 classical engineering optimization problems. The numerical results and comparisons among several algorithms show that the performance and efficiency of the CASFO algorithm are significantly improved. [ABSTRACT FROM AUTHOR]

Accurate classification of high-dimensional biomedical data highly depends on the efficient recognition of the data's main features which can be used to assist diagnose related diseases. However, due to the existence of a large number of irrelevant or redundant features in biomedical data, classification approaches struggle to correctly identify patterns in data without a feature selection algorithm. Feature selection approaches seek to eliminate irrelevant and redundant features to maintain or enhance classification accuracy. In this paper, a new wrapper feature selection method is proposed based on the chimp optimization algorithm (ChOA) for biomedical data classification. The ChOA is a newly proposed metaheuristic algorithm whose capability for solving feature selection problems has not been investigated yet. Two binary variants of the ChoA are introduced for the feature selection problem. In the first approach, two transfer functions (S-shaped and V-shaped) are used to convert the continuous version of ChoA to binary. In addition to the transfer function, the crossover operator is utilized in the second approach to improve the ChOA's exploratory behavior. To validate the efficiency of the proposed approaches, five publicly available high-dimensional biomedical datasets, and a few datasets from different domains such as life, text, and image are employed. The proposed approaches were then compared with six well-known wrapper-based feature selection methods, including multi-objective genetic algorithm (GA), particle swarm optimization (PSO), Bat algorithm (BA), ant colony optimization (ACO), firefly algorithm (FA), and flower pollination (FP) algorithm, as well as two standard filter-based feature selection methods using three different classifiers. The experimental results demonstrate that the proposed approaches can effectively remove the least significant features and improve classification accuracy. The suggested wrapper feature selection techniques also outperform the GA, PSO, BA, ACO, FA, FP, and other existing methods in the terms of the number of selected genes, and classification accuracy in most cases. [ABSTRACT FROM AUTHOR]

The hypercube optimization search (HOS) approach is a new efficient and robust metaheuristic algorithm that simulates the dove's movement in quest of new food sites in nature, utilizing hypercubes to depict the search zones. In medical informatics, the classification of medical data is one of the most challenging tasks because of the uncertainty and nature of healthcare data. This paper proposes the use of the HOS algorithm for training multilayer perceptrons (MLP), one of the most extensively used neural networks (NNs), to enhance its efficacy as a decision support tool for medical data classification. The proposed HOS-MLP model is tested on four significant medical datasets: orthopedic patients, diabetes, coronary heart disease, and breast cancer, to assess HOS's success in training MLP. For verification, the results are compared with eleven different classifiers and eight well-regarded MLP trainer metaheuristic algorithms: particle swarm optimization (PSO), biogeography-based optimizer (BBO), the firefly algorithm (FFA), artificial bee colony (ABC), genetic algorithm (GA), bat algorithm (BAT), monarch butterfly optimizer (MBO), and the flower pollination algorithm (FPA). The experimental results demonstrate that the MLP trained by HOS outperforms the other comparative models regarding mean square error (MSE), classification accuracy, and convergence rate. The findings also reveal that the HOS help the MLP to produce more accurate results than other classification algorithms for the prediction of diseases. [ABSTRACT FROM AUTHOR]

The paper demonstrates a comprehensive performance assessment of the two metaheuristic swarm-based optimization algorithms namely PSO (Particle swarm optimization), BFOA (Bacterial foraging optimization algorithm), and the hybrid PSO-BFOA optimizer for the alleviation and control of the power oscillations in a two-area four generator system integrated with a large-scale PV-farm. After sunset, the PV-plant operates as VSC (Voltage Source Converter)-STATCOM (Static synchronous compensator) using its overall inverting capabilities for the power system stability improvement. While in the daytime during the faults, the PV-farm immediately stops the active power production and behaves as PV-STATCOM until the normal operating conditions are resumed. The modified version of Kundur's two-area system comprising of a large-scale PV-farm is simulated with MATLAB software. An innovative control strategy employing the two PI controllers distinctly controls the DC-AC currents of the PV-STATCOM. The series compensation is set to an optimal value of 85% and subjected to a 3-φ fault. Zero mechanical dampings, along with extra disturbances of 20% variation in reference voltage and electromagnetic torque are introduced to flaunt the worst damping scenarios. The simulation outcomes and time-domain analysis for various test conditions: without a controller, with PSO-based PV-STATCOM, with BFOA-based PV-STATCOM, and with the Hybrid PSO-BFOA-based PV-STATCOM, reveal that all the system modes are stabilized with PSO application. The stability of modes is progressively improved with BFO control, eventually, the modes are optimally stabilized by deploying the hybrid PSO-BFO algorithm. [ABSTRACT FROM AUTHOR]

Summary: Internet of things (IoT) is the reliable alternative among the networking technologies for achieving high performance with improved potentialities of flexible adoptions, data exchanges, resource allocations, and system controls. The existing IoT suffers from the limitations of resource allocation ranging between complicated service provisioning environments and networking service quality mismatching. IoT environment needs to handle the resource allocation issue for attaining satisfactory degree of quality of experience (QoE) that maps multiple resources to gateways. This problem of mapping multiple resources to gateways belongs to the class of NP‐complete problem and can be ideally solved through intelligent metaheuristic algorithms. In this paper, galactic swarm‐improved whale optimization algorithm‐based resource management (GSIWOA‐RM) scheme is proposed for efficient mapping of multiple resources to gateways in IoT. It specifically utilizes galactic swarm optimization algorithm (GSOA) for establishing global control with inherited multiple adaptive cycles of exploitation and exploration during resource allocation. It further prevents the limitations of early convergence in the exploitation phase by utilizing the evolution‐based whale optimization algorithm (WOA) that aids in better balance between exploitation and exploration. The simulation results of the proposed GSIWOA‐RM scheme confirm a better throughput of 28.32% with minimized delay and energy consumptions of 19.24% and 21.82%, when compared to the baseline resource management schemes. [ABSTRACT FROM AUTHOR]

This paper proposes a novel hybrid algorithm which is mathematically modelled by amalgamating the superior features of recently developed Grey Wolf Optimizer (GWO), Sine Cosine Algorithm (SCA), and Crow Search Algorithm (CSA). Researchers have already implemented the aforementioned three algorithms and obtained superior quality results for solving diverse optimization problems. The novel hybrid Variegated GWO Algorithm (VGWO) developed in this proposed research work is initially realized and validated for solving IEEE CEC-C06 2019 benchmark functions. Thereafter, the proposed VGWO is utilized as an optimization tool to solve three emerging and complex power system optimization problems which includes energy management of microgrid systems operated in both islanded and grid-connected mode, dynamic economic emission dispatch and reactive power planning (RPP) problem. A comparative analysis of the proposed VGWO approach with other established metaheuristics is undertaken for each optimization problem. Numerical results show that the novel hybrid VGWO algorithm outperformed an ample number of optimization techniques in providing better quality solutions. The proposed hybrid algorithm yielded a 36.93% reduction in active power loss and 36.80% reduction in operating cost with respect to base case condition for RPP problem. Likewise while solving microgrid energy management problems 9–30% savings was realized in the generation cost compared to the ones mentioned in literature. The capability of handling many complex constraints within a minimum amount of computational time to provide consistently best solutions prioritize the proposed hybrid algorithm among its kinds. Statistical analysis validates the authenticity and viability of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Butterfly optimization algorithm (BOA) is a novel nature-inspired metaheuristics algorithm proposed in recent years. The basic BOA is slow convergence, low accuracy and easy to fall into local optimum. To solve the above problem of basic BOA, this paper proposed an adaptive butterfly optimization algorithm based on mutation strategies ( ABO A-MS) . Firstly, it introduced the strategy of adjust the conversion probability dynamically, which effectively balanced the ability of the global exploration and local search, by means of dynamically adjusting the switching probability of the change information of iteration times and individual fitness. Secondly, it introduced the adaptive inertia weight strategy and local mutation strategy. It applied the inertia weight value and chaotic memory weight factor, which further improved the diversity of this algorithm, and effectively avoided its precocious convergence, as well as accelerated its convergence speed and solving accuracy. In order to verify the optimization performance of the modified algorithm, it carried out the simulation experiments among the modified algorithm, the basic BOA algorithm, the particle swarm optimization algorithm, the salp swarm algorithm, the gray wolf optimization and the others. Simulation results illustrate that the modified algorithm has excellent performance of fast convergence speed, high optimization accuracy and strong stability. [ABSTRACT FROM AUTHOR]

Class imbalance problems have attracted the research community, but a few works have focused on feature selection with imbalanced datasets. To handle class imbalance problems, we developed a novel fitness function for feature selection using the chaotic salp swarm optimization algorithm, an efficient meta-heuristic optimization algorithm that has been successfully used in a wide range of optimization problems. This paper proposes an AdaBoost algorithm with chaotic salp swarm optimization. The most discriminating features are selected using salp swarm optimization, and AdaBoost classifiers are thereafter trained on the features selected. Experiments show the ability of the proposed technique to find the optimal features with performance maximization of AdaBoost. [ABSTRACT FROM AUTHOR]

In this paper, a novel swarm-based metaheuristic algorithm is proposed, which is called tuna swarm optimization (TSO). The main inspiration for TSO is based on the cooperative foraging behavior of tuna swarm. The work mimics two foraging behaviors of tuna swarm, including spiral foraging and parabolic foraging, for developing an effective metaheuristic algorithm. The performance of TSO is evaluated by comparison with other metaheuristics on a set of benchmark functions and several real engineering problems. Sensitivity, scalability, robustness, and convergence analyses were used and combined with the Wilcoxon rank-sum test and Friedman test. The simulation results show that TSO performs better compared to other comparative algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a powerful swarm intelligence metaheuristic optimization algorithm called Dynamic Cat Swarm Optimization. The formulation is through modifying the existing Cat Swarm Optimization Algorithm. The original Cat Swarm Optimization suffers from the shortcoming of "premature convergence," which is the possibility of entrapment in local optima which usually happens due to the off balance between exploration and exploitation phases. Therefore, the proposed algorithm suggests a new method to provide a proper balance between these phases by modifying the selection scheme and the seeking mode of the algorithm. To evaluate the performance of the proposed algorithm, 23 classical test functions, 10 modern test functions (CEC 2019) and a real-world scenario are used. In addition, the dimension-wise diversity metric is used to measure the percentage of the exploration and exploitation phases. The optimization results show the effectiveness of the proposed algorithm, which ranks first compared to several well-known algorithms available in the literature. Furthermore, statistical methods and graphs are also used to further confirm the outperformance of the algorithm. Finally, the conclusion and future directions to further improve the algorithm are discussed. [ABSTRACT FROM AUTHOR]

Nowadays, use of various types of hybrid metaheuristic algorithms attracts the researchers to optimize the average profit or cost of an inventory system to avoid the local optimality due to high nonlinearity of the corresponding optimization problem. This paper deals with an application of binary tournament-based quantum-behaved particle swarm optimization algorithms on an imperfect production inventory problem with shortages. In order to reduce the production of defective items, modern/improvement technology has been incorporated in the production system. Also, the demand of the product is assumed to be dependent on its warranty period and selling price. The main objective of this study is to optimize the production rate, production period, selling price of the product, manufacturer's improvement technology level and maximum shortage level as well as maximize the average profit of the production system. For this purpose, three hybrid metaheuristic algorithms based on binary tournamenting and different variants of quantum-behaved PSO techniques have been developed. Then to examine the validity of the proposed model, three numerical examples have been solved. Considering each example, nonparametric statistical tests have been performed by using four different methods to analyze the performance of the used algorithms. Finally, sensitivity analyses have been performed to investigate the effects of different parameters on optimal policy. [ABSTRACT FROM AUTHOR]

The Sine-Cosine algorithm (SCA) is a population-based metaheuristic algorithm utilizing sine and cosine functions to perform search. To enable the search process, SCA incorporates several search parameters. But sometimes, these parameters make the search in SCA vulnerable to local minima/maxima. To overcome this problem, a new Multi Sine-Cosine algorithm (MSCA) is proposed in this paper. MSCA utilizes multiple swarm clusters to diversify & intensify the search in-order to avoid the local minima/maxima problem. Secondly, during update MSCA also checks for better search clusters that offer convergence to global minima effectively. To assess its performance, we tested the MSCA on unimodal, multimodal and composite benchmark functions taken from the literature. Experimental results reveal that the MSCA is statistically superior with regards to convergence as compared to recent state-of-the-art metaheuristic algorithms, including the original SCA. [ABSTRACT FROM AUTHOR]

Meta-heuristic algorithms have shown promising results in solving various optimization problems. The crow search algorithm (CSA) is a new and effective meta-heuristic algorithm that emulates crows' intelligent group behavior in nature. However, it suffers from several problems, such as trapping into local optimum and premature convergence. This paper proposes an improved crow search algorithm (ICSA), which has been tested and evaluated by a set of well-known benchmark functions. A new update mechanism that uses the merits of the global best position to move toward the best position is proposed. This mechanism increases the convergence of the algorithm and improves its local search-ability. Twenty benchmark functions are used to evaluate the performance of the proposed ICSA. Moreover, the ICSA algorithm is compared with the conventional CSA and other meta-heuristic algorithms such as particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), gray wolf optimizer (GWO), moth-flame optimization (MFO), and sine-cosine algorithm (SCA). The experimental result shows that the proposed ICSA algorithm has produced promising results and outperformed conventional CSA and other meta-heuristic algorithms. Also, the proposed ICSA has a more robust convergence for optimizing objective functions in terms of solution accuracy and efficiency. [ABSTRACT FROM AUTHOR]

In this paper, a student-learning strategy based efficient optimizer has been developed to solve optimal over current relay coordination problem in the power system. The power system is a massive, interrelated network with inherent nonlinearity. The conventional analytical methods to solve an overcurrent relay coordination issue is difficult for such systems. Therefore, the metaheuristic optimization technique can be a good choice for relay coordination problem in the power network. Class topper optimization (CTO) is a stochastic technique inspired by the student learning behavior to improve his/her performance to be the best in his/her class which is successfully applied for different optimization problems. Like the other metaheuristic algorithm, CTO faces the problem of local optima with premature convergence to deal with complex problems. In this paper, a sigmoid acceleration coefficient based chaotic search class topper optimization (SCCTO) is proposed to develop an efficient optimizer and applied to solve optimal relay coordination problem. The logistic map based chaotic search is used at initialization stage of SCCTO algorithm. In the update stage of the proposed algorithm, a slowly varying sigmoid function is used along with normal varying function. It will keep diversity in local solution to explore the optimum global solution in the search space. To validate the effectiveness of the proposed algorithm to solve an optimization problem, the optimal overcurrent relay coordination in the distribution network is tested. The optimal setting of time dial of the relay (over current) with total operating time minimization is the aim of such optimization problem considering relay coordination time gap as constraints. Three types of power distribution networks are examined optimal relay coordination problems. The simulation result shows the efficiency of the developed optimizer in relay coordination with an improvement of 26 to 35 % in total relay operating time than existing results. • An efficient optimizer is developed to solve engineering optimization problem. • Optimal coordination among overcurrent relays in power distribution system is examined. • A sigmoid acceleration coefficient chaotic class topper optimization is developed. • Different types of distribution network are verified with the developed optimizer. • The simulation results for the chosen systems with the proposed algorithm are found better than existing results. [ABSTRACT FROM AUTHOR]

• The path planning and path smoothing are combined through the high-order continuous Bezier curve. • An improved QPSO that incorporates two search mechanisms from bald eagle search (BES) is proposed. • The concept of semi-randomization is infused in some of our modifications in BES-MQPSO. • Enhanced intensive exploitation is performed by incorporating BES search and swoop mechanisms. • It may be the first time to apply BES tricks to help to enhance QPSO and into the path planning field. The design of path planning algorithms to obtain a smooth path that satisfies constraints such as obstacle avoidance, minimized cost, and dynamic feasibility for mobile robots in the workspace is a hot issue in the field of intelligent robotics. The metaheuristic optimization algorithm, which aims to solve path planning problems, is more efficient compared to traditional algorithms. In the current metaheuristic approaches, avoiding local minimum traps is the core goal of the scheme. In this paper, with the benefit of a high-order continuous Bezier curve, we construct an optimization problem of smooth path planning based on the length and the requirement of collision-free safety as constraints of the robot's expected path. Then, the smooth path planning problem is transformed into an optimization problem that searches the locations of control nodes of the Bezier curve. We solve the constructed path planning problem with our modified quantum particle swarm optimization algorithm (QPSO). Specifically, to overcome the shortcomings of the current PSO and QPSO-based particle swarm algorithms like prematurity, unbalanced global search, local exploitation, and local minima, we implement an improved QPSO algorithm denoted as BES-MQPSO that incorporates the search and swoop mechanisms from bald eagle search (BES) strategies. The method consists of four improved modifications: an improved local attractor, improved feature length, BES-enhanced intensive exploitation Strategy, and random variation mechanism. Our proposed BES-MQPSO with these four modifications is tested with benchmark functions and then applied to the smooth path planning problem. Finally, the superiority of BES-MQPSO is confirmed, and the ideal smooth path of the mobile robot is successfully planned. The planned path length is reduced by 4.45% and 2.82% compared to e-QPSO and SDEQPSO respectively, while the standard deviation is reduced by 67.46% and 69.82%, respectively. [ABSTRACT FROM AUTHOR]

Offshore platforms are key structures in energy provision that are subjected to continuous and harsh environmental loadings. A tuned mass damper (TMD) has been proposed as a robust and effective vibration control method for marine structures. However, selecting optimum TMD parameters under certain constraints may become a multimodal optimization problem. Several studies focused on finding the TMD optimum parameters using different metaheuristic optimization algorithms. Nonetheless, it becomes a necessity to find an answer to the question: which algorithm can find the most effective TMD parameters to minimize the structure response? This paper presents the use of a novel metaheuristic optimizer, the Improved Grey Wolf Optimizer (IGWO), for optimum tuning of a TMD aimed at reducing the wave-induced vibration level of a jacket type platform. Moreover, a comprehensive performance analysis of four different metaheuristic algorithms for optimizing a TMD has been investigated. They are IGWO, popular algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Whale Optimization Algorithm (WOA). In order to achieve this purpose, a finite element (FE) model representing a prototype of a jacket-type platform under the influence of irregular waves is numerically solved in COMSOL Multiphysics. Irregular waves are presented using the JONSWAP spectrum and hydrodynamic forces are modeled using Morison's equation. The comparative algorithms are evaluated for the independent minimization of three different objective functions. The target parameters of TMD to be tuned are the mass ratio (μ), the frequency ratio (f opt), and the damping ratio (ζ opt). Finally, the optimized TMD will be applied to the FE model and the resultant response will be investigated. The results demonstrate the superior ability of the IGWO optimizer to optimally tune a TMD attached to marine structures compared with the other algorithms. In addition, IGWO proved its unique ability to steadily converge toward the global minimum value. • Metaheuristic optimization of a TMD to minimize the dynamic response of a jacket platform influenced by irregular waves. • The use of the improved grey wolf optimizer as a novel technique for TMD optimization. • Comprehensive performance analysis of four metaheuristic algorithms (GA, PSO, WOA, and IGWO) for TMD optimization. • The analysis includes three different objective functions to be minimized by the comparative algorithms. • Finite element simulation of applying the optimized TMD to a jacket platform using COMSOL. [ABSTRACT FROM AUTHOR]

The need to determine the optimum well placement which causes maximum cumulative oil production has dramatically raised in recent years. Hence, there is a need for a reliable and accurate tool to diagnose the possible solutions in a cost- and time-effective manner. Two of the most commonly used algorithms in this area are Particle Swarm Optimization (PSO) and Genetic Algorithm (GA). These two algorithms, the similar used methodologies for finding the optimum well location, suffer from local optimization issues. These algorithms are slow, and their found points is not accurate. Therefore, in this study, a new meta-heuristic optimization algorithm known as the Black Widow Optimization (BWO) is employed to optimize the location of five production wells. The results are compared to those of PSO and GA. To this end, the cumulative oil production is intended as the objective function, and a simplified model of an actual reservoir is simulated. Afterward, the well placement is optimized. The results revealed a higher improvement of the objective function for the BWO algorithm compared to PSO and GA. The new algorithm was faster and resulted in a better optimum point. Concisely, the BWO algorithm reduced the associated time complexities up to 9.19% and 18.29% compared to GA and PSO, respectively. The PUNQ-S3 reservoir model was also employed to validate the results. • The well location is optimized, using Black Widow Optimization (BWO). • To validate the results, BOW performance is compared with particle swarm optimization and genetic algorithm. • BWO algorithm found the global optimum within less computational time (9.19% faster than GA, and 18.29% faster than PSO). • BWO resulted in a better optimum point in comparison to GA and PSO. • This study can be continued by repeating the methodology of this paper in bigger fields with more wells. [ABSTRACT FROM AUTHOR]

For years, meta-heuristic algorithms have been widely studied and many improved versions have been developed: from the evolution of the swarm topologies of the Particle Swarm Optimization algorithm, to the using of machine learning to Differential Evolutionary algorithms. However, the tuning of the fundamental meta-heuristic parameters has been less studied, but may lead to significant improvements on the convergence accuracy of these algorithms. This paper aims at developing an automated methodology to calibrate the parameters of population-based meta-heuristic algorithms for optimization problems. Based on the kriging estimation of the best combination of parameters, the Automated parameter tuning of Meta-heuristics (AptM) methodology gives the optimal algorithm setup for each considered problem in order to lead to a better convergence accuracy. The proposed AptM methodology is used to tune three different meta-heuristic algorithms, each applied to twelve mathematical unimodal or multimodal objective functions. AptM methodology performance is assessed by comparison of classical setups usually used in the literature. The numerical results show that the AptM methodology allows a significant improvement of the convergence accuracy of meta-heuristics with an average improvement of 62.02%, 69.12% and 64.94% on optimization problems defined in dimensions 10, 30 and 50 respectively. An experimental criterion is defined based on the convergence accuracy of the AptM methodology over the classical setups, assessing the AptM performances. The previous experimental criterion allows to compare the AptM methodology over the base-set. The AptM methodology shows a significant improvement of the algorithms performance on 97.2% of the tested problems. [ABSTRACT FROM AUTHOR]