Search

The fundamental objective of a modern power system lies in ensuring reliable and effective energy access for its customers. The assessment and determination of optimal operating conditions for power systems involve the utilization of the optimal power flow (OPF) tool. By considering critical factors such as generator power, bus voltages, and line power flow limits while satisfying the power balance equations, the OPF tool enables the identification of the most favorable configuration for efficient power system operation. Traditional optimization methods have limitations in addressing complex power system problems due to poor convergence and long computational times. As a result, computational intelligence tools have gained popularity in recent years. These tools are versatile and enable efficient solution of power system problems by effectively handling qualitative constraints. This paper presents a well-organized and comprehensive review of the algorithms used in power system optimization in the existing literature, encompassing the most recent developments in the field. Specifically, it examines the application of various population-based artificial intelligence techniques that have gained widespread adoption over the past decade (2012–2022). The aim of these techniques is to resolve an OPF problem. This paper organizes the reviewed papers into various types of population-based metaheuristic algorithms, each one implemented sequentially to deal with the OPF problem in the same chronological order in which they appeared in the literature. [ABSTRACT FROM AUTHOR]

Honey Badger algorithm (HBA) is an intelligent adaptive meta-heuristic optimization algorithm with few parameters, fast convergence and good convergence accuracy for single-objective problems. However, many real-world optimization problems involve multiple conflicting objectives that need to be optimized simultaneously. A new multi-objective Honey Badger algorithm is proposed to solve the combined economic and environmental power scheduling problem. The proposed MOHBA combines the HBA with the Pareto dominance principle to produce a non-dominated solution. It uses an external elite storage mechanism with congested distance ordering to maintain the diversity of the distribution during the evolution of the Pareto optimal solutions. Furthermore, a fuzzy decision strategy is used to select the best compromise solution from the obtained Pareto bound. Then, to validate the performance of the proposed MOHBA, 20 different benchmark test functions are used to test it against other multi-objective optimization techniques. Moreover, the method is implemented on the multi-objective CEEPD problem for the IEEE 30-bus 6 generator and IEEE 118-bus 14 generator systems. Various objective function s in a multi-objective optimization space is confirmed by comparative studies with minimization schemes and fuzzy decision strategies are utilized to achieve the best scheduling solution for energy and emissions savings. The predominance of the algorithm and its potentiality to handle CEEPD problem several other algorithms. [ABSTRACT FROM AUTHOR]

Offering Product-Service Systems (PSS) becomes an established strategy for companies to increase the provided customer value and ensure their competitiveness. Designing PSS business models, however, remains a major challenge. One reason for this is the fact that PSS business models are characterized by a long-term nature. Decisions made in the development phase must take into account possible scenarios in the operational phase. Risks must already be anticipated in this phase and mitigated with appropriate measures. Another reason for the design phase being a major challenge is the size of the solution space for a possible business model. Developers are faced with a multitude of possible business models and have the challenge of selecting the best one. In this article, a simheuristic optimization approach is developed to test and evaluate PSS business models in the design phase in order to select the best business model configuration beforehand. For optimization, a proprietary evolutionary algorithm is developed and tested. The results validate the suitability of the approach for the design phase and the quality of the algorithm for achieving good results. This could even be transferred to already established PSS. [ABSTRACT FROM AUTHOR]

Snake optimizer (SO) is an optimization algorithm drawn from the reproductive habits of serpents. It exhibits outstanding effectiveness in solving continuous optimization problems. However, SO may face some performance challenges related to its population diversity and early convergence behavior. In this paper, we address the challenges of SO by introducing the Hybrid snake optimizer algorithm (HSOA). HSOA is a novel approach to optimization that incorporates two new optimization techniques into the SO algorithm. First, it incorporates a new opposition-based learning technique called Oppositional-mutual learning into the initialization stage of the SO algorithm. Second, it integrates dynamic polynomial mutation, which is an intelligent mutation method, into the initialization and optimization stages of the SO algorithm. These integrated approaches aim to increase the population's diversity of SO, while improving its searchability during its optimization stage. In power systems, the economic load dispatch (ELD) is an intricate optimization problem that becomes more challenging when the restrictions of the valve point effect (VPE) are incorporated into it. ELD with VPE is non-convex, lacking smoothness, and exhibiting nonlinearity that considers operational limitations expressed as both equality and inequality constraints to generate electricity. The suggested HSOA algorithm underwent evaluation and was compared with 47 renowned optimization algorithms across five real-world ELD problems with different specifications: generators with different unit capacities, transmission losses, prohibited operation zones, and Ramp Rate restrictions. The experimental results demonstrate that HSOA produces competitive solutions for the five real-world ELD problems. In detail, HSOA achieves the top rank in three cases of ELD problems with a 3-unit generator, and it secures the second and third positions in high-dimensional ELD problems with 40-unit and 80-unit generators, respectively. The statistical tests confirm the reliability and efficiency of HSOA. In addition, the effectiveness of HSOA was evaluated using the single-objective IEEE-CEC 2014 functions and compared to the results of eight popular metaheuristic algorithms. The results demonstrate that HSOA is a competitive optimization algorithm capable of solving the functions of IEEE-CEC 2014. [ABSTRACT FROM AUTHOR]

Liquefaction is one of the natural hazards that occurs due to earthquakes and has a significant impact on the loss of human lives and various civil infrastructures. In this study, metaheuristic ANN with optimization techniques (i.e., ANN-GWO, ANN-GTO, ANN-GAO, ANN-HHO, ANN-SSA, and ANN-SMA), machine learning techniques are used to predict the probability of liquefaction ( P L ) from the SPT-based dataset. A dataset of 834 case histories, including seven geotechnical and seismic parameters, was used for training and testing different metaheuristic algorithms. The performance of the proposed machine learning algorithm used at every stage of analysis includes statistical parameters evaluation, score analysis, actual vs. predicted curve, error matrix, Taylor diagram, OBJ criteria, DDR criteria, and AIC criteria. The ANN-GTO model has been found to be the best model for the prediction of the probability of liquefaction potential of soil. However, all proposed models can successfully predict the liquefaction potential of soil with reasonably good accuracy. The proposed models can be used as a key tool in the prediction of the liquefaction susceptibility of any soil deposit. [ABSTRACT FROM AUTHOR]

Breast cancer remains a prevalent and serious health issue, leading to high mortality rates among women worldwide. Early detection of breast cancer is pivotal in improving patient outcomes. This study introduces an innovative approach for breast cancer segmentation by integrating Support Vector Machine (SVM) with Harris Hawks Optimization (HHO) and Cuckoo Search (CS) algorithms. HHO, a metaheuristic optimization algorithm inspired by the cooperative behavior of Harris Hawks, is employed for effective exploration and exploitation within the search space, thereby enhancing the accuracy of image segmentation. The CS algorithm, incorporating Cuckoo Search principles, ensures a balanced exploration of local and global search spaces, contributing to a comprehensive optimization strategy. The hybrid HHO-CS SVM algorithm is instrumental in fine-tuning hyperparameters, resulting in superior performance and improved segmentation outcomes for breast cancer detection. This innovative amalgamation of techniques significantly elevates the accuracy and efficiency of breast cancer detection through image segmentation. [ABSTRACT FROM AUTHOR]

The optimal reactive power dispatch (ORPD) problem is a critical factor in maintaining the safe and efficient operation of electric networks. Due to its mixed-variable nonlinear nature, addressing this problem requires an appropriate optimization algorithm. In this study, a novel approach based on the combination of artificial rabbits optimization (ARO) and gradient-based optimization (GBO) algorithms was proposed to solve the ORPD problem in electric networks. The performance of the proposed AROGBO algorithm were verified on 7 numerical optimization test functions. To evaluate the effectiveness of this hybrid AROGBO technique, standard IEEE-30, IEEE-57 bus, and IEEE-118 bus test systems were employed, with two objective functions tested for each system: minimum total power loss and minimum total voltage deviations. The AROGBO, ARO, and GBO algorithms were utilized in each case to determine the optimal values of the generator voltage, transformer tap changer positions, and reactive power compensation values. A comprehensive comparison was made between the results obtained from the hybrid AROGBO algorithm, standard ARO and GBO algorithms, and other metaheuristic optimization techniques. The simulation attainments verify the accuracy and stability of the proposed AROGBO methodology in solving the ORPD problem. [ABSTRACT FROM AUTHOR]

Global optimization techniques are increasingly preferred over human-driven methods in the design of electromagnetic structures such as metasurfaces, and careful construction and parameterization of the physical structure is critical in ensuring computational efficiency and convergence of the optimization algorithm to a globally optimal solution. While many design variables in physical systems take discrete values, optimization algorithms often benefit from a continuous design space. This work demonstrates the use of level set functions as a continuous basis for designing material distributions for metasurface arrays and introduces an improved parameterization which is termed the periodic level set function. We explore the use of alternate norms in the definition of the level set function and define a new pseudo-inverse technique for upsampling basis coefficients with these norms. The level set method is compared to the fragmented parameterization and shows improved electromagnetic responses for two dissimilar cost functions: a narrowband objective and a broadband objective. Finally, we manufacture an optimized level set metasurface and measure its scattering parameters to demonstrate real-world performance. [ABSTRACT FROM AUTHOR]

High-utility itemsets mining (HUIM) is an important research topic in data mining that consists of extracting efficient itemsets that generate high profit in databases. Metaheuristic algorithms are good candidates for finding some sufficiently good high-utility itemsets (HUIs) while reducing the prohibitive computational cost incurred by such mining. However, metaheuristic algorithms suffer from crucial issues: runtime and memory consumption, entailing scalability issues. To contribute in alleviating these drawbacks, we explore a hybrid approach combining metaheuristics with an optimization technique, and experimentally show the obtainment of better quality solutions. The exploration component in our approach relies on the crow search algorithm (CSA) which is a method that presents a strong capacity in the global search process. The exploitation component is based on the particle swarm optimization (PSO) which is an established stochastic optimization technique known to have a good convergence capability. This article proposes the HUIM-ICSO algorithm, coupling CSA and PSO, as a hybrid method for mining HUIs. In addition to the proposed main CSA-based algorithm, two additional novel enhanced variants are incorporated and integrated with PSO. Experiments are undertaken on 12 publicly available datasets and compared with state-of-the-art algorithms, such as mHUIMiner, HUIM-SPSO and HUIM-AF. Experiments show that, as the number of transactions or items grows, the suggested approach remains scalable and delivers favorable outcomes in terms of runtime, memory usage, and the quantity of HUIs mined, all while maintaining a good convergence rate. [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]

This paper developed a new and efficient approach, the metaheuristic optimisation approach based on the Kalman filter (KF), to accurately identify the infinite impulse response (IIR) system coefficients. A recently developed metaheuristic optimisation technique called the manta-ray foraging optimisation (MRFO) algorithm has been employed to solve the proper parameters tuning exertion of KF. The problem of achieving better unknown state estimations by the conventional KF is closely connected with decent prior information about the noise statistics (measurement and process noise). However, the statistics mentioned above depend on the types of applications and process dynamics. The use of insufficiently known priori filter statistics would reduce the precision of the estimated filter or sometimes lead to a practical divergence of the filter. To alleviate this problem, the proposed technique initially produces optimally tuned KF parameters using the MRFO algorithm, and then the conventional KF method estimates the coefficients of the IIR model using the optimised KF parameters obtained at the beginning. The simulation studies have been carried out on three distinct order benchmark IIR systems (both same and reduced-order), and two prominent IIR applications called direct current (DC) motor and fractional order digital differentiator (FODD) using the proposed method. The overall identification results demonstrate that the proposed MRFO-KF technique significantly improves performance metrics over competing techniques, such as basic KF, other employed metaheuristic-based KF schemes and recently reported state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

The RIME optimization algorithm (RIME) represents an advanced optimization technique. However, it suffers from issues such as slow convergence speed and susceptibility to falling into local optima. In response to these shortcomings, we propose a multi-strategy enhanced version known as the multi-strategy improved RIME optimization algorithm (MIRIME). Firstly, the Tent chaotic map is utilized to initialize the population, laying the groundwork for global optimization. Secondly, we introduce an adaptive update strategy based on leadership and the dynamic centroid, facilitating the swarm's exploitation in a more favorable direction. To address the problem of population scarcity in later iterations, the lens imaging opposition-based learning control strategy is introduced to enhance population diversity and ensure convergence accuracy. The proposed centroid boundary control strategy not only limits the search boundaries of individuals but also effectively enhances the algorithm's search focus and efficiency. Finally, to demonstrate the performance of MIRIME, we employ CEC 2017 and CEC 2022 test suites to compare it with 11 popular algorithms across different dimensions, verifying its effectiveness. Additionally, to assess the method's practical feasibility, we apply MIRIME to solve the three-dimensional path planning problem for unmanned surface vehicles. Experimental results indicate that MIRIME outperforms other competing algorithms in terms of solution quality and stability, highlighting its superior application potential. [ABSTRACT FROM AUTHOR]

Many new metaheuristic algorithms prioritize their search strategy phase, often neglecting equally critical stages like initialization. Latin hypercube sampling (LHS) is one technique that stands out in this context. LHS selects representative samples through permutations in a multidimensional space, effectively preventing the clustering of points in specific areas. However, its limitations become apparent in high-dimensional problems, as it fails to provide crucial search space information and struggles to determine samples across all dimensions. Addressing these challenges, this paper introduces an innovative population initialization approach, combining the strengths of LHS with evolutionary behaviors. This technique is divided into two main sections: spatial and quality. The spatial section divides the search space into equal intervals across each dimension to establish initial solutions. Meanwhile, the quality section employs evolutionary strategies like mutation and crossover. These strategies serve a dual purpose: they explore the search space thoroughly and refine solutions, bringing them closer to the objective function. To validate the effectiveness of this method, these principles have been integrated it into the classic Differential Evolution algorithm. We conducted extensive tests using 30 representative benchmark functions to assess its performance. The experimental results are encouraging; our methodology not only speeds up convergence but also enhances solution quality, outperforming other similar techniques. [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]

Multiple unmanned aerial vehicle (UAV) path planning is the benchmark problem of multiple UAV application, which belongs to the non-deterministic polynomial problem. Its objective is to require multiple UAV to fly safely to the goal position according to their specific start position in three-dimensional space. This issue can be defined as a high-dimensional optimization problem, the solution of which requires optimization techniques with global optimization capabilities. Equilibrium optimizer (EO) is a population-based meta-heuristic algorithm. To improve the optimization ability of EO to solve high-dimensional problems, this paper proposes a modified equilibrium optimizer with generalized opposition-based learning (MGOEO), which improves the population activity by increasing the internal mutation and cross of the population. In addition, the generalized opposition-based learning is used to construct the population, which can effectively ensure that the algorithm has ability to jump out of the limitation of local optimal. First, numerical experiments show that MGOEO has better optimization precision than EO and several other swarm intelligent algorithms. Then, the paths of UAVs are simulated in three different obstacle environments. The simulation results show that MGOEO can obtain safe and smooth paths, which are better than EO and other eight state-of-the-art optimization algorithms. [ABSTRACT FROM AUTHOR]

Cloud provides preferred services to the users based on their requirements over the internet. In a cloud server, virtual network mapping (VNM) is employed to build a network on demand by deploying virtual machines in a substrate network based on the user request and offers efficient service provision. In case of service provisioning, sufficient computing resource is an essential one to deliver services for satisfying the customers' requirements. The resource optimal service provisioning is a still demanding issue in cloud computing. To develop, Oppositional Learned Metaheuristic Whale Optimization-based Graphical Virtual Network Mapping (OLMWO-GVNM) technique for improving the mapping efficiency of virtual network request to the resource-efficient physical node with minimum computation time. Initially, the number of virtual network requests arrived at the cloud server from different locations. After collecting the requests, the cloud server uses the graph theory for performing both virtual node mapping and link mapping with optimal resource utilization. The node mapping is carried out using the Oppositional Learned Metaheuristic Whale Optimization technique with multiple resources such as CPU, memory, bandwidth, and energy to find the optimal physical node for mapping the virtual network requests. After that, the link mapping is carried out by mapping the virtual link on the substrate path. In this way, the OLMWO-GVNM technique efficiently mapping the input virtual network request to the resource optimum physical node with minimum time. Experimental evaluation of the OLMWO-GVNM technique and existing techniques are carried out with different factors such as mapping efficiency, computation time, request acceptance ratio, and memory consumption concerning several requests. The discussed results prove that the proposed OLMWO-GVNM technique improves the virtual network mapping efficiency and acceptance ratio with minimum time as well as memory consumption compared to state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Designing effective PID controllers for gimbal payload systems (GPS) in naval applications poses inherent challenges due to the dynamic nature of these systems. The gimbal system requires precise control to stabilize its line of sight (LOS) for accurate target tracking in electro-optical systems. Conventional PID controllers often struggle to address the complex dynamics and nonlinearities inherent in gimbal systems, resulting in suboptimal performance. Therefore, in this study, we introduce a novel control design framework for the gimbal payload system (GPS) employed in naval applications. A more effective PID controller is developed by utilizing the hunting mechanism of the antlion optimization technique. This controller precisely manages and stabilizes the LOS of the GPS, ensuring seamless target tracking in electro-optical systems. Furthermore, we assess the robustness of the proposed controller by varying system parameters, including moment of inertia (± 20%) and motor resistance (+ 10%). The results demonstrate robust target tracking even in the presence of changes within the system. Additionally, the gimbal system exhibits zero overshoot, and the achieved high values of gain and phase margins outperform other techniques such as genetic algorithm, particle swarm optimization, and classical methods. [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]

This study seeks to plan and evaluate the cost of the logistics in manufacturing tetra duplex board using prime grade and recycled materials. The real-world data for this study is obtained from one of the largest paper and board industries in Asia. The bi-objective problem is formulated by developing a mixed integer linear programming (MILP) model considering the constraints related to raw material supplies, processing, and storage. The metaheuristic optimization techniques are applied based on the concept of epsilon dominance to balance the conflicting objectives to counter the complex problem in the real world of transportation for the ease of the decision-makers to make the best-informed decisions in the selection of raw material. The investigation results indicate that the cost of prime-grade material in the tetra duplex board supply chain is 71 percent higher than recycled fiber. Furthermore, this study can be extended by evaluating the environmental aspects of prime and recycled-grade transportation. Moreover, the logistics of the prime grade can further be narrowed down by investigating it in various modes of transportation such as highways, waterways, rail, and air. [ABSTRACT FROM AUTHOR]

Recently, there has been a growing interest in employing optimization techniques to ascertain the most efficient operation of reservoirs. This involves their application to various facets of the reservoir operating system, particularly in determining optimal rule curves. This study delves into the exploration of different algorithms, including Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Firefly Algorithm (FA), Invasive Weed Optimization (IWO), Teaching Learning-Based Optimization (TLBO), and Harmony Search (HS). Each algorithm was integrated into a reservoir simulation model, focusing on finding optimal rule curves for the Mujib reservoir in Jordan from 2004 to 2019. The primary objective was to evaluate the long-term impact of water shortages and excess releases on the Mujib reservoir. Furthermore, the study aimed to determine the effects of water demand management by reducing it by 10%, 20%, and 30%. The results revealed that the used algorithms effectively mitigated water shortages and excess releases compared to the current operational strategy. Notably, the Teaching Learning-Based Optimization (TLBO) algorithm yielded the most favorable outcomes, reducing the frequency and average of water shortages to 55.09% and 56.26%, respectively. Additionally, it curtailed the frequency and average of excess releases to 63.16% and 73.31%, respectively. [ABSTRACT FROM AUTHOR]

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 parameter identification problem of photovoltaic (PV) models is classified as a complex nonlinear optimization problem that cannot be accurately solved by traditional techniques. Therefore, metaheuristic algorithms have been recently used to solve this problem due to their potential to approximate the optimal solution for several complicated optimization problems. Despite that, the existing metaheuristic algorithms still suffer from sluggish convergence rates and stagnation in local optima when applied to tackle this problem. Therefore, this study presents a new parameter estimation technique, namely HKOA, based on integrating the recently published Kepler optimization algorithm (KOA) with the ranking-based update and exploitation improvement mechanisms to accurately estimate the unknown parameters of the third-, single-, and double-diode models. The former mechanism aims at promoting the KOA's exploration operator to diminish getting stuck in local optima, while the latter mechanism is used to strengthen its exploitation operator to faster converge to the approximate solution. Both KOA and HKOA are validated using the RTC France solar cell and five PV modules, including Photowatt-PWP201, Ultra 85-P, Ultra 85-P, STP6-120/36, and STM6-40/36, to show their efficiency and stability. In addition, they are extensively compared to several optimization techniques to show their effectiveness. According to the experimental findings, HKOA is a strong alternative method for estimating the unknown parameters of PV models because it can yield substantially different and superior findings for the third-, single-, and double-diode models. [ABSTRACT FROM AUTHOR]

Jaya is a metaheuristic algorithm that uses a pair of random internal parameters to adjust its exploration and exploitation search behaviors. Such a random setting can negatively affect the search performance of the algorithm by causing inappropriate search behavior in some iterations. To tackle this issue, the present study deals with developing a new fuzzy decision-making mechanism for dynamic adjusting the trade-off between the exploration and exploitation search behaviors of the Jaya method. The new algorithm is named Fuzzy Reinforced Jaya (FRJ) method. The search capability of the FRJ is evaluated in solving a suite of unconstrained mathematical benchmarks and constrained mechanical and structural optimization problems with buckling and natural frequency constraints. Also, the relevant decision variables are selected from both continuous and discrete domains. To provide a deeper insight into the effect of the defined auxiliary fuzzy module, the performance of the algorithm is evaluated and discussed using normalized diversity concept and behavioral diagrams. Also, employing different statistical analyses (e.g., Q–Q diagrams, Wilcoxson and Friedman tests), the significance of the outcomes is evaluated. Also, the numeric achievements are compared with six other well-stablished techniques. Attained outcomes indicate that the proposed FRJ, as a self-adaptive and parameter-free method, provides superior and promising results in the terms of stability, accuracy, and computational cost in solving mathematical and structural optimization problems. [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]

The utilization of recycled aggregates (RA) for concrete production has the potential to offer substantial environmental and economic advantages. However, RA concrete is plagued with considerable durability concerns, particularly carbonation. To advance the application of RA concrete, the establishment of a reliable model for predicting the carbonation is needed. On the one hand, concrete carbonation is a long and slow process and thus consumes a lot of time and energy to monitor. On the other hand, carbonation is influenced by many factors and is hard to predict. Regarding this, this paper proposes the use of machine learning techniques to establish accurate prediction models for the carbonation depth (CD) of RA concrete. Three types of regression techniques and meta-heuristic algorithms were employed to provide more alternative predictive tools. It was found that the best prediction performance was obtained from extreme gradient boosting-multi-universe optimizer (XGB-MVO) with R2 value of 0.9949 and 0.9398 for training and testing sets, respectively. XGB-MVO was used for evaluating physical laws of carbonation and it was found that the developed XGB-MVO model could provide reasonable predictions when new data were investigated. It also showed better generalization capabilities when compared with different models in the literature. Overall, this paper emphasizes the need for sustainable solutions in the construction industry to reduce its environmental impact and contribute to sustainable and low-carbon economies. [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]

The primary objective of this study is to delve into the application and validation of the Resistance Capacitance Optimization Algorithm (RCOA)—a new, physics-inspired metaheuristic optimization algorithm. The RCOA, intriguingly inspired by the time response of a resistance–capacitance circuit to a sudden voltage fluctuation, has been earmarked for solving complex numerical and engineering design optimization problems. Uniquely, the RCOA operates without any control/tunable parameters. In the first phase of this study, we evaluated the RCOA's credibility and functionality by deploying it on a set of 23 benchmark test functions. This was followed by thoroughly examining its application in eight distinct constrained engineering design optimization scenarios. This methodical approach was undertaken to dissect and understand the algorithm's exploration and exploitation phases, leveraging standard benchmark functions as the yardstick. The principal findings underline the significant effectiveness of the RCOA, especially when contrasted against various state-of-the-art algorithms in the field. Beyond its apparent superiority, the RCOA was put through rigorous statistical non-parametric testing, further endorsing its reliability as an innovative tool for handling complex engineering design problems. The conclusion of this research underscores the RCOA's strong performance in terms of reliability and precision, particularly in tackling constrained engineering design optimization challenges. This statement, derived from the systematic study, strengthens RCOA's position as a potentially transformative tool in the mathematical optimization landscape. It also paves the way for further exploration and adaptation of physics-inspired algorithms in the broader realm of optimization problems. [ABSTRACT FROM AUTHOR]

In this study, the permutation flow shop scheduling problem with makespan criteria is investigated, and two algorithms, Jaya and SAMP-Jaya, are proposed. Jaya is a simple and effective meta-heuristic optimization technique that has been successfully applied in various engineering problems, while SAMP-Jaya is a modified version of Jaya that uses a multi-population approach. Both algorithms are parameter-less, and the ANOVA experiment is used to identify the significant control parameters. The population size is found to be the most crucial parameter for improving solution quality. The performance of Jaya and SAMP-Jaya is compared to the exact solution and the genetic algorithm, demonstrating the superiority of the proposed algorithms. The computational results confirm that the suggested optimization techniques are effective in terms of solution quality. [ABSTRACT FROM AUTHOR]

In this study, a hardware design that runs the PSO algorithm at the micro level is carried out using FPGA technology, which facilitates prototyping and testing of integrated circuit systems. In this way, a high rate of acceleration has been achieved for swarm algorithms that perform stochastic search and whose calculation time is not suitable for real-time systems. For this, the inverse kinematics problem, which is used in the robotics field and which forms the basis of the robot control system, is solved for a 7-joint serial robot manipulator. Since the study aims to compare software-based calculations and hardware-based calculations, the results are presented in a comparative way with the results obtained with Matlab software. The tests have been performed in the study revealed two important situations. Firstly, the biggest handicap of algorithms such as PSO that reach a result by searching in a certain solution space is that the solution times are not suitable for real-time applications. The other is that FPGA can be used as a prototyping device for real-time applications due to its speed and hardware-based running. Because according to the test results, FPGA has accelerated the calculations up to 1000 times. [ABSTRACT FROM AUTHOR]

In recent years, significant advancements have been made in artificial neural network models and they have been applied to a variety of real-world problems. However, one of the limitations of artificial neural networks is that they can getting stuck in local minima during the training phase, which is a consequence of their use of gradient descent-based techniques. This negatively impacts the generalization performance of the network. In this study, it is proposed a new hybrid artificial neural network model called COOT-ANN, which uses the coot optimization algorithm firstly for optimizing artificial neural networks parameters, a metaheuristic-based approach. The COOT-ANN model does not get stuck in local minima during the training phase due to the use of metaheuristic-based optimization algorithm. The results of the study demonstrate that the proposed method is quite successful in terms of accuracy, cross-entropy, F1-score, and Cohen's Kappa metrics when compared to gradient descent, scaled conjugate gradient, and Levenberg–Marquardt optimization techniques. [ABSTRACT FROM AUTHOR]

The Whale Optimization Algorithm (WOA) is one of the recent meta-heuristic algorithms. WOA has advantages such as an exploration mechanism that leads towards the global optimum, a suitable balance between exploration and exploitation that avoids the local optimum, and a very good exploitation capability. In this study, five new hybrid algorithms are proposed to develop these advantages. Two of them are developed by combining WOA and Particle Swarm Optimization (PSO) algorithms, and three of them are developed by adding the Lévy flight algorithm to this combination in different ways. The proposed algorithms have been tested with 23 mathematical optimization problems, and in order to make a more accurate comparison, the average optimization results and corresponding standard deviation results are calculated by running these algorithms 30 times for each optimization problem. The proposed algorithms' performances were evaluated among themselves, and the WOALFVWPSO algorithm performed better among these algorithms. This proposed algorithm has been first compared with WOA and PSO, then with other algorithms in the literature. According to WOA and PSO, the proposed algorithm performs better in 19 of 23 mathematical optimization problems, and according to other literature, it performs better in 15 of 23 problems. Also, the proposed algorithm has been applied to the pressure vessel design engineering problem and achieved the best result compared to other algorithms in the literature. It has been proven that the WOALFVWPSO algorithm provides competitive solutions for most optimization problems when compared to meta-heuristic algorithms in the literature. [ABSTRACT FROM AUTHOR]

Wireless sensor network (WSN) plays a crucial role in the Internet of Things (IoTs), which assist to produce seamless information that have a great impact on the network lifetime. Despite the substantial application of the WSN numerous challenges like energy, load balancing, security, and storage exist. Energy efficacy is regarded as an integral part of the design of WSN; this can be achieved by clustering and multi-hop routing technique using metaheuristic optimization algorithm. This paper concentrates on design of Metaheuristics Cluster-based Routing Technique for Energy-Efficient WSN (MHCRT-EEWSN). The presented MHCRT-EEWSN technique mainly concentrates on the improvements of energy efficiency and lifespan of the WSN via clustering and routing process. For effectual clustering process, the MHCRT-EEWSN model utilizes Whale Moth Flame Optimization technique and can be utilized by the use of fitness function involving intra-cluster distance, inter-cluster distance, energy, and balancing factor. Besides, the MHCRT-EEWSN model employs Improved African Buffalo Optimization (IABO) based routing technique. To select optimal routes in WSN, the IABO algorithm designs a fitness function comprising multiple parameters like residual energy and distance factor. The experimental validation of the MHCRT-EEWSN model can be tested by making use of a series of simulations. A wide-ranging comparative study shows the promising performances of the MHCRT-EEWSN model than other recent methods. The experimental validation of the MHCRT-EEWSN model can be tested by making use of a series of simulations. A wide-ranging comparative study shows the promising performances of the MHCRT-EEWSN model than other recent methods. [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]

Cloud Computing is an eminent and reputable agenda which relies on large-scale distributed processing to provide access to their resources and services. In the cloud environment a rigorous management system is mandatory to collect all information regarding task processing levels and proving impartial resource provisioning through the levels of Quality of Service (QoS). These concerns can be settled by employing a meta-heuristic optimization-based resource management. Subsequently, this paper presents a Fuzzy Emperor Penguin Optimization (Fuzzy-EPO) algorithm-based resource provisioning framework for heterogeneous cloud environment. To deploy the optimal set of virtual machines (VM) to physical machines the VM allocation model is employed. The proposed Fuzzy-EPO algorithm does the VM consolidation mainly to reallocate overloaded VM to under-loaded PM to minimize the migration time and the brownout mechanism is adopted to reduce the rate of energy consumption. CloudSim simulation platform is used to implement the proposed system. The simulation results expose that the proposed Fuzzy-EPO based system is effective in restraining the proportion of service level agreement violation and increasing QoS requirements for providing proficient cloud service. [ABSTRACT FROM AUTHOR]

As the complexity of optimization problems increases, metaheuristic algorithms play an important role in dealing with complex computational problems and try to find the best solution from all feasible solutions to the problem. The mayfly algorithm is a novel metaheuristic algorithm based on the social behavior of biological groups. The algorithm achieves global and local search by simulating the flight behavior and mating process of mayflies to obtain global optimal solution. However, the traditional mayfly algorithm has problems such as low convergence accuracy and poor stability and is prone to becoming trapped in local optimality. Aiming at the problem of the mayfly algorithm, an improved mayfly algorithm combined with the gray wolf optimization algorithm (MA-GWO) is proposed. In the mayfly algorithm, the Lévy flight strategy and the hunting mechanism of the gray wolf optimization algorithm are introduced to achieve complementary advantages. To verify the superiority of the proposed algorithm, 19 classical benchmark functions, CEC-C06 2019 test functions and 5 engineering design problems are compared with various advanced metaheuristic algorithms. The experimental data show that the MA-GWO algorithm has significant enhancements over the traditional mayfly algorithm. In several test cases, especially for high-dimensional optimization problems, the MA-GWO algorithm is far superior to other metaheuristic algorithms, has better convergence and stability, and is an effective and feasible algorithm. [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]

Multilevel inverters (MLIs) are one of the most popular topics of power electronics. Selective harmonic elimination (SHE) method is used to eliminate low-order harmonics in the MLI output voltage by determining the optimum switching angles. It includes the solution of nonlinear sets of transcendental equations. The optimization becomes more difficult as the number of levels in MLIs increases. Therefore, various metaheuristic algorithms have emerged toward obtaining optimal solutions to find the switching angles in the SHE problem in the last decade. In this study, a number of recent metaheuristics, such as ant lion optimization (ALO), hummingbird algorithm (AHA), dragonfly algorithm (DA), harris hawk optimization, moth flame optimizer (MFO), sine cosine algorithm (SCA), flow direction algorithm (FDA), equilibrium optimizer (EO), atom search optimization, artificial electric field algorithm and arithmetic optimization algorithm (AOA), are employed as an attempt to find the best optimization framework to identify switching moments in 11-level MLI. Marine predator algorithm (MPA), whale optimization algorithm (WOA), grey wolf optimizer (GWO), particle swarm optimization (PSO), multiverse optimizer (MVO), teaching–learning-based optimization (TLBO), and genetic algorithm (GA), which are widely used in solving this problem, are selected for performance analysis. AHA, ALO, AOA, DA, EO, FDA, GA, GWO, MFO, MPA, MVO, PSO, SCA, SSA, TLBO and WOA methods meet maximum 8% THD requirement specified in IEEE 519 standard in the range of 0.4–0.9 modulation index. Simulation results show that MFO is superior other algorithms in terms of THD minimization, convergence rate, a single iteration time and robustness. [ABSTRACT FROM AUTHOR]

In this study, elliptical antenna arrays (EAAs) with low maximum side lobe levels (MSLs) and fixed half-power beam width has been synthesized with novel meta-heuristic methods, namely, Archimedes Optimization Algorithm (AOA) and Chimp Optimization Algorithm (ChOA). In order to use the communication systems effectively and efficiently in recent years, application-specific antenna designs have become more important. In this specialization in wireless communication, interest in the optimum design of EAA specially designed for the application has increased. Two different cases are discussed in this study. In the first case, the angular position of the EAA elements are fixed and the amplitude values are optimally determined by AOA and ChOA methods to obtained radiation patterns with reduced MSLs. Assuming that the elements in the antenna array are fed uniformly and the current amplitude values are all one, the angular positions of the elements are found by the proposed novel optimization methods to minimize MSLs in the second case. To test the flexibility and performance of the proposed methods, three different designs of the 8, 12 and 20 elements EAA are considered. The results of the AOA and ChOA methods are compared with the current results obtained by Antlion Optimisation and Symbiotic Organisms Search in the literature. In addition, the statistical performances of the proposed methods are compared. It has been observed that generally the results obtained with the AOA method are better than other compared methods. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc Networks (VANETs) can be designed in a way to organize road protection with no specific need for any fixed infrastructure. Accordingly, the movement of all vehicles can be planned according to perceived information, and Quality of Services Routing (QoSR) algorithms can be pressured according to its available options, paths, and links, and according to the criteria and reliability of the QoSR. Ensure that QoSR is aware of the environment of the network of vehicles, including location of vehicles, direction, and speed. This study is to reduce the effects of unpredictable problems on the best pathway to replace the broken path/link. A QoSR with Particle Swarm Optimization (QoSR-PSO) is used in this article for improving QoSs in vehicular ad hoc networks. By modeling the behavior of a group of particles, particle swarm optimization algorithms find the best possible solution to the problem. In order to perform simulation experiments, NS2 simulator and VanetMobisim have been used. The comparison results with benchmark studies show the improvement in packet delivery rate (PDR), delay, Packet Drop, and overload. [ABSTRACT FROM AUTHOR]

Breast cancer has become a common malignancy in women. However, early detection and identification of this disease can save many lives. As computer-aided detection helps radiologists in detecting abnormalities efficiently, researchers across the world are striving to develop reliable models to deal with. One of the common approaches to identifying breast cancer is through breast mammograms. However, the identification of malignant breasts from mass lesions is a challenging research problem. In the current work, we propose a method for the classification of breast mass using mammograms which consists of two main stages. At first, we extract deep features from the input mammograms using the well-known VGG16 model while incorporating an attention mechanism into this model. Next, we apply a meta-heuristic called Social Ski-Driver (SSD) algorithm embedded with Adaptive Beta Hill Climbing based local search to obtain an optimal features subset. The optimal features subset is fed to the K-nearest neighbors (KNN) classifier for the classification. The proposed model is demonstrated to be very useful for identifying and differentiating malignant and healthy breasts successfully. For experimentation, we evaluate our model on the digital database for screening mammography (DDSM) database and achieve 96.07% accuracy using only 25% of features extracted by the attention-aided VGG16 model. The Python code of our research work is publicly available at: https://github.com/Ppayel/BreastLocalSearchSSD. [ABSTRACT FROM AUTHOR]

In this paper, the feasibility of Structural Health Monitoring (SHM) employing a novel Fibonacy Sequence (FS)-based Optimization Algorithms (OAs) and up-to-date computing techniques is investigated for a large-scale railway bridge. During recent decades, numerous metaheuristic intelligent OAs have been proposed and immediately gained a lot of momentum. However, the major concern is how to employ OAs to deal with real-world problems, especially the SHM of large-scale structures. In addition to the requirement of high accuracy, a high computational cost is putting up a major barrier to the real application of OAs. Therefore, this article aims at addressing these two aforementioned issues. First, we propose employing the optimal ability of the golden ratio formulated by the well-known FS to remedy the shortcomings and improve the accuracy of OAs, specifically, a recently proposed new algorithm, namely Salp Swarm Algorithm (SSA). On the other hand, to deal with the high computational cost problems of OAs, we propose employing an up-to-date computing technique, termed superscalar processor to conduct a series of iterations in parallel. Moreover, in this work, the vectorization technique is also applied to reduce the size of the data. The obtained results show that the proposed approach is highly potential to apply for SHM of real large-scale structures. [ABSTRACT FROM AUTHOR]

This study proposes a novel population-based metaheuristic algorithm called the Gazelle Optimization Algorithm (GOA), inspired by the gazelles' survival ability in their predator-dominated environment. Every day, the gazelle knows that if it does not outrun and outmaneuver its predators, it becomes meat for the day, and to survive, the gazelles have to escape from their predators consistently. This information is vital to proposing a new metaheuristic algorithm that uses the gazelle's survival abilities to solve real-world optimization problems. The exploitation phase of the algorithm simulates the gazelles grazing peacefully in the absence of the predator or while the predator is stalking it. The GOA goes into the exploration phase once a predator is spotted. The exploration phase consists of the gazelle outrunning and outmaneuvering the predator to a safe haven. These two phases are iteratively repeated, subject to the termination criteria, and finding optimal solutions to the optimization problems. The robustness and efficiency of the developed algorithm as an optimization tool were tested using benchmark optimization test functions and selected engineering design problems (fifteen classical, ten composited functions, and four mechanical engineering design problems). The results of the GOA are compared with nine other state-of-the-art algorithms. The simulation results obtained confirm the superiority and competitiveness of the GOA algorithm over nine state-of-the-art algorithms available in the literature. Also, the standard statistical analysis test carried out on the results further confirmed the ability of GOA to find solutions to the selected optimization problems. It also showed that GOA performed better or, in some cases, was very competitive with some state-of-the-art algorithms. Also, the results show that GOA is a potent tool for optimization that can be adapted to solve problems in different optimization domains. [ABSTRACT FROM AUTHOR]

Most swarm intelligence algorithms are stochastic metaheuristic algorithms in nature, and thus they may not solve all optimisation problems perfectly. Different algorithms may have different advantages, and the different real cases should be analysed independently. In this paper, a new brick-up re- building method for metaheuristic algorithms is proposed and discussed. This brick-up method creatively separates the metaheuristic algorithms into components (bricks) and generate a brick pool for further use. Then a new and best fitting algorithm will be generated custom-made to different problem and suggested to user as the best solution available in metaheuristic design. The main contributions for this research are the metaheuristic brick selection rules analysis and brick-up system model simulation. The proposed model has been tested on CEC 2015 benchmark function sets to verify its performance. The experimental results show that this recombination model can produce a metaheuristic algorithm that is as efficient as each individual candidate algorithm or better. [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]

With the development of websites and social networks, Internet users generate a massive amount of comments and information on the Web. Sentiment analysis, also called opinion mining, offers an opportunity to mine the people's sentiments and emotions from the textual comments. In the last decade, sentiment analysis has been applied in research areas such as recommendation and support systems and has become an area of interest for many researchers. Therefore, many studies have been carried out on English, while other languages, such as Arabic, received less attention. Increasingly, sentiment analysis researchers use machine learning due to its excellent performance. However, the generated models are black boxes and non-interpretable by the users. The rule-based classification is a promising approach for generating interpretable models. This work proposes a classification rule-based Arabic sentiment analysis approach together with a new binary equilibrium optimization metaheuristic algorithm as an optimization method for classification rule generation from Arabic documents. The proposed approach has been experimented on the Opinion Corpus for Arabic (OCA) and generates a classification model of thirteen rules. The comparison results with state-of-the-art methods show that the proposed approach outperforms all other white-box models regarding classification accuracy. [ABSTRACT FROM AUTHOR]

The firefly algorithm (FA) and the artificial bee colony (ABC) algorithm are used in this study to perform a coordinated parametrization of the proportional-integral and supplementary damping controllers, i.e., power system stabilizers (PSSs) and the unified power flow controller (UPFC)–power oscillation damping set. The parametrization obtained for the controllers should allow them to damp the low-frequency oscillatory modes in the power system for different loading scenarios. The power system dynamics is represented using a model based on current injections, known as the current sensitivity model, which implies that a formulation by current injections for the UPFC should be formulated. To validate the proposed optimization techniques and the current injection model for the UPFC for small-signal stability, simulations are carried out under two distinct perspectives, namely, static and dynamic analysis, using the New England system. The results demonstrated the effectiveness of the UPFC's current injection model. Moreover, it was possible to verify that the FA performed better than the ABC algorithm to solve the discussed problem, accrediting both the UPFC current injection model and the FA algorithm as new tools for small-signal stability analysis in electrical power systems. [ABSTRACT FROM AUTHOR]

Human learning optimization (HLO) is a simple yet powerful metaheuristic developed based on a simplified human learning model. Competition and cooperation, as two basic modes of social cognition, can motivate individuals to learn more efficiently and improve their efficiency in solving problems by stimulating their competitive instincts and increasing interaction with each other. Inspired by this fact, this paper presents a novel human learning optimization algorithm with competitive and cooperative learning (HLOCC), in which a competitive and cooperative learning operator (CCLO) is developed to mimic competition and cooperation in social interaction for enhancing learning efficiency. The HLOCC can efficiently maintain the diversity of the algorithm as well as achieve the optimal values, demonstrating that the proposed CCLO can effectively improve algorithm performance. HLOCC has been compared with other heuristic algorithms on CEC2017 functions. In the second study, the uncapacitated facility location problems (UFLPs) which are one of the pure binary optimization problems are solved with HLOCC. The experimental results show that the developed HLOCC is superior to previous HLO variants and other metaheuristics with its improved exploitation and exploration abilities. [ABSTRACT FROM AUTHOR]

The purpose of this study is to solve the multi-instance classification problem by maximizing the area under the Receiver Operating Characteristic (ROC) curve obtained for witness instances. We derive a mixed integer linear programming model that chooses witnesses and produces the best possible ROC curve using a linear ranking function for multi-instance classification. The formulation is solved using a commercial mathematical optimization solver as well as a fast metaheuristic approach. When the data is not linearly separable, we illustrate how new features can be generated to tackle the problem. We present a comprehensive computational study to compare our methods against the state-of-the-art approaches in the literature. Our study reveals the success of an optimal linear ranking function through cross validation for several benchmark instances. [ABSTRACT FROM AUTHOR]

Clustering is a technique of grouping the data objects into clusters. Many metaheuristic algorithms based on swarm intelligence, physic laws, and chemical reactions, among others, have been developed for clustering. In this study, an enhanced whale optimization algorithm (EWOA) is introduced to solve clustering problems. The whale optimization algorithm (WOA) is adapted and enhanced with two additional operational procedures. The position update equations from the water wave optimization algorithm are incorporated into the algorithm to improve the search space and accelerate the convergence rate. The tabu and neighbourhood search mechanisms were added to handle the local optima situation. The efficiency of the proposed EWOA is measured using a simulation-based experiment conducted on eight benchmark datasets, and the results obtained are then compared to seven existing clustering algorithms/techniques. The performance of each algorithm is compared and analyzed using the average intra-cluster distance and f-measure parameters. The experimental results demonstrated the applicability and feasibility of the enhancements that were made and proved the superiority of the proposed EWOA clustering algorithm. [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]