Search

Ship maintenance service optimisation is of great significance for improving the competitiveness of shipbuilding enterprises. In this paper, we investigate a ship maintenance service scheduling problem considering the deteriorating maintenance time, distributed maintenance tasks, and limited maintenance teams. The objective is to minimise the service span. First, we construct an initial mixed-integer programming model for the studied problem. Then, through the property analysis of the problem with a single maintenance team, an exact scheduling algorithm is proposed. In addition, the lower bound of the problem with multiple maintenance teams is derived. A scheduled rule is developed to obtain the lower bound for the problem. Based on the property analysis, the original mixed-integer programming model is simplified to an improved mathematical programming model. Since the studied problem is NP-hard, this paper proposes two heuristic algorithms and an integrated metaheuristic algorithm based on the variable neighbourhood search to obtain approximate optimal solutions in a reasonable time. In computational experiments, the two models can solve problems on small scale, while metaheuristics can find approximately optimal solutions in each problem category. Moreover, the computational results validate the performance of the proposed integrated metaheuristic in terms of convergence and stability. [ABSTRACT FROM AUTHOR]

Feature Selection (FS), a pre-processing step used in the majority of big data processing applications, aims to eliminate irrelevant and redundant features from the data. Its purpose is to select a final set of data characteristics that best represent the data as a whole. To achieve this, it explores every potential solution in order to identify the optimal subset. Meta-heuristic algorithms have been found to be particularly effective in solving FS problems, especially for high-dimensional datasets. This work adopts a recently developed meta-heuristic called the White Shark Optimizer (WSO) due to its simplicity and low computational overhead. However, WSO faces challenges in effectively balancing exploration and exploitation, particularly in complex multi-peak search problems. It tends to converge prematurely and get stuck in local optima, which can lead to poor search performance when dealing with FS problems. To overcome these issues, this paper presents three enhanced binary variants of WSO for well-known FS problems. These variants are as follows: (1) Binary Distribution-based WSO (BDWSO), where the algorithm refines the positions of white sharks by considering both the average and standard deviation of the current shark, the local best shark, and the global best shark. This strategy is designed to alleviate issues of premature convergence and stagnation during iterations , (2) Binary Sine Cosine WSO (BSCWSO), which uses sine and cosine adaptive functions for the social and cognitive components of the position update rule, and (3) Binary Hybrid Sine Cosine WSO (BHSCWSO), which employs sine and cosine acceleration factors to regulate local search and achieve convergence to the global optimal solution. Additionally, the population was initialized using the Opposition-Based Learning (OBL) mechanism, and the sine map was used to modify the inertia weight of WSO. These revised variants of WSO were established to have a better harmony between the exploration and exploitation facets. The proposed methods were extensively compared to the fundamental binary WSO and other well-known algorithms in the field. The experimental findings and comparisons demonstrate that the proposed methods outperform the conventional and most evaluated similar algorithms in terms of robustness and solution quality. In terms of classification accuracy, number of selected features, specificity, sensitivity, and fitness values, the proposed BHSCWSO optimizer performed better than all other proposed peer optimizers, including BSWO, BDWSO, and BSCWSO, in 11, 8, 13, 18, and 10 datasets, respectively. The proposed BHSCWSO optimizer showed performance levels of more than 90% in terms of accuracy, sensitivity, and specificity metric measures on 15, 14, and 11 of the 24 datasets deemed. [ABSTRACT FROM AUTHOR]

The lemur optimizer (LO) is a new metaheuristic algorithm that is inspired by the two primary locomotive patterns of the lemurs. However, LO suffers from improper balance between exploration and exploitation phases and sub-optimal solution stagnation due to poor exploration capability. To address these limitations, an improved lemur optimizer (ILO) with dynamic scaling factors and Gaussian mutation is introduced in this paper. The dynamic scaling factors balance the exploration and exploitation transition by dynamically adjusting their values throughout the optimization process. The proposed algorithm incorporates Gaussian mutation to induce diversity in the population and hence improve the exploration capability. The efficiency of the proposed approach is tested on 33 functions including classical benchmark and CEC-2019 test functions, and a comprehensive comparison is made with six other well-known metaheuristic algorithms. The simulation and statistical results indicate superior performance of ILO in achieving optimal solutions compared to the competing algorithms. The algorithm is further employed to address two constrained classical engineering design problems, demonstrating its robustness. [ABSTRACT FROM AUTHOR]

Traditional deterministic optimization algorithms are difficult to effectively solve many real-world nonlinear, complex, and high-dimensional optimization problems. The metaheuristic optimization algorithm has evolved in recent years into a kind of very popular algorithm due to its gradient-free and random nature. In this paper, a new metaheuristic algorithm, namely the literature research optimization algorithm (LRO), is proposed. In this algorithm, the literature research process is represented as a mathematical model, and new mechanisms are designed to help realize the global exploration and local exploitation. To evaluate the performance of LRO, three sets of test functions including the standard benchmark set, CEC2017, and CEC2019 are applied first, and then, six engineering problems are employed to further verify it. The Friedman test and Wilcoxon rank sum test are also used to statistically compare the proposed LRO algorithm with ten common existing metaheuristics. The results show that the LRO algorithm outperforms the comparison algorithms on most benchmark functions and that it also performs well in practical engineering applications. The LRO algorithm can provide superior solutions to most optimization problems compared to other metaheuristic algorithms and become a promising candidate for many real-life optimization problems. [ABSTRACT FROM AUTHOR]

The DWCS (dynamic wireless charging system) is an innovative electric vehicle charging solution that allows for charging while the vehicle is in motion without requiring direct physical contact. This groundbreaking technology has the capacity to significantly reduce the size of electric vehicle batteries and improve battery life if the DWCS is installed correctly along the route. However, using smaller batteries and improving battery life requires more DWCS stations to be installed along the route. This becomes more challenging due to the heterogeneity of battery vehicles, making finding the optimal compromise between batteries cost and charging infrastructure cost complex since each type has unique characteristics. To address this challenge, we present a quantitative analysis of the benefits of dynamic charging using a mathematical model that considers both batteries and charging infrastructure costs, considering the heterogeneity and life of battery vehicles. Our analysis focuses on identifying how much batteries cost can be reduced to decrease system costs while demonstrating the benefits of dynamic charging on battery life. In the resolution stage, we have created an innovative approach that utilizes multi-agent systems and reinforcement learning, explicitly Q-learning, within the framework of distributed artificial intelligence. [ABSTRACT FROM AUTHOR]

This study fixates on determining the optimum laser input parameters that simultaneously meet the desired kerf width and depth during CO2 laser cutting of various polymethylmethacrylate (PMMA) sheets. It has three contributions. The first is to model the cutting process of PMMA by polynomial curve fitting as a function of laser power, laser speed, and standoff distance. R-squared (R2), adjusted R2 and root-mean-square error (RMSE) criteria were taken into account to measure the performance of the proposed model. The effect of laser parameters on the process is investigated by analysis of variance (ANOVA) and sensitivity analysis. The second is to optimize the derived nonlinear regression models using genetic algorithm (GA), particle swarm optimization (PSO), whale optimization algorithm (WOA) and ant lion optimization (ALO) metaheuristic methods and compare the performances of the algorithms. The third is to compare the adequacy of the optimization process with the artificial neural network (ANN). The investigations exhibited that the best-fitting polynomials are obtained with the R2 and adjusted R2 values of over 99% and 97%, respectively. ANOVA and sensitivity test revealed that the sensitivity of the laser power, which is the most effective parameter, was 150 at low powers and decreased to 0 as the power value increased. When the nozzle distance is 4.1, the proposed metaheuristics gave effective and sufficiently accurate results. PSO stood out in terms of both best cost value (3.49 × 10–8) and relative error value (0.19%). The relative error of the ANN was found as 3% in terms of kerf depth. [ABSTRACT FROM AUTHOR]

In this study, a machine learning-based hybrid optimization method is developed to optimize tuned mass damper considering soil-structure interaction. A total of 200,000 time history analyses of the tuned mass damper-structure-soil system are conducted and the results are used to construct the database of six machine learning models. Three meta-heuristic algorithms are used for optimization. A weighted optimization algorithm is developed based on the three individual optimization algorithms. Compared with three individual optimization algorithms, the weighted optimization algorithm can achieve better optimization results. The robustness of the single ground motion-based optimization applied to other ground motions is also investigated. [ABSTRACT FROM AUTHOR]

This paper proposes a metaheuristic algorithm, called advanced differential evolution (ADE), by improving the DE algorithm. The ADE algorithm was developed with the goal of creating an optimization framework that addresses the challenges of exploration and exploitation balance, avoiding local minima, utilizing chaos theory for diverse initialization, and improving solution quality and convergence speed. By incorporating these features, ADE aims to enhance the effectiveness of optimization processes. The proposed algorithm utilizes chaos theory to generate the initial population, which is subsequently divided into two sub-populations with adaptive sizes. The size of each sub-population is determined using a formula based on the number of iterations during the algorithm's execution. The first sub-population has a larger size in the beginning and the second one has a smaller size, but the total size of these two populations is always constant. The main contribution of this paper is the proposal of two novel improved differential evolution algorithms, namely MDE1 and MDE2, which are utilized for exploration within these sub-populations. The proposed ADE is tested on 29 well-known benchmarks and six engineering problems, and the results are compared with seven other algorithms. Various statistical experiments are carried out showing that the proposed algorithm provides significant superiority over other well-known algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a novel bio-inspired metaheuristic algorithm termed the Fossa Optimization Algorithm (FOA), which emulates the natural hunting behavior of the fossa in its habitat. FOA draws its core inspiration from the two-stage hunting technique of the fossa, involving an initial attack on a spotted lemur followed by a pursuit through the trees. The theoretical framework of FOA is elaborated, and its implementation is mathematically modeled in two distinct phases: (i) exploration, which simulates the fossa's positional adjustments during the initial attack on the lemur, and (ii) exploitation, which models the positional changes of the fossa during the chase. The efficacy of FOA is tested against twenty-two constrained optimization problems from the CEC 2011 test suite, as well as four engineering design challenges. The optimization results demonstrate FOA's strong capabilities in both exploration and exploitation, maintaining a balance that facilitates convergence to optimal solutions. FOA's performance is benchmarked against twelve established algorithms, showing that it consistently outperforms its competitors by delivering superior results and ranking as the top optimizer in most of the evaluated functions. These findings indicate that FOA is highly effective in addressing optimization tasks in real-world scenarios. [ABSTRACT FROM AUTHOR]

Economic dispatch (ED) problem is a popular optimization problem in electrical engineering. Many studies that handled ED problem employed metaheuristics as the optimization technique. Unfortunately, these metaheuristics are old or the existing ones. Meanwhile, ED problem is not the favourite constrained case in studies that introduced a novel metaheuristic. This research introduces a novel metaheuristic called quadratic time optimization (QTO). QTO comprises three sequential searches where both diversification and intensification are blended in every search. But the portion of both orientations changes by following the quadratic time. The appraisal of QTO is performed by employing it to solve both unconstrained and constrained problems. The 23 traditional functions represent the unconstrained problem while economic load dispatch (ELD) problem with valve point effect and spinning reserve problem represents the constrained problem. In both appraisals, there are five novel metaheuristics represent the benchmarks, including: walrus optimization algorithm (WaOA), coati optimization algorithm (COA), total interaction algorithm (TIA), addax optimization algorithm (AOA), and language education optimization (LEO). The result shows the competitiveness of the proposed QTO in handling both unconstrained and constrained problems. QTO becomes the first best in 8 functions out of 23 functions including five high dimension unimodal functions, two high dimension multimodal functions, and one fixed dimension multimodal functions. The result also shows that QTO is competitive in three use cases in ELD problems as the ratio between the range and average total cost among metaheuristics for the first, second, and third cases is 0.72, 0.04, and 0.02 percent consecutively. [ABSTRACT FROM AUTHOR]

Cardio Vascular Diseases (CVD) has become a serious concern for humans as fatalities rate due to CVD are increasing at an alarming pace. With the aid of machine learning techniques, heart illnesses can be predicted much earlier, and therapy or dietary changes can prevent deaths. By combining predictions from various individual models, the machine learning technique known as ensemble learning improves forecasting accuracy and resiliency. In this work, a Super Learner Ensemble Model is used where the base learners are a diverse combination of linear, probabilistic, bagging, boosting and stacking models. To improve the performance of the Super Learner Ensemble Model, an Optimized Super Learner Ensemble Model (OSLEM) is proposed, where optimal selection of base learners in the ensemble is done based on the pairwise disagreement accuracy diversity measure of classifiers in each best fitness whale obtained by different iterations of Whale Optimization Algorithm (WOA). ModifiedBoostARoota (MBAR), a wrapper feature selection technique is used to choose the most significant features of six different heart datasets and the proposed OSLEM modelled on the selected features exhibits high performance compared to other existing ensemble models. [ABSTRACT FROM AUTHOR]

Accurate estimation of reference evapotranspiration (ET0) is a crucial parameter in implementing precise irrigation strategies and managing regional water resources effectively. While various methods have been proposed to obtain accurate ET0, the conventional approach is complex, uneconomical, and unable to contend with the rising variability and unpredictable weather patterns. Meanwhile, the lack of meteorological data limits the accurate estimation of ET0 via empirical models. Considering the recent approach in coupling ML techniques with optimisation algorithms to enhance the accuracy and robustness of ET0 estimation, this study was conducted to explore the performance of optimised hybrid Support Vector Regression (SVR) models integrated with meta-heuristic algorithms for daily ET0 estimation in Malaysia. Four hybrid SVR models, including SVR-Particle Swarm Optimisation (SVR-PSO), SVR-Whale Optimisation Algorithm (SVR-WOA), SVR-Differential Evolution (SVR-DE), and SVR-Covariance Matrix Adaptation Evolution Strategy (SVR-CMAES), were developed and assessed using the Root Mean Square Error (RMSE), Mean Absolute Error (MAE), coefficient of determination (R2), and Global Performance Index (GPI). The accuracy of the hybrid SVR models was then compared against standalone Machine Learning (ML) and empirical models using limited meteorological data. Accordingly, the findings highlighted the superior accuracy of the SVR-PSO model in estimating ET0, followed closely by the SVR-DE and SVR-CMAES models. The outstanding performance of the SVR-PSO model was attributed to the inherent versatility and robustness of PSO, as well as its core social behaviour and swarm intelligence principles that allow for an exhaustive exploration of the solution space, thus enhancing the model's accuracy and reliability. In conclusion, the integration of SVR with the meta-heuristics algorithm represents a significant advancement in ET0 estimation models with enhanced accuracy. The study underlines the critical role of advanced hybrid models in enhancing ET0 prediction accuracy, thereby supporting the implementation of efficient water resource management and strategic planning across Malaysia. [ABSTRACT FROM AUTHOR]

This article presents the modified Chernobyl disaster optimizer (CDO) method for DC motor control to find the optimal proportional integral derivative (PID) settings. DC motors are widely used machinery. DC motors are also simple to use. The detonation of the Chernobyl nuclear reactor core served as the inspiration for the idea and guiding principles of the CDO. CDO has limitations in the stability of exploration and exploitation areas. This research aims to obtain a new balance of exploration and exploitation. This study suggests incorporating the levy flight and chaotic algorithm (CA) techniques to enhance the CDO method. This study was conducted with the MATLAB/Simulink software. A comparative technique, which included the marine predator algorithm (MPA), golden jackal optimization (GJO), and CDO, was utilized to determine the performance of the MCDO method. According to the study’s findings, the MCDO method’s overshoot value outperformed all other approaches. [ABSTRACT FROM AUTHOR]

Supply chain efficiency is a major challenge in today's business environment, where efficient resource allocation and coordination of activities are essential for competitive advantage. Traditional efficiency strategies often struggle for resources for the complex and dynamic network. In response, bio-inspired metaheuristic algorithms have emerged as powerful tools to solve these optimization problems. Referring to the random search nature of metaheuristic algorithms and emphasizing that no metaheuristic algorithm is the best optimizer for all optimization applications, the No Free Lunch (NFL) theorem encourages researchers to design newer algorithms to be able to provide more effective solutions to optimization problems. Motivated by the NFL theorem, the innovation and novelty of this paper is in designing a new meta-heuristic algorithm called Bobcat Optimization Algorithm (BOA) that imitates the natural behavior of bobcats in the wild. The basic inspiration of BOA is derived from the hunting strategy of bobcats during the attack towards the prey and the chase process between them. The theory of BOA is stated and then mathematically modeled in two phases (i) exploration based on the simulation of the bobcat's position change while moving towards the prey and (ii) exploitation based on simulating the bobcat's position change during the chase process to catch the prey. The performance of BOA is evaluated in optimization to handle the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100, as well as to address CEC 2020. The optimization results show that BOA has a high ability in exploration, exploitation, and balance them during the search process in order to achieve a suitable solution for optimization problems. The results obtained from BOA are compared with the performance of twelve well-known metaheuristic algorithms. The findings show that BOA has been successful in handling the CEC 2017 test suite in 89.65, 79.31, 93.10, and 89.65% of the functions for the problem dimension equal to 10, 30, 50, and 100, respectively. Also, the findings show that in order to handle the CEC 2020 test suite, BOA has been successful in 100% of the functions of this test suite. The statistical analysis confirms that BOA has a significant statistical superiority in the competition with the compared algorithms. Also, in order to analyze the efficiency of BOA in dealing with real world applications, twenty-two constrained optimization problems from CEC 2011 test suite and four engineering design problems have been selected. The findings show that BOA has been successful in 90.90% of CEC2011 test suite optimization problems and in 100% of engineering design problems. In addition, the efficiency of BOA to handle SCM applications has been challenged to solve ten case studies in the field of sustainable lot size optimization. The findings show that BOA has successfully provided superior performance in 100% of the case studies compared to competitor algorithms. [ABSTRACT FROM AUTHOR]

The reliable operation of power systems while integrating renewable energy systems depends on Optimal Power Flow (OPF). Power systems meet the operational demands by efficiently managing the OPF. Identifying the optimal solution for the OPF problem is essential to ensure voltage stability, and minimize power loss and fuel cost when the power system is integrated with renewable energy resources. The traditional procedure to find the optimal solution utilizes nature-inspired metaheuristic optimization algorithms which exhibit performance drop in terms of high convergence rate and local optimal solution while handling uncertainties and nonlinearities in Hybrid Renewable Energy Systems (HRES). Thus, a novel hybrid model is presented in this research work using Deep Reinforcement Learning (DRL) with Quantum Inspired Genetic Algorithm (DRL-QIGA). The DRL in the proposed model effectively combines the proximal policy network to optimize power generation in real-time. The ability to learn and adapt to the changes in a real-time environment makes DRL to be suitable for the proposed model. Meanwhile, the QIGA enhances the global search process through the quantum computing principle, and this improves the exploitation and exploration features while searching for optimal solutions for the OPF problem. The proposed model experimental evaluation utilizes a modified IEEE 30-bus system to validate the performance. Comparative analysis demonstrates the proposed model's better performance in terms of reduced fuel cost of $620.45, minimized power loss of 1.85 MW, and voltage deviation of 0.065 compared with traditional optimization algorithms. [ABSTRACT FROM AUTHOR]

Nanofluids, characterized by the dispersion of nanoparticles in a base liquid, have attracted significant attention in recent years due to their exceptional thermal properties. Specifically, the specific heat capacity of nanofluids plays a crucial role in the design and optimization of heat transfer systems. Traditional experimental methods for determining the specific heat capacity of nanofluids are often limited in terms of cost, time, and operating condition ranges. To address these limitations, this research focuses on the development of a novel predictive model for estimating the specific heat capacity of nanofluids. This study aims to develop a machine learning regression model called Gradient Boost Regression (GBR) with Grid Search optimization (GSO) for accurately predicting the specific heat capacity of aluminum nitride (Al2N3) nanoparticles that are suspended in both water and an ethylene glycol (EG) solution. The GBR-GSO model capitalizes on the strengths of GBR, which can effectively capture complex relationships, and GSO, a metaheuristic optimization technique inspired by the law of gravity. By integrating these two approaches, we aim to create a robust and accurate predictive model for specific heat capacity in nanofluids. To develop and validate the GBR-GSO model, a diverse dataset based on experimental-specific heat capacity collected from the literature has been designed. The performance of the model has been evaluated by comparing its predictions with experimental data. The GBR-GSO model achieved 99.99% accuracy with the experimental data of specific heat capacity. This research contributes to the advancement of nanofluid-based heat transfer systems by providing an effective tool for predicting the specific heat capacity of nanofluids. The developed model can facilitate the design and optimization of various engineering applications, leading to the development of energy-efficient and sustainable technologies. [ABSTRACT FROM AUTHOR]

Biomass supply chain (BSC) activities have caused social and environmental disruptions, such as climate change, energy security issues, high energy demand, and job opportunities, especially in rural areas. Moreover, different economic problems have arisen globally in recent years (e.g., the high costs of BSC logistics and the inefficiency of generating bioenergy from low-energy-density biomass). As a result, numerous researchers in this field have focused on modeling and optimizing sustainable BSC. To this end, this study aims to develop a multi-objective mathematical model by addressing three sustainability pillars (economic cost, environmental emission, and job creation) and three decision levels (i.e., strategic (location of facilities), tactical (type of transportation and routing), and operational (vehicle planning). A palm oil BSC case study was selected in the context of Malaysia in which two advanced evolutionary algorithms, i.e., non-dominated sorting genetic algorithm II (NSGA-II) and Multiple Objective Particle Swarm Optimization (MOPSO), were implemented. The study results showed that the highest amounts of profit obtained from the proposed supply chain (SC) design were equal to $13,500 million and $7000 million for two selected examples with maximum emissions. A better target value was achieved in the extended example when 40% profit was reduced, and the minimum emissions from production and transportation in the BSC were attained. In addition, the results demonstrate that more Pareto solutions can be obtained using the NSGA-II algorithm. Finally, the technique for order of preference by similarity to the ideal solution (TOPSIS) was adopted to balance the optimum design points obtained from the optimization algorithm solutions through two-objective problems. The results indicated that MOPSO worked more efficiently than NSGA-II, although the NSGA-II algorithm succeeded in generating more Pareto solutions. [ABSTRACT FROM AUTHOR]

This research presents a comprehensive comparative analysis of optimization techniques for achieving the optimal design of cellular beams. The incorporation of gaps within cellular beams reduces the weight of the beam and increases section height, resulting in the production of lighter and stronger sections. The Taguchi method is employed to fine-tune the parameters of the Grey Wolf Optimizer, enabling the achievement of a robust design. The performance of each algorithm is evaluated through three design examples, facilitating comprehensive comparisons among the seven algorithms. Moreover, the study encompasses the modeling and analysis of optimally designed cellular beams using finite element software. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a novel optimization algorithm called the OX optimizer, inspired by oxen animals, which are characterized by their great strength. The OX optimizer is designed to address the challenges posed by complex, high-dimensional optimization problems. The design of the OX optimizer embodies a fundamental symmetry between global and local search processes. This symmetry ensures a balanced and effective exploration of the solution space, highlighting the algorithm's innovative contribution to the field of optimization. The OX optimizer has been evaluated on CEC2022 and CEC2017 IEEE competition benchmark functions. The results demonstrate the OX optimizer's superior performance in terms of convergence speed and solution quality compared to existing state-of-the-art algorithms. The algorithm's robustness and adaptability to various problem landscapes highlight its potential as a powerful tool for solving diverse optimization tasks. Detailed analysis of convergence curves, search history distributions, and sensitivity heatmaps further support these findings. Furthermore, the OX optimizer has been applied to optimize support vector machines (SVMs), emphasizing parameter selection and feature optimization. We tested it on the NSL-KDD dataset to evaluate its efficacy in an intrusion detection system. The results demonstrate that the OX optimizer significantly enhances SVM performance, facilitating effective exploration of the parameter space. [ABSTRACT FROM AUTHOR]

In recent decades, the demand for optimization techniques has grown due to rising complexity in real-world problems. Hence, this work introduces the Hyperbolic Sine Optimizer (HSO), an innovative metaheuristic specifically designed for scientific optimization. Unlike conventional approaches, HSO takes a unique approach by engaging individual members of the population, ensuring a comprehensive exploration of solution spaces. Employing distinctive exploration and exploitation phases, coupled with hyperbolic sinh function convergence, the optimizer enhances speed, simplify parameter adjustment, alleviates slow convergence, and demonstrates efficiency in high-dimensional optimization. This approach is designed to tackle optimization challenges and enhance adaptability in unpredictable real-world scenarios. The evaluation of HSO's performance unfolds through four distinct testing phases. Initially, a set of 65 widely recognized benchmark functions is employed. These functions cover both unimodal and multi-modal varieties across dimensions of 30, 100, 500, and 1000, including fixed-dimensional functions, to comprehensively assess the exploration, exploitation, local optima avoidance, and convergence capabilities of the proposed algorithm. The results of the HSO algorithm are then compared to those of 15 state-of-the-art metaheuristic algorithms and 8 recently published algorithms. Secondly, HSO's performance is assessed in comparison with the benchmark suite from the Institute of Electrical and Electronics Engineers (IEEE) Congress on Evolutionary Computation (CEC). This suite includes 15 benchmark functions for CEC-2015 and an additional 30 benchmark functions for CEC-2017. During the third phase, HSO tackles seven real-world classical engineering design problems by addressing both the constrained and unconstrained optimization challenges of IEEE CEC-2020. Finally, HSO undertakes training for a multilayer perceptron, utilizing four distinct datasets. To qualitatively assess HSO's performance, two statistical analyses—the Friedman and T tests—are employed. The findings of HSO showcase its adaptability and effectiveness as a high-performing optimizer in engineering optimization challenges. Note that the source code of the HSO algorithm are publicly accessible via https://github.com/Shivankur07/Hyperbolic-Sine-Optimizer.git. [ABSTRACT FROM AUTHOR]

Sleep Apnea (SA) is a breathing disorder that many people experience during sleep. Polysomnography is the best way to diagnose SA, but it requires significant time, cost, and effort. A practical and efficient method of diagnosing SA is using a wearable sensor to record Electrocardiography (ECG) signals. Machine learning algorithms can be used to classify SA by extracting features from ECG signals. Recently, deep learning techniques such as Convolutional Neural Network (CNN) have been used to identify features from ECG data automatically. However, the large number of hyperparameters in CNN makes it challenging to perform this task manually. Metaheuristic algorithms such as Honey Badger Algorithm (HBA) have been successfully applied to tune CNN hyperparameters, but it still has issues with premature convergence. To address these issues, the Bare-Bones Honey Badger Algorithm (BBHBA) is proposed as an improved version of HBA. It improves the exploitation potential of solutions, reduces diversity spillover, and maintains solution diversity. The method generates new candidate solutions using Gaussian search equations and an inverse hyperbolic cosine control mechanism. The greedy selection strategy is used to improve the searcher's capabilities effectively. To validate the proposed deep learning model, the PhysioNet Apnea-ECG database is used. The model achieves an accuracy of 90.92%, a sensitivity of 91.24%, a specificity of 90.36%, and an F1 score of 92.76% on the validation dataset. Overall, the proposed method provides a practical and efficient way to diagnose SA using wearable sensors and deep learning techniques. The BBHBA algorithm improves the performance of CNN by effectively tuning hyperparameters, providing more accurate results in SA diagnosis. [ABSTRACT FROM AUTHOR]

Advanced brain cancer is the deadliest type with just a few months survival rate. Existing technologies hinder the objective of forecasting cancer. This work aims to fulfil the pressing requirement for timely and precise identification of advanced-stage brain tumours, which are notorious for their markedly reduced life expectancy. It presents an innovative hybrid approach for predicting brain tumours and improves diagnostic capabilities. The Multiple Kernel K-Means Cluster Algorithm (MKKCA) is used to segment brain MRI images effectively, differentiating healthy and tumorous tissues. After segmentation, a hybrid approach with 3D-Convolutional Neural Network (CNN) and U-Net has been utilized for classification. The objective is to effectively and accurately distinguish normal and pathological brain images. To enhance the efficiency, we include the Improved Whale Optimization Algorithm (IWOA), which guarantees accurate and dependable performance via location updates. The methodology demonstrates outstanding precision with 98.5% accuracy rate, 98.56% specificity, 91% sensitivity, 87.45% precision and a recall rate of 96% with the F-Measure at 96.02%. These findings, obtained using MATLAB, demonstrate a substantial performance improvement compared to current approaches. This development not only represents a significant addition to diagnostic imaging but also a crucial role in the prediction and treatment of brain cancers. [ABSTRACT FROM AUTHOR]

This research addresses the challenges of using the Rapidly Exploring Random Tree (RRT) algorithm as a mobile robot path planner. While RRT is known for its flexibility and wide applicability, it has limitations, including careful tuning, susceptibility to local minima, and generating jagged paths. The main objective is to improve the smoothness of RRT-generated trajectories and reduce significant path curvature. A novel approach is proposed to achieve these, integrating the RRT path planner with a modified version of the Whale Optimization Algorithm (RRT-WOA). The modified WOA algorithm incorporates parameter variation (C) specifically designed to optimize trajectory smoothness. Additionally, Piecewise Cubic Hermite Interpolating Polynomial (PCHIP) instead of conventional splines for point interpolation further smoothes the generated paths. The modified WOA algorithm is thoroughly evaluated through a comprehensive comparative analysis, outperforming other popular population-based optimization algorithms such as Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), and Firefly Algorithm (FA) in terms of optimization time, trajectory smoothness, and improvement from the initial guess. This research contributes a refined trajectory planning approach and highlights the competitive advantage of the modified WOA algorithm in achieving smoother and more efficient trajectories compared to existing methods. [ABSTRACT FROM AUTHOR]

Methaheuristics (MHs) are techniques widely used for solving complex optimization problems. In recent years, the interest in combining MH and machine learning (ML) has grown. This integration can occur mainly in two ways: ML-in-MH and MH-in-ML. In the present work, we combine the techniques in both ways—ML-in-MH-in-ML, providing an approach in which ML is considered to improve the performance of an evolutionary algorithm (EA), whose solutions encode parameters of an ML model—artificial neural network (ANN). Our approach called TS in EA in ANN employs a reinforcement learning neighborhood (RLN) mutation based on Thompson sampling (TS). TS is a parameterless reinforcement learning method, used here to boost the EA performance. In the experiments, every candidate ANN solves a regression problem known as protein structure prediction deviation. We consider two protein datasets, one with 16,382 and the other with 45,730 samples. The results show that TS in EA in ANN performs significantly better than a canonical genetic algorithm (GA in ANN) and the evolutionary algorithm without reinforcement learning (EA in ANN). Analyses of the parameter's frequency are also performed comparing the approaches. Finally, comparisons with the literature show that except for one particular case in the largest dataset, TS in EA in ANN outperforms other approaches considered the state of the art for the addressed datasets. [ABSTRACT FROM AUTHOR]

The Marine Predators Algorithm (MPA) is a swarm intelligence algorithm developed based on the foraging behavior of the ocean's predators. This algorithm has drawbacks including, insufficient population diversity, leading to trapping in local optima and poor convergence. To mitigate these drawbacks, this paper introduces an enhanced MPA based on Adaptive Sampling with Maximin Distance Criterion (AM) and the horizontal and vertical crossover operators – i.e. Adaptive Crossover-based MPA (AC-MPA). The AM approach is used to generate diverse and well-distributed candidate solutions. Whereas the horizontal and vertical crossover operators maintain the population diversity during the search process. The performance of AC-MPA was tested using 51 benchmark functions from CEC2017, CEC2020, and CEC2022, with varying degrees of dimensionality, and the findings are compared with those of its basic version, variants, and numerous well-established metaheuristics. Additionally, 11 engineering optimization problems were utilized to verify the capabilities of the AC-MPA in handling real-world optimization problems. The findings clearly show that AC-MPA performs well in terms of its solution accuracy, convergence, and robustness. Furthermore, the proposed algorithm demonstrates considerable advantages in solving engineering problems, proving its effectiveness and adaptability. [ABSTRACT FROM AUTHOR]

Nowadays, technology has shifted the way individuals access news from conventional media sources to social media platforms. The active engagement of people with social media platforms leads them to consume news without confirming its source or legitimacy. This facilitated the dissemination of more manipulated and false information in the form of rumors and fake news. Fake news can affect public opinion and create chaos and panic among the population. Thus, it is essential to employ an advanced methodology to identify fake news with high precision. This research work has proposed the concept of the quantum-inspired firefly algorithm with the ant miner plus algorithm (QFAMP) for more effective fake news detection. The proposed QFAMP algorithm utilizes the attributes of quantum computing (QC), the firefly algorithm (FA), and the ant miner plus algorithm (AMP). Here, the QFA approach ensures the effective exploitation of the firefly agents until the agents are able to search for the brighter firefly. Further, the AMP algorithm utilizes the best ants with higher pheromone concentrations for global exploration, which also avoids the premature convergence of the QFA agents. In addition, the AMP algorithm serves as an efficient data mining variant that is effective for the classification of fake news. The efficacy of the proposed QFAMP algorithm is evaluated for the dataset of FakeNewsNet, which is composed of two sub-categories: BuzzFeed and PolitiFact. The experimental evaluations indicate the effective performance of the proposed algorithm compared to the other techniques. [ABSTRACT FROM AUTHOR]

The concept of computational intelligence (CI)-based optimization algorithms emerged in the early 1960s as a more practical approach to the contemporary derivate-based approaches. This paved the way for many modern algorithms to arise with an unprecedented growth rate in recent years, each claiming to have a novel and present a profound breakthrough in the field. That said, many have raised concerns about the performance of these algorithms and even identified fundamental flaws that could potentially undermine the integrity of their results. On that note, the premise of this study was to replicate some of the more prevalent, fundamental components of these algorithms in an abstract format as a measure to observe their behavior in an isolated environment. Six pseudo algorithms were designed to create a spectrum of intelligence behavior ranging from absolute randomness to local search-oriented computational architecture. These were then used to solve a set of centered and non-centered benchmark suites to see if statistically different patterns would emerge. The obtained result clearly highlighted that the algorithm's performance would suffer significantly as these benchmarks got more intricate. This is not just in terms of the number of dimensions in the search space but also the mathematical structure of the benchmark. The implication is that, in some cases, sheer processing resources can mask the algorithm's lack of sufficient intelligence. But as importantly, this study attempted to identify some mechanics and concepts that could potentially cause or amplify this problem. For instance, the excessive use of greedy strategy, a prevalent measure embedded in many modern CI-based algorithms, has been identified as potentially one of these reasons. The result, however, highlights a more fundamental problem in the CI-based optimization field. That is, these algorithms are often treated as a black box. This perception cultivated the culture of not exploring the underlying structure of these algorithms as long as they were deemed capable of generating acceptable results, which permits similar biases to go undetected. [ABSTRACT FROM AUTHOR]

The probabilistic technique was used to optimize the torrefaction parameters that indirectly influence the yield of end-products obtained through the pyrolysis of biomass. In the same pursuit, pine cones underwent thermal pre-treatment at 210 °C, 220 °C, 230 °C, 240 °C, and 250 °C in the presence of N2 gas with a flowing rate of 0.7 L∙s−1, whereas the duration of the pre-treatment process was 5 min, 10 min, and 15 min at each. To facilitate the processing of pine waste, a muffle furnace was improvised for pilot-scale testing. The thermal process used to carry out torrefaction was quasi-static. The average dynamic head of volatile gases inside the chamber was 1.04 m. The criteria for determining the optimal solution were based on calorific value, solid yield, energy consumption during the pre-treatment process, and ash handling. In absolute terms, time and temperature did not influence the statistical deviation in cellulose and hemicellulose decomposition after thermal pre-treatment. While considering ash content as a primal factor, thermal processing should be conducted for 5 min at 210 °C for the bounded operating conditions, which are similar to the operating conditions obtained experimentally. The optimal solid yield would be obtained if the thermal pre-treatment is performed at 250 °C for 5 min. The solution derived through a simulated annealing technique provided a better convergence with the experimental dataset. [ABSTRACT FROM AUTHOR]

This study presents the Hybrid COASaDE Optimizer, a novel combination of the Crayfish Optimization Algorithm (COA) and Self-adaptive Differential Evolution (SaDE), designed to address complex optimization challenges and solve engineering design problems. The hybrid approach leverages COA's efficient exploration mechanisms, inspired by crayfish behaviour, with the symmetry of SaDE's adaptive exploitation capabilities, characterized by its dynamic parameter adjustment. The balance between these two phases represents a symmetrical relationship wherein both components contribute equally and complementary to the algorithm's overall performance. This symmetry in design enables the Hybrid COASaDE to maintain consistent and robust performance across a diverse range of optimization problems. Experimental evaluations were conducted using CEC2022 and CEC2017 benchmark functions, demonstrating COASaDE's superior performance compared to state-of-the-art optimization algorithms. The results and statistical analyses confirm the robustness and efficiency of the Hybrid COASaDE in finding optimal solutions. Furthermore, the applicability of the Hybrid COASaDE was validated through several engineering design problems, where COASaDE outperformed other optimizers in achieving the optimal solution. [ABSTRACT FROM AUTHOR]

Optimization techniques, particularly meta-heuristic algorithms, are highly effective in optimizing and enhancing efficiency across diverse models and systems, renowned for their ability to attain optimal or near-optimal solutions within a reasonable timeframe. In this work, the Puma Optimizer (PO) is proposed as a new optimization algorithm inspired from the intelligence and life of Pumas in. In this algorithm, unique and powerful mechanisms have been proposed in each phase of exploration and exploitation, which has increased the algorithm's performance against all kinds of optimization problems. In addition, a new type of intelligent mechanism, which is a type of hyper-heuristic for phase change, is presented. Using this mechanism, the PO algorithm can perform a phase change operation during the optimization operation and balance both phases. Each phase is automatically adjusted to the nature of the problem. To evaluate the proposed algorithm, 23 standard functions and CEC2019 functions were used and compared with different types of optimization algorithms. Moreover, using the statistical test T-test and the execution time to solve the problem have been discussed. Finally, it has been tested using four machine learning and data mining problems, and the results obtained from all the analysis signifies the excellent performance of this algorithm against all kinds of problems compared to other optimizers. This algorithm has performed better than the compared algorithms in 27 benchmarks out of 33 benchmarks and has obtained better results in solving the clustering problem in 7 data sets out of 10 data sets. Furthermore, the results obtained in the problems of community detection and feature selection and MLP were superior. The source codes of the PO algorithm are publicly available at https://www.mathworks.com/matlabcentral/fileexchange/157231-puma-optimizer-po. [ABSTRACT FROM AUTHOR]

Binary metaheuristic algorithms prove to be invaluable for solving binary optimization problems. This paper proposes a binary variant of the peacock algorithm (PA) for feature selection. PA, a recent metaheuristic algorithm, is built upon lekking and mating behaviors of peacocks and peahens. While designing the binary variant, two major shortcomings of PA (lek formation and offspring generation) were identified and addressed. Eight binary variants of PA are also proposed and compared over mean fitness to identify the best variant, called binary peacock algorithm (bPA). To validate bPA's performance experiments are conducted using 34 benchmark datasets and results are compared with eight well-known binary metaheuristic algorithms. The results show that bPA classifies 30 datasets with highest accuracy and extracts minimum features in 32 datasets, achieving up to 99.80% reduction in the feature subset size in the dataset with maximum features. bPA attained rank 1 in Friedman rank test over all parameters. [ABSTRACT FROM AUTHOR]

This paper presents a novel, robust, efficient, and simple optimization algorithm called the Object-Oriented Programming Optimization Algorithm (OOPOA) for tackling constrained and unconstrained optimization problems. The algorithm is inspired by the inheritance concept of Object-Oriented programming languages, where the features of a class are classified into three types according to inheritance probability: public, private, and protected. The object-oriented programming inheritance concept is implemented in the algorithm to update the population for the next generations. The proposed algorithm ensures exploitation by selecting the solution with the highest fitness to be inherited in each iteration. It ensures exploration by applying a mutation process that helps explore wide regions in the search space. The performance of this technique is demonstrated by solving 34 different optimization tasks, including 20 standard benchmark problems, ten IEEE Congress of Evolutionary Computation benchmark test functions, and four constrained real-world engineering design problems. [Display omitted] [ABSTRACT FROM AUTHOR]

To reduce the negative effects that conventional modes of transportation have on the environment, researchers are working to increase the use of electric vehicles. The demand for environmentally friendly transportation may be hampered by obstacles such as a restricted range and extended rates of recharge. The establishment of urban charging infrastructure that includes both fast and ultra-fast terminals is essential to address this issue. Nevertheless, the powering of these terminals presents challenges because of the high energy requirements, which may influence the quality of service. Modelling the maximum hourly capacity of each station based on its geographic location is necessary to arrive at an accurate estimation of the resources required for charging infrastructure. It is vital to do an analysis of specific regional traffic patterns, such as road networks, route details, junction density, and economic zones, rather than making arbitrary conclusions about traffic patterns. When vehicle traffic is simulated using this data and other variables, it is possible to detect limits in the design of the current traffic engineering system. Initially, the binary graylag goose optimization (bGGO) algorithm is utilized for the purpose of feature selection. Subsequently, the graylag goose optimization (GGO) algorithm is utilized as a voting classifier as a decision algorithm to allocate demand to charging stations while taking into consideration the cost variable of traffic congestion. Based on the results of the analysis of variance (ANOVA), a comprehensive summary of the components that contribute to the observed variability in the dataset is provided. The results of the Wilcoxon Signed Rank Test compare the actual median accuracy values of several different algorithms, such as the voting GGO algorithm, the voting grey wolf optimization algorithm (GWO), the voting whale optimization algorithm (WOA), the voting particle swarm optimization (PSO), the voting firefly algorithm (FA), and the voting genetic algorithm (GA), to the theoretical median that would be expected that there is no difference. [ABSTRACT FROM AUTHOR]

In the context of workflows, scheduling involves the systematic arrangement of tasks, allocation of resources, and coordination of dependencies to achieve desired outcomes. Effective scheduling is paramount in cloud–fog computing environments to harness the full potential of distributed resources while meeting application requirements. However, finding the most efficient solution often involves the quest for an optimal algorithm. An optimal algorithm is one that produces the best possible outcome in terms of a specified objective. While metaheuristic algorithms have been proposed by several researchers to address this issue, the solutions often converge at the local level, limiting their effectiveness. This study proposes the hybrid particle whale optimization algorithm as a solution for workflow scheduling problems. It is a combination of particle swarm optimization (PSO) and the whale optimization algorithm (WOA). By integrating the features of both algorithms, this algorithm tries to avoid becoming trapped in local optima. This algorithm aims to minimize the total execution cost, makespan, and energy consumption of tasks in a cloud–fog computing environment. The performance of the proposed algorithm is compared with that of the round robin, ant colony optimization, PSO, and WOA algorithms using five different scientific workflows, namely, the Inspiral, Montage, Epigenomics, Cybershake, and Sipht algorithms, which deploy various numbers of tasks and VMs. The proposed algorithm outperformed the other existing scheduling strategies. Moreover, the approach provides users with the flexibility to customize the scheduling strategy based on their preferences. Overall, this paper presents a novel approach for workflow scheduling in cloud–fog computing environments that improves the performance and efficiency of applications while also providing users with greater control over the scheduling process. [ABSTRACT FROM AUTHOR]

This work presents a new version of the salp swarm optimizer (SSA), called "mSSA," that uses complex mathematical expressions to dynamically manipulate the crucial control parameter ( c 1 ) during optimization. These expressions are carefully designed to modulate the shift in search strategy from exploratory to exploitative, improving the flexibility and speed of convergence of the algorithm. To evaluate the performance of the developed mSSA variants, a thorough examination is carried out on twenty-three benchmark test functions alongside their application to the complex task of software module classification. The process of classifying defective software modules involves developing a multilayer perceptron (MLP) classifier that is suited to the particular complexity and heterogeneity of the task. Selecting the best optimizer is made easier by systematically evaluating the different mSSA versions as MLP classifier trainers. Based on metrics like classification accuracy, convergence speed, and avoidance of local minima, a comparative analysis in opposition to six previously published metaheuristic optimizers shows that mSSA3, when combined with the developed MLP classifier, outperforms both other mSSA variations and state-of-the-art metaheuristic optimizers in terms of overall performance. The excellent classification accuracy, swift convergence, and ability to avoid local minima of mSSA3 highlight its superiority and establish it as a cutting-edge method in the application of metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

The efficacy of meta-heuristic algorithms has been demonstrated in solving unconstrained optimization problems. Inspired by the food foraging behavior of beetles, we propose herein a model-free meta-heuristic optimization algorithm, referred to as the Beetle Antennae Search-Bellwether Swarm, which incorporates the schemes of adaptive antenna fiber length and direction vector. A joint annealing-heating scheme along with the re-initialization mechanism is proposed such that each antenna fiber length could simultaneously gradually decrease or increase in different circumstances. We also propose to adapt each individual antenna fiber length based on the best smell perception direction (bellwether). The proposed schemes of adaptive antenna fiber length yield the algorithm almost insusceptible to different initial antenna fiber lengths for a relatively large range of initial antenna fiber lengths. The softmax combiner is leveraged to obtain the direction vector such that the beetle would be steered to step toward the new randomly combined direction and arrive at a candidate position. The beetle position is further updated by evaluating whether the candidate position is conducive to minimizing the objective function. The illustrative simulations demonstrate the fast initial convergence, cost-effectiveness and feasibility of the proposed algorithm. [ABSTRACT FROM AUTHOR]

A novel mathematical modeling approach for the Triple-Diode Model (TDM) and its parameter estimation is introduced in this paper. For the first time in the literature, this paper presents two analytical solutions for calculating the current in TDM solar cells using the Lambert W function. Additionally, a new metaheuristic algorithm, the Adaptive Evaporation Rate Water Cycle Algorithm (Adaptive ERWCA), is proposed for estimating TDM solar cell parameters. The proposed algorithm is tested using both the new analytical solutions and a well-known iterative approach for the current-voltage characteristics of the TDM solar cells model. Extensive testing is conducted on three well-known solar cells/modules and a panel under various weather conditions. The results demonstrate that the proposed analytical expressions for the current-voltage characteristics are accurate and highly effective for representing TDM solar cell current. The accuracy of the parameter estimates obtained with the application of the proposed algorithm, considering both analytical solutions and the iterative approach, is compared with existing literature results. It is shown that the proposed algorithm outperforms existing algorithms in solar cell parameter estimation across both the analytical and iterative approaches for current-voltage characteristics. Remarkably, for the RTC France solar cell, the SOLAREX MSX 60 solar module, and the PHOTOWATT-PWP 201 solar module, the obtained Root Mean Square Errors (RMSE) are 0.00075141, 0.01157153, and 0.0010578, respectively. These results are currently the best reported in the literature. [ABSTRACT FROM AUTHOR]

Bu çalışmada ilk olarak, betonarme sürekli kirişlerin detaylı tasarımlarının minimum maliyetle yapılabileceği bir süreç tasarlanmıştır. Ardından bu problem üzerinde FDB-TLABC, TLABC, TLBO ve ABC algoritmalarının performansları değerlendirilmiştir. Bu amaçlarla öncelikle Türk betonarme standardı ve deprem yönetmeliği dikkate alınarak optimizasyon problemi oluşturulmuştur. Bir, iki ve üç açıklıklı kiriş örneklerinden oluşan bir problem takımı hazırlanmıştır. Bu problem takımı üzerinde yapılan testlerden algoritmaların optimum sonuca ulaşma performansları ile belirlenen makul çözümlere ulaşma süreleri ve başarıları belirlenmiştir. Optimum sonuca ulaşmada, TLABC ve FDB-TLABC algoritmalarının en başarılı algoritmalar olduğu görülmüştür. Kararlılık analizinden, TLABC algoritmasının en yüksek kararlılığa ve hıza sahip olduğu görülmüştür.

In metropolitan cities, it is very complicated to govern the optimum routes for garbage collection vehicles due to high waste production and very dense population. Furthermore, wrongly designed routes are the source of wasting time, fuel and other resources in the collection of municipal trash procedure. The Vehicle Routing Problem (VRP) published between 2011 and 2023 was systematically analysed. The majority of the surveyed research compute the waste collecting problems using metaheuristic approaches. This manuscript serves two purposes: first, categorising the VRP and its variants in the field of waste collection; second, examining the role played by most of the metaheuristics in the solution of the VRP problems for a waste collection. Three case study of Asia continent has been analysed and the results show that the metaheuristic algorithms have the capability in providing good results for large-scale data. Lastly, some promising paths ranging from highlighting research gap to future scope are drawn to encourage researchers to conduct their research work in the field of waste management route problems. [ABSTRACT FROM AUTHOR]

Diffuse horizontal irradiance (DHI) forecasts are critical for adopting solar photovoltaic technology. Yet, they can lack reliability given the limited and uncertain meteorological data available for desert areas. This research develops a new sine cosine dipper throated optimization (SCDTO) technique, targeting DHI prediction even given such data constraints. SCDTO uniquely hybridizes sine cosine metaheuristics, adept at exploration, with dipper throat optimization, providing focused exploitation. This hybridization aims to create a robust ensemble model capable of delivering reliable DHI predictions despite climatic uncertainty. The ensemble model, employing various input combinations, was rigorously evaluated across multiple meteorological stations. The SCDTO algorithm exhibited remarkable performance improvements, yielding substantial reductions exceeding 93% in root mean squared error and 98% in mean absolute error at key stations in Morocco, including Tan-Tan, Zagora, Erfoud, and Oujda. Comparative analyses against established optimization algorithms consistently underscored the superior predictive capabilities of SCDTO. Visualizations, including box plots and histograms, demonstrated SCDTO's efficacy in minimizing prediction errors, particularly for Tan-Tan, Zagora, and Erfoud stations. Also, statistical validation through one-way analysis of variance (ANOVA) further affirmed the significance of the proposed SCDTO method. Therefore, this hybrid metaheuristic optimization enables more accurate DHI predictions from limited meteorological data. [ABSTRACT FROM AUTHOR]

The prospect of the energy transition is exciting and sure to benefit multiple aspects of daily life. However, various challenges, such as planning, business models, and energy access are still being tackled. Energy Communities have been gaining traction in the energy transition, as they promote increased integration of Renewable Energy Sources (RESs) and more active participation from the consumers. However, optimization becomes crucial to support decision making and the quality of service for the effective functioning of Energy Communities. Optimization in the context of Energy Communities has been explored in the literature, with increasing attention to metaheuristic approaches. This paper contributes to the ongoing body of work by presenting the results of a benchmark between three classical metaheuristic methods—Differential Evolution (DE), the Genetic Algorithm (GA), and Particle Swarm Optimization (PSO)—and three more recent approaches—the Mountain Gazelle Optimizer (MGO), the Dandelion Optimizer (DO), and the Hybrid Adaptive Differential Evolution with Decay Function (HyDE-DF). Our results show that newer methods, especially the Dandelion Optimizer (DO) and the Hybrid Adaptive Differential Evolution with Decay Function (HyDE-DF), tend to be more competitive in terms of minimizing the objective function. In particular, the Hybrid Adaptive Differential Evolution with Decay Function (HyDE-DF) demonstrated the capacity to obtain extremely competitive results, being on average 3% better than the second-best method while boasting between around 2× and 10× the speed of other methods. These insights become highly valuable in time-sensitive areas, where obtaining results in a shorter amount of time is crucial for maintaining system operational capabilities. [ABSTRACT FROM AUTHOR]

The advancement of new tools in the field of control systems is a contemporary development. This work introduces the utilization of Type-3 fuzzy logic, a relatively recent concept that has been applied across various disciplines. In our case, a Type-3 fuzzy system is designed to enhance the optimization of parameters within the harmony search algorithm, specifically tailored for a control problem. Through a series of experiments, the efficacy of this novel Type-3 fuzzy logic tool is put to the test. Previous studies have primarily explored Type-1 and Type-2 fuzzy logic. To assess the performance of this new Type-3 fuzzy logic tool, a comparative analysis of results is conducted using statistical testing. The introduction of Type-3 fuzzy logic in the control domain represents a novel and innovative approach. This approach extends beyond the conventional Type-1 and Type-2 fuzzy logic, showcasing the dynamic evolution in the field. Results obtained through experimentation are analyzed, and statistical tests are employed to determine whether the Type-3 fuzzy logic tool yields superior outcomes compared to its predecessors. By doing so, this study contributes to the growing body of research that explores the potential benefits of Type-3 fuzzy logic and its application in control systems, offering new perspectives and opportunities for further advancements in the field. We have to mention that the utilization of Type-3 fuzzy logic in enhancing metaheuristics is a relatively new trend, and in this work, this research has extended this to the realm of harmony search. In addition, the application of the optimal design of the ball-and-beam fuzzy controllers has not been previously carried out with the Type-3 fuzzy harmony search algorithm, which is the novelty of this study. [ABSTRACT FROM AUTHOR]

This work presents a methodology to solve optimization problems with dynamic-size solution vectors containing continuous and integer variables. It is achieved by reformulating the original problem through a bilevel optimization approach and implementing metaheuristic techniques to solve it. In the selected case study, the optimization problem corresponds to tuning a neuro-fuzzy controller (NFC) that operates in a biodiesel production system for controlling temperature. The NFC performs well and is especially robust to disturbances, but due to its complexity, it is difficult to determine the best set of parameters for its use. This has led to biased searches based on criteria such as the experiences of designers. With the proposed method, it was possible to obtain a tuning that—when implemented in a simulation—led to results that surpassed those documented in the literature. Finally, the proposal offers flexibility for implementation with other controllers that have similar architectures and can be integrated into various other plants or processes. [ABSTRACT FROM AUTHOR]

This work proposes a novel technique to conduct back‐analysis of lateral displacement of deep cement mixing (DCM) columns in deep excavation construction. For the first time, we propose a process to investigate both soil and underground structure end‐to‐end automatically. The novel technique is a complex combination of three crucial factors: (1) a nature‐inspired optimization algorithm (O), (2) a three‐dimensional PLAXIS Geotechnical Engineering software (P) and (3) a modern Python language programming (P), hereinafter called the a nature‐inspired optimization algorithm (O), a three‐dimensional PLAXIS Geotechnical Engineering software (P) and a modern Python language programming (P) (OPP) technique. The novel meta‐heuristic algorithm simulated the co‐evolved partnership behavior of shrimps and goby fishes, termed Shrimp and Goby Association (SGA), which plays an important role in complex analyses. A series of exams to determine the SGA's performance is conducted on 38 benchmark test functions (IEEE Congress on Evolutionary Computation 2017 and 2019) and three real‐world engineering design problems to showcase its applicability. The metaheuristic and PLAXIS 3D analysis work well together, which makes the back‐analysis technique powerfully to determinate stiffness parameters instead of the traditional approaches. Based on the optimized parameters, the lateral deflection of DCM and soil are well predicted for excavation. This study proposes a technique to estimate efficiently the stiffness parameter for very soft soil. As a consequence of the optimization process, an equation to determine the stiffness parameter of DCM columns from laboratory test is also proposed. Based on the obtained results, this research provides a comprehensive methodology for predicting risk, enhancing safety, saving time and money, and effectively designing and constructing underground structures. [ABSTRACT FROM AUTHOR]

This paper proposes the Love Evolution Algorithm (LEA), a novel evolutionary algorithm inspired by the stimulus–value–role theory. The optimization process of the LEA includes three phases: stimulus, value, and role. Both partners evolve through these phases and benefit from them regardless of the outcome of the relationship. This inspiration is abstracted into mathematical models for global optimization. The efficiency of the LEA is validated through numerical experiments with CEC2017 benchmark functions, outperforming seven metaheuristic algorithms as evidenced by the Wilcoxon signed-rank test and the Friedman test. Further tests using the CEC2022 benchmark functions confirm the competitiveness of the LEA compared to seven state-of-the-art metaheuristics. Lastly, the study extends to real-world problems, demonstrating the performance of the LEA across eight diverse engineering problems. Source codes of the LEA are publicly available at https://ww2.mathworks.cn/matlabcentral/fileexchange/159101-love-evolution-algorithm. [ABSTRACT FROM AUTHOR]

This paper focuses on optimizing the laser cladding process parameters of WC/Inconel 625 composite on a low-carbon steel substrate. This process aims to improve industrial parts' wear and corrosion properties in corrosive and high-temperature environments. Laser power, laser cladding speed, powder-feeding rate, and WC content percentage were process input parameters, each at three levels. The dilution ratio and micro-hardness of samples were considered as process responses. Taguchi orthogonal arrays were employed for experimental design, and the results were analyzed using signal-to-noise ratio and analysis of variance. A linear regression model was developed to understand the relationship between process parameters and responses. In addition, two-objective optimization of the process parameters using the second-generation non-dominated sorting genetic algorithm (NSGA-II), and a hybrid algorithm based on the multi-objective whale optimization algorithm (MOWOAGA) were carried out to determine the optimal parameters that minimize the dilution ratio and maximize the cladding hardness. The results showed that the laser power and the powder-feeding rate have the most excellent effect on the dilution ratio. In contrast, WC content percentage and powder-feeding rate strongly affect micro-hardness. Based on the applied meta-heuristic algorithms and confirmed by experimental tests, the laser power of 370 W, laser cladding speed of 4 mm/s, powder-feeding rate of 8 g/min, and WC content percentage of 20.5% are the most optimal process parameters that lead to micro-hardness of 397 Vickers and dilution percentage of 2.5%. This research guides selecting, controlling, and optimizing WC/Inconel 625 composite laser cladding process parameters. [ABSTRACT FROM AUTHOR]

This paper introduces a new algorithm designed to address the challenge of distribution network reconfiguration, employing the tabu search metaheuristic in conjunction with the voltage drop concept. Distinguishing itself from existing methods, our proposed approach not only utilizes voltage drop for obtaining the initial solution but also introduces a novel technique for generating a candidate solution neighborhood. This method leverages both randomness and voltage drop, ensuring a smooth and steady descent during algorithm execution. The primary goal of our algorithm is to minimize active power losses within distribution networks. To validate its effectiveness, the proposed method underwent testing on three commonly referenced distribution systems: the 33-Bus, 69-Bus, and 94-Bus systems, widely acknowledged in the literature. A pivotal aspect of our work involves the synergy of the tabu search algorithm with a combination of both random and deterministic methods for generating neighbors. This strategic amalgamation plays a crucial role, enabling rapid execution while consistently yielding high-quality solutions. Additionally, the adoption of the electric distance method for generating the initial solution adds significant value, offering a commendable solution with minimal computational effort. Comparative assessments against other algorithms documented in the literature underscore the superior efficiency of our proposed algorithm. [ABSTRACT FROM AUTHOR]

Electric vehicles (EVs) have been heavily used to minimize the worldwide pollution. Battery storage system is the most important and expensive system in these vehicles. An accurate battery management system (BMS) must be applied to monitor and control the battery states. From these measurements, the residual useful life (RUL) is estimated to avoid any further safety issue which can destroy the battery system or vehicle, or harm the passengers. Many features are required to be measured to estimate the battery states and then estimate the RUL such as battery voltage, current, and temperature according to the time. These measurements are taken using embedded system, and the measured data are stored in data files. Artificial neural networks (ANNs), long short-term memory (LSTM), support vector regressors (SVRs), random forest (RF), and boosting methods have been implemented to estimate the battery RUL. Moreover, many optimization algorithms such as particle swarm optimizer (PSO) and whale optimization algorithm (WOA) are integrated with the extreme learning machine (ELM) to estimate the battery RUL. The root mean square error (RMSE) is considered the main factor that has been used to judge which algorithm is more accurate than the other. It is found that both PSO-ELM and WOA-ELM supersede the machine learning tools, where the RMSE values are 1.46% and 1.51%, respectively. These values are 2.24%, 2.25%, 2.74%, 2.84%, and 3.56% LightGBM, random forest, AdaBoost, XGBoost, and CatBoost algorithms, respectively. [ABSTRACT FROM AUTHOR]

This article introduces a novel stochastic optimization method termed the Best-Other Algorithm (BOA). The nomenclature reflects its reliance on the best member, which is amalgamated with other entities. BOA, a metaphor-free swarm-based metaheuristic, comprises three directed searches. The first involves subtracting the best member from a randomly selected member. The second entails determining the midpoint between the best member, and another randomly chosen member. The third centers around the midpoint between the best member and a random solution along the space. The efficacy of BOA is evaluated by challenging it to solve a collection of 23 functions. In this evaluation, BOA is pitted against five other metaheuristics: Northern Goshawk Optimization (NGO), Zebra Optimization Algorithm (ZOA), Coati Optimization Algorithm (COA), Migration Algorithm (MA), and Osprey Optimization Algorithm (OOA). The findings indicate the superiority of BOA over its counterparts. BOA outperforms NGO, ZOA, COA, MA, and OOA in 21, 15, 16, 15, and 17 functions, respectively. These results underscore the pivotal role of the best member as a reference and the comparatively lesser significance of the neighborhood search as the search space diminishes during the iteration. [ABSTRACT FROM AUTHOR]

This paper explores the advantages of the Two Degree of Freedom Proportional-Integral-Derivative (2DOF_PID) controller in tracking the reference signal and rejecting the disturbance signal at the same time. Three types of metaheuristic optimization algorithms are employed for tuning the controller's parameters which are Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Dragonfly Algorithm (DA). These three algorithms have in common that they combine the exploratory concept (global search) and the exploitative concept (local search) in order to reach the optimal global solution. The effectiveness of these algorithms was taken advantage of to improve the performance of the control system that contains the controller. Second and third order plants were adopted for the purpose of testing, evaluating, and comparing the performance of the control system. This aim was accomplished by using each of the optimization algorithms for each plant. The simulation results showed the superiority of the DA in terms of obtaining the lowest value of the Integral Absolute Error (IAE) as the cost function. [ABSTRACT FROM AUTHOR]