Search

Introducing a novel meta-heuristic optimization algorithm, the Flood Algorithm (FLA) draws inspiration from the intricate movement and flow patterns of water masses during flooding events in river basins. FLA mathematically models key phenomena such as the movement of water toward slopes, flow rates over time, soil permeability effects, and periodic increases and decreases in water levels from precipitation and losses. Leveraging these models, the algorithm guides the movement and evolution of a population of potential solutions toward enhanced optimality. The algorithm endeavors to establish an appropriate correlation between the fundamental aspects of natural flood events and the optimization process. Its formulation and working mechanism are described in detail. It operates in two main phases—a regular movement phase, where the population moves naturally toward current best solutions, and a flooding phase, which introduces random disturbances to increase diversity. New solutions are periodically introduced while weaker ones are removed, mirroring the natural cycles of water levels. FLA's effectiveness is demonstrated through its application on well-known benchmark optimization problems and engineering design problems. Extensive comparisons have been carried out on CEC2005 functions using 16 algorithms in both basic and enhanced modes, as well as on CEC2014 functions with dimensions 30, 50, and 100 using a total of 20 other algorithms. These rigorous studies unequivocally confirm the robustness and strength of the proposed algorithm. Furthermore, the algorithm's performance on 12 constrained engineering problems demonstrates its ability to tackle real-world challenges. The FLA's source code is publicly available at https://www.optim-app.com/projects/fla. [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]

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]

High utility itemset mining is an essential new task in data mining, which is obtained from the extension of frequent itemset mining problems. The difference between these two groups is that in high utility itemset mining, the utilities of the items are essential in addition to the number of items. To find the itemsets with more utilities, defining a minimum utility threshold is necessary by testing different solutions to obtain the desired outcome. This is challenging and needs more time to reach the appropriate value. In this article, we propose a method called TKU-BChOA to explore top-k high utility itemsets according to the number of required itemsets based on the Chimp meta-heuristic algorithm. Because, in comparison with the meta-heuristic methods, the deterministic methods require more time and memory. Experimental results on five datasets show that the proposed approach outperforms the previous deterministic methods in memory usage. The proposed method performs better in terms of time and memory on large datasets than other approximate methods and is more accurate. [ABSTRACT FROM AUTHOR]

The wild horse optimizer (WHO) is a novel metaheuristic algorithm, which has been successfully applied to solving continuous engineering problems. Considering the characteristics of the wild horse optimizer, a discrete version of the algorithm, named discrete wild horse optimizer (DWHO), is proposed to solve the capacitated vehicle routing problem (CVRP). By incorporating three local search strategies-swap operation, reverse operation, and insertion operation-along with the introduction of the largest-order-value (LOV) decoding technique, the precision and quality of the solutions have been enhanced. Experimental results conducted on 44 benchmark instances indicate that, in most test cases, the solving capability of discrete wild horse optimizer surpasses that of basic wild horse optimizer (BWHO), hybrid firefly algorithm, dynamic space reduction ant colony optimization (DSRACO), and discrete artificial ecosystem-based optimization (DAEO). The discrete wild horse optimizer provides a novel approach for solving the capacitated vehicle routing problem and also offers a new perspective for addressing other discrete problems. [ABSTRACT FROM AUTHOR]

The optical microscope algorithm (OMA) is a metaheuristic algorithm that draws inspiration from the magnifying functionality of optical microscopes. This study introduces an enhanced variant of OMA, termed PMSOMA, designed to mitigate the original version's limitations, notably its slow convergence rates and vulnerability to local optima. PMSOMA integrates a piecewise linear chaotic map to refine population initialization and augment diversity, alongside a sparse adaptive exploration mechanism to bolster search efficacy. The performance of PMSOMA was rigorously tested using a suite of 50 benchmark functions, the CEC2017 test suite, feature selection datasets, and three classical engineering challenges. The empirical findings confirm that PMSOMA surpasses both the original OMA and competing algorithms by delivering superior solutions, accelerating convergence, and demonstrating enhanced robustness in convergence. [ABSTRACT FROM AUTHOR]

In this study, a stochastic multi-objective structure for optimization of the intelligent electric parking lots (EPLs) is implemented in the distribution network for minimizing the power losses annual costs, power purchased from the main grid, unsupplied energy of subscribers, cost of vehicles to the grid as well as minimizing the network voltage deviations considering battery degradation cost (BDC) and network load uncertainty (NLUn). In this research, the unscented transformation method (UTM) is used for NLUn modeling and this method is easily applicable and has a low computational cost. An improved meta-heuristic algorithm named improved fire hawks optimization (IFHO) is utilized for decision variables finding defined as the site and size of the EPLs in the distribution network. The conventional fire hawks optimization (FHO) algorithm is inspired by the fire hawks foraging behavior and in this research, the Taylor-based neighborhood technique (TBNT) is used to reduce the dependency and the possibility of becoming trapped in local optimal. To evaluate the proposed methodology, the simulations are implemented in three scenarios (1) EPLs optimization without BDC and NLUn based-UTM, (2) EPLs optimization with BDC and without NLUn, and (3) EPLs optimization with BDC and NLUn. The results of the third scenario considering BDC and NLUn showed that the EPLs optimization integrated with a multi-objective framework by finding the EPL's optimal size and capacity in the network via the IFHO has reduced the annual losses, voltage deviations, ENS cost, and substation cost by 21.06%, 12.15%, 70.82%, and 39.10%, respectively compared to the base distribution network. Additionally, the results demonstrated that incorporating the BDC and NLUn, the annual losses, voltage oscillations, ENS cost, grid cost, and EPLs have increased in comparison with the EPLs optimization without BDC and NLUn based-UTM. In addition, the TBNT based-IFHO superiority has been confirmed in different scenarios by achieving better values of the objectives and also obtaining the convergence process with lower convergence tolerance and higher convergence accuracy. [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]

This study aimed to forecast dam inflows and subsequently predict its capability in producing HEPP using machine learning and evolutionary optimization techniques. Mahabad Dam, located in the northwest of Iran and recognized as one of the nation's key dams, served as a case study. First, artificial neural networks (ANN) and support vector regression (SVR) were employed to predict dam inflows, with optimization of parameters achieved through Harris hawks optimization (HHO), a robust optimization technique. The data of temperature, precipitation, and dam inflow over a 24-year period on a monthly basis, incorporating various lag times, were used to train these machines. Then, HEPP from the dam was predicted using temperature, precipitation, dam inflow, and dam evaporation as input variables. The models were applied to data covering the years 2000 to 2020. The results of the first part indicated both hybrid models (HHO-ANFIS and HHO-SVR) improved the prediction performance compared to the single models. Based on the results of Taylor's diagram and the error evaluation criteria, the HHO-ANFIS hybrid model (RMSE, MAE, and NSE of 3.90, 2.41, and 0.86, respectively) exerted better performance than HHO-SVR (RMSE, MAE, and NSE of 4.39, 2.70, and 0.86, respectively). The results of the second part showed that using the HHO algorithm to optimize single models (RMSE, MAE, and NSE of 0.2, 10, and 0.90, respectively) predicted HEPP better than single models (RMSE, MAE, and NSE of 0.2, 10, and 0.90, respectively). The results of Taylor's diagram also showed that the HHO-ANFIS model exerted better performance. The findings of this study indicated the promising performance of machine learning models optimized by metaheuristic algorithms in the simultaneous prediction of dam inflows and HEPP in multi-purpose dams for better management and allocation of surface water resources. [ABSTRACT FROM AUTHOR]

Economic dispatch is an important issue in the management of power systems and is the current focus of specialists. In this paper, a new metaheuristic optimization algorithm is proposed, named Social Small Group Optimization (SSGO), inspired by the psychosocial processes that occur between members of small groups to solve real-life problems. The starting point of the SSGO algorithm is a philosophical conception similar to that of the social group optimization (SGO) algorithm. The novelty lies in the introduction of the small group concept and the modeling of individuals' evolution based on the social influence between two or more members of the small group. This conceptual framework has been mathematically mapped through a set of heuristics that are used to update the solutions, and the best solutions are retained by employing a greedy selection strategy. SSGO has been applied to solve the economic dispatch problem by considering some practical aspects, such as valve-point loading effects, sources with multiple fuel options, prohibited operating zones, and transmission line losses. The efficiency of the SSGO algorithm was tested on several mathematical functions (unimodal, multimodal, expanded, and composition functions) and on power systems of varying sizes (ranging from 10-units to 1280-units). The SSGO algorithm was compared with SGO and other algorithms belonging to various categories (such as: evolution-based, swarm-based, human behavior-based, hybrid algorithms, etc.), and the results indicated that SSGO outperforms other algorithms applied to solve the economic dispatch problem in terms of quality and stability of the solutions, as well as computation time. [ABSTRACT FROM AUTHOR]

Concrete is the most commonly used construction material. However, its production leads to high carbon dioxide (CO2) emissions and energy consumption. Therefore, developing waste-substitutable concrete components is necessary. Improving the sustainability and greenness of concrete is the focus of this research. In this regard, 899 data points were collected from existing studies where cement, slag, fly ash, superplasticizer, coarse aggregate, and fine aggregate were considered potential influential factors. The complex relationship between influential factors and concrete compressive strength makes the prediction and estimation of compressive strength difficult. Instead of the traditional compressive strength test, this study combines five novel metaheuristic algorithms with extreme gradient boosting (XGB) to predict the compressive strength of green concrete based on fly ash and blast furnace slag. The intelligent prediction models were assessed using the root mean square error (RMSE), coefficient of determination (R2), mean absolute error (MAE), and variance accounted for (VAF). The results indicated that the squirrel search algorithm-extreme gradient boosting (SSA-XGB) yielded the best overall prediction performance with R2 values of 0.9930 and 0.9576, VAF values of 99.30 and 95.79, MAE values of 0.52 and 2.50, RMSE of 1.34 and 3.31 for the training and testing sets, respectively. The remaining five prediction methods yield promising results. Therefore, the developed hybrid XGB model can be introduced as an accurate and fast technique for the performance prediction of green concrete. Finally, the developed SSA-XGB considered the effects of all the input factors on the compressive strength. The ability of the model to predict the performance of concrete with unknown proportions can play a significant role in accelerating the development and application of sustainable concrete and furthering a sustainable economy. [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]

Many emerging commercial services are based on the sharing or pooling of resources for common use with the aim of reducing costs. Businesses such as delivery-, mobility-, or transport-as-a-service have become standard in many parts of the world, fulfilling on-demand requests for customers in live settings. However, it is known that many of these problems are NP-hard, and therefore both modeling and solving them accurately is a challenge. Here we focus on one such routing problem, the Ride Pooling Problem (RPP), where multiple customers can request on-demand pickups and drop-offs from shared vehicles within a fleet. The combinatorial optimization task is to optimally pool customer requests using the limited set of vehicles, akin to a small-scale flexible bus route. In this work, we propose a quadratic unconstrained binary optimization (QUBO) program and introduce efficient formulation methods for the RPP to be solved using metaheuristics, and specifically emerging quantum optimization algorithms. [ABSTRACT FROM AUTHOR]

In this work, intelligent numerical models for the prediction of debris flow susceptibility using slope stability failure factor of safety (FOS) machine learning predictions have been developed. These machine learning techniques were trained using novel metaheuristic methods. The application of these training mechanisms was necessitated by the need to enhance the robustness and performance of the three main machine learning methods. It was necessary to develop intelligent models for the prediction of the FOS of debris flow down a slope with measured geometry due to the sophisticated equipment required for regular field studies on slopes prone to debris flow and the associated high project budgets and contingencies. With the development of smart models, the design and monitoring of the behavior of the slopes can be achieved at a reduced cost and time. Furthermore, multiple performance evaluation indices were utilized to ensure the model's accuracy was maintained. The adaptive neuro-fuzzy inference system, combined with the particle swarm optimization algorithm, outperformed other techniques. It achieved an FOS of debris flow down a slope performance of over 85%, consistently surpassing other methods. [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]

Cloud computing has evolved into an indispensable tool for facilitating scientific research due to its ability to efficiently distribute and process workloads in a virtual environment. Scientific tasks that involve complicated task dependencies and user-defined constraints related to quality of service (QoS) and time constraints require the efficient use of cloud resources. Planning these scientific workflow tasks represents an NP-complete problem, prompting researchers to explore various solutions, including conventional planners and evolutionary optimization algorithms. In this study, we present a novel, multistage algorithm specifically designed to schedule scientific workflows in cloud computing contexts. This approach addresses the challenges of efficiently mapping complex workflows onto distributed cloud resources while considering factors like resource heterogeneity, dynamic workloads, and stringent performance requirements. The algorithm uses the whale optimization algorithm (WOA) with a two-phase approach to shorten execution time, minimize financial costs, and effectively maintain load balancing. [ABSTRACT FROM AUTHOR]

This research introduces a new technique to control constrained nonlinear systems, named Lyapunov-based neural network model predictive control using a metaheuristic optimization approach. This controller utilizes a feedforward neural network model as a prediction model and employs the driving training based optimization algorithm to resolve the related constrained optimization problem. The proposed controller relies on the simplicity and accuracy of the feedforward neural network model and the convergence speed of the driving training based optimization algorithm. The closed-loop stability of the developed controller is ensured by including the Lyapunov function as a constraint in the cost function. The efficiency of the suggested controller is illustrated by controlling the angular speed of three-phase squirrel cage induction motor. The reached results are contrasted to those of other methods, specifically the fuzzy logic controller optimized by teaching learning-based optimization algorithm, the optimized PID with particle swarm optimization algorithm, the neural network model predictive controller based on particle swarm optimization algorithm, and the neural network model predictive controller using driving training based optimization algorithm. This comparative study showcase that the suggested controller provides good accuracy, quickness and robustness due to the obtained values of the mean absolute error, mean square error root mean square error, enhancement percentage, and computing time in the different simulation cases, and it can be efficiently utilized to control constrained nonlinear systems with fast dynamics. [ABSTRACT FROM AUTHOR]

Cybersecurity is critical in today's digitally linked and networked society. There is no way to overestimate the importance of cyber security as technology develops and becomes more pervasive in our daily lives. Cybersecurity is essential to people's protection. One type of cyberattack known as "credential stuffing" involves using previously acquired usernames and passwords by attackers to access user accounts on several websites without authorization. This is feasible as a lot of people use the same passwords and usernames on several different websites. Maintaining the security of online accounts requires defence against credential-stuffing attacks. The problems of credential stuffing attacks, failure detection, and prediction can be handled by the suggested EWOA-ANN model. Here, a novel optimization approach known as Enhanced Whale Optimization Algorithm (EWOA) is put on to train the neural network. The effectiveness of the suggested attack identification model has been demonstrated, and an empirical comparison will be carried out with respect to specific security analysis. [ABSTRACT FROM AUTHOR]

As the number and cleverness of cyber-attacks keep increasing rapidly, it's more important than ever to have good ways to detect and prevent them. Recognizing cyber threats quickly and accurately is crucial because they can cause severe damage to individuals and businesses. This paper takes a close look at how we can use artificial intelligence (AI), including machine learning (ML) and deep learning (DL), alongside metaheuristic algorithms to detect cyber-attacks better. We've thoroughly examined over sixty recent studies to measure how effective these AI tools are at identifying and fighting a wide range of cyber threats. Our research includes a diverse array of cyberattacks such as malware attacks, network intrusions, spam, and others, showing that ML and DL methods, together with metaheuristic algorithms, significantly improve how well we can find and respond to cyber threats. We compare these AI methods to find out what they're good at and where they could improve, especially as we face new and changing cyber-attacks. This paper presents a straightforward framework for assessing AI Methods in cyber threat detection. Given the increasing complexity of cyber threats, enhancing AI methods and regularly ensuring strong protection is critical. We evaluate the effectiveness and the limitations of current ML and DL proposed models, in addition to the metaheuristic algorithms. Recognizing these limitations is vital for guiding future enhancements. We're pushing for smart and flexible solutions that can adapt to new challenges. The findings from our research suggest that the future of protecting against cyber-attacks will rely on continuously updating AI methods to stay ahead of hackers' latest tricks. [ABSTRACT FROM AUTHOR]

This paper proposes a new meta-heuristic optimization algorithm called Cleaner Fish Optimization algorithm (CFO) inspired by cleaner fish. The CFO simulates the movement behavior of cleaner fish when performing "cleaning services" and the behavior of female may change its sex to become a male, and defines two modes of position update. In addition, a two-generation cycle operation strategy is proposed to realize the optimization process. To verify the effectiveness of the CFO algorithm, 23 well-known CEC benchmark functions, CEC-2017 benchmark functions and 4 engineering design problems are adopted. Simulation results show that the proposed algorithm has a faster convergence rate and better optimal solution when it compared with several other meta-heuristic algorithms. [ABSTRACT FROM AUTHOR]

Maintenance planning aims to improve the reliability of assets, prevent the occurrence of asset failures, and reduce maintenance costs associated with downtime of assets and maintenance resources (such as spare parts and workforce). Thus, effective maintenance planning is instrumental in ensuring high asset availability with the minimum cost. Nevertheless, to find such optimal planning is a nontrivial task due to the (i) complex and usually nonlinear inter-relationship between different planning decisions (e.g., inventory level and workforce capacity), and (ii) stochastic nature of the system (e.g., random failures of parts installed in assets). To alleviate these challenges, we study a joint maintenance planning problem by considering several decisions simultaneously, including workforce planning, workforce training, and spare parts inventory management. We develop a hybrid solution algorithm (DRLSA ) that is a combination of Double Deep Q-Network based Deep Reinforcement Learning (DRL) and Simulated Annealing (SA) algorithms. In each episode of the proposed algorithm, the best solution found by DRL is delivered to SA to be used as an initial solution, and the best solution of SA is delivered to DRL to be used as the initial state. Different from the traditional SA algorithms where neighborhood structures are selected only randomly, the DRL part of DRLSA learns to choose the best neighborhood structure to use based on experience gained from previous episodes. We compare the performance of the proposed solution algorithm with several well-known meta-heuristic algorithms, including Simulated Annealing, Genetic Algorithm (GA), and Variable Neighborhood Search (VNS). Further, we also develop a Machine Learning (ML) algorithm (i.e., K-Median) as another benchmark in which different properties of spare parts (e.g., failure rates, holding costs, and repair rates) are used as clustering features for the ML algorithm. Our study reveals that the DRLSA finds the optimal solutions for relatively small-size instances, and it has the potential to outperform traditional meta-heuristic and ML algorithms. [ABSTRACT FROM AUTHOR]

Forecasting of long-term annual electricity demand is studied utilizing historical data for electrical energy consumption and socio-economic indicators—gross domestic product, population, import and export values for the case of Turkey between 1975 and 2020. A quadratic model for electrical energy consumption was applied to define the relation between the historical and predicted data. This model used metaheuristic algorithms; genetic algorithms (GA), differential evolution (DE), particle swarm optimization (PSO), artificial intelligence (AI) approaches; neural networks (NN), and adaptive network fuzzy inference systems (ANFIS), and machine learning (ML) applications; all models undergo testing, but the top four models—stepwise linear regression (SLR), NN, Gaussian process regression (GPR) with exponential, and GPR with squared exponential—are selected for additional research to determine the best forecasting model based on their forecasting performance. Comparing the finalized models SLR produced the best forecasting model with a mean absolute percentage error (MAPE) value of 2.36%, followed by GA with 2.97%. Turkey's yearly electrical energy consumption is projected under three possible scenarios through 2030. Finding the most appropriate forecasting model among the models studied for long-term electrical energy forecasting is ultimately the primary goal of this research. Simulations are done on the MATLAB™ platform. [ABSTRACT FROM AUTHOR]

The traditional energy market is being transformed with modern communication technology, with an interactive generation-load communication topology for energy management in a domestic utility connected over a micro smart grid (MSG). In the traditional energy market, the consumer's role is limited to power consumption. Modern microgrids allow the user to interact with the grid and have increased the energy efficiency of domestic utilities. It is very much necessary to study the role of distributed generation in demand-side management for a proper energy management system in MSG. This paper highlights the interactive areas for the user with the grid to minimize the losses and improve the grid efficiency, thereby minimizing the cost for the user. An agent-based system for the identification of priority and non-priority loads is discussed in this paper, along with an Adaptive Whale Optimization Algorithm (AWOA) for load switching based on priority. Simulation is conducted in MATLAB to validate the proposed technique. The effectiveness of the proposed framework is assessed by comparing it to the Whale optimization Algorithm (WOA) and cases without scheduling. By implementing AWOA, the following improvements were observed: the total electricity cost decreased by an average of 1.33% for 6 residential buildings. In the similar manner, the lad deviation of 1.36% is achieved by implementing AWOA compared to AWO Algorithm. [ABSTRACT FROM AUTHOR]

Electricity network across the globe has witnessed an increase in penetration of distributed energy resources (DER) to the grid. A maiden attempt to integrate 50% loaded combined cycle gas turbine (CCGT) plant and doubly fed induction generator (DFIG) plant with DER is carried out for investigations to study frequency excursions in the hybrid system along with temperature excursions in the CCGT plant. A novel attempt is done to introduce modified beluga whale optimizer for tuning the controller gains and system parameters of the hybrid isolated system. This article emphasizes on the system behaviour of an isolated power system consisting of a CCGT plant and a DFIG plant integrated with distributed energy resources comprising of diesel engine generator, wind turbine generator and battery energy storage system. Among the classical secondary controllers, comparison of system responses is carried out to select the best among proportional, proportional–integral, and proportional–integral–derivative controllers. A modified beluga whale optimization algorithm is utilized to tune the controllers. Various investigations conducted with different turbo generators confirm the control strategy to the frequency of excursions. The hybrid CCGT—DFIG—DER system is also evaluated under random load demand, change in generation rate constraints and DFIG power output. [ABSTRACT FROM AUTHOR]

The electrical power system (EPS) has been heavily stressed due to high load demand. It operates close to the total capacity limits, resulting in voltage instability that can lead to voltage collapse. In this regard, incorporating flexible alternating current transmission system (FACTS) devices and renewable energy sources (RESs) to obtain the optimum values of the generator voltage, reactive compensation, and transformer tab in optimal reactive power dispatch (ORPD) is essential in increasing the reliability and safety of the system. ORPD involves discrete and continuous variables, which are nonlinear, noncontinuous, non-convex, and complex problems. The objective functions of ORPD are reduction in active power loss (Ploss), voltage deviation, and voltage profile enhancement. This paper presents a recent advancement of the ORPD problem, mathematical formulation of the objectives function, and a summary of various metaheuristic optimization methods (single and hybrid) used to solve the ORPD problems. The hybrid method combines two or more methods to improve the demerits of one method to obtain a quality solution to a problem. This review covered incorporating FACTS devices and RESs used in solving the ORPD problem to reduce the active Ploss and improve the voltage profile in the EPS. The benefits of FACTS devices and RESs are also discussed. Also, various metaheuristic algorithms (single, modified, and hybrid) employed to solve the ORPD problem were discussed. The future direction for researchers in this field was provided to give insight into the applicability and performance. Overall, this research explores different techniques used in solving ORPD problems from the optimization point of view to incorporating RESs and FACTS devices to obtain quality solutions. Some existing methods do not guarantee an optimum solution, but incorporating RESs and FACTS devices will help attain the best solution to the problem for better power system operation to improve system reliability and voltage profile. Based on the review journal, it can be concluded that hybrid techniques offer efficient quality solutions to the ORPD problem. [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]

This study proposes a dynamic simulation-based framework that utilizes swarm intelligence algorithms to optimize the design of hybrid assembly lines in the automotive industry. Two recent discrete versions of Whale Optimization Algorithm (named VNS-DWOA) and Gorilla Troops Optimizer (named DGTO) were developed to solve the assembly line balancing problem. The effectiveness of these algorithms was compared to six conventional meta-heuristics as well as the solution proposed by process design experts. The experimental results show that our methods outperform the conventional meta-heuristics and achieve comparable or better results than the experts' solution. Particulary, VNS-DWOA, being the top performer, has consistently provided averagely remarkable enhancements of cycle time, ranging from 7% when compared to the process expert's solution to 20% maximum improvement compared to all other methods. The findings of this study highlight the effectiveness of utilizing swarm intelligence algorithms and dynamic simulation-based frameworks as well as the potential benefits of implementing these digital methods in industrial settings, as they can significantly accelerate and enhance the optimization of assembly line design particularly and reduce time to market generally. [ABSTRACT FROM AUTHOR]

Data clustering has attracted the interest of scholars in many fields. In recent years, using heuristic algorithms to solve data clustering problems has gradually become a tendency. The black hole algorithm (BHA) is one of the popular heuristic algorithms among researchers because of its simplicity and effectiveness. In this paper, an improved self-adaptive logarithmic spiral path black hole algorithm (SLBHA) is proposed. SLBHA innovatively introduces a logarithmic spiral path and random vector path to BHA. At the same time, a parameter is used to control the randomness, which enhances the local exploitation ability of the algorithm. Besides, SLBHA designs a replacement mechanism to improve the global exploration ability. Finally, a self-adaptive parameter is introduced to control the replacement mechanism and maintain the balance between exploration and exploitation of the algorithm. To verify the effectiveness of the proposed algorithm, comparison experiments are conducted on 13 datasets creatively using the evaluation criteria including the Jaccard coefficient as well as the Folkes and Mallows index. The proposed methods are compared with the selected algorithms such as the whale optimization algorithm (WOA), compound intensified exploration firefly algorithm (CIEFA), improved black hole algorithm (IBH), etc. The experimental results demonstrate that the proposed algorithm outperforms the compared algorithms on both external criteria and quantization error of the clustering problem. [ABSTRACT FROM AUTHOR]

In the dynamic smart grid landscape, accurate probabilistic forecasting of electric load is critical. This paper presents a novel 24-hour-ahead probabilistic load forecasting model by integrating quantile regression with a parallel convolutional neural network (CNN) and bidirectional gated recurrent unit (BiGRU) architecture. Carefully tuning hyperparameters can enhance model performance and generalization capability. Consequently, we propose an improved whale optimization algorithm for automatic hyperparameter tuning of the forecasting model. Case studies demonstrate the proposed method's superior performance over benchmark models in terms of average interval score and pinball loss. In addition, it exhibits valid coverage and tight interval bandwidths. The model provides precise short-term load forecasts to support robust smart grid planning and operations. [ABSTRACT FROM AUTHOR]

Packing problems have been studied for a long time and have great applications in real-world scenarios. In recent times, with problems in the industrial world increasing in size, exact algorithms are often not a viable option and faster approaches are needed. We study Monte Carlo tree search, a random sampling algorithm that has gained great importance in literature in the last few years. We propose three approaches based on MCTS and its integration with metaheuristic algorithms or deep learning models to obtain approximated solutions to packing problems that are also interpretable by means of MCTS exploration and from which knowledge can be extracted. We focus on two-dimensional rectangle packing problems in our experimentation and use several well known benchmarks from literature to compare our solutions with existing approaches and offer a view on the potential uses for knowledge extraction from our method. We manage to match the quality of state-of-the-art methods, with improvements in time with respect to some of them and greater interpretability. [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]

In recent years, due to the rapid growth of the world's population, the demand for agricultural products and food is growing increasingly. Therefore, the agricultural supply chain optimization has been grabbed by researchers to reduce food security concerns. On the other hand, the production amount of farmers is affected by various factors, including environmental conditions. In this paper, a supply chain network is investigated by developing a Mixed-Integer Linear Programming (MILP) model to effectively improve economic objectives under uncertainty. Then, a scenario-based robust optimization approach is employed to deal with the uncertainty. One of the novelities of our paper is considering weather conditions and economic fluctuations in different scenarios. The effectiveness of the proposed mathematical model has been confirmed by a real case study of dates farms. Dates and its by-products have a significant role in GDP, job creation, export, and the creation of various packaging and processing. Moreover, three meta-heuristic algorithms including Whale Optimization Algorithm (WOA), Particle Swarm Optimization (PSO), and a hybrid algorithm based on them (WOA–PSO) are adapted to deal with the NP-hardness of the problems. Moreover, the parameters of the proposed algorithms are improved by the Taguchi method, and to achieve more exact measurements, sensitivity analysis is performed. Finally, the numerical results confirmed that the accuracy of the hybrid algorithm was between 1.9 and 2.8%. Therefore, this approach could be practical and efficient for solving large-sized problems. The obtained outcomes demonstrated that the planned model provides tactical considerations for the related managers. [ABSTRACT FROM AUTHOR]

This study focuses on exploring the effects of geometrical imperfections and different analysis methods on the optimum design of Double-Layer Grids (DLGs), as used in the construction industry. A total of 12 notable metaheuristics are assessed and contrasted, and as a result, the Slime Mold Algorithm is identified as the most effective approach for size optimization of DLGs. To evaluate the influence of geometric imperfections and nonlinearity on the optimal design of real-size DLGs, the optimization process is carried out by considering and disregarding geometric nonlinearity while incorporating three distinct forms of geometrical imperfections, namely local imperfections, global imperfections, and combinations of both. In light of the uncertain nature of geometrical imperfections, probabilistic distributions are used to define these imperfections randomly in direction and magnitude. The results demonstrate that it is necessary to account for these imperfections to obtain an optimal solution. It's worth noting that structural imperfections can increase the maximum stress ratio by up to 70%. The analysis also reveals that the initial curvature of members has a more significant impact on the optimal design of structures than the nodal installation error, indicating the need for greater attention to local imperfection issues in space structure construction. [ABSTRACT FROM AUTHOR]

In this paper, a new algorithm named the improved transient search optimization algorithm (ITSOA) is utilized to solve classical test functions, optimize the consumption of building energy, and optimize hybrid energy system production. The conventional TSOA draws inspiration from the fleeting behavior of electrical circuits with energy storage components. Rosenbrock's direct rotation technique is used to improve the traditional TSOA performance against exploration and exploitation unbalance. First, the ITSOA performance is investigated in solving 23 classical benchmark functions, and the outcomes have shown the superior capability of the recommended algorithm in comparison with the conventional TSOA, DMO, SHO, GA, MRFO, and PSO methods. Also, the ITSOA proficiency is verified in solving the building energy optimization (BEO) problem for minimizing the energy usage of two simple and detailed buildings. The optimization results showed that the optimized solutions of ITSOA in single and multi-objective optimizations compared to conventional TSOA, DMO, SHO, GA, MRFO, and PSO obtained a lower value of the cost function. Also, the superiority of ITSOA has been confirmed to solve the BEO compared to previous methods. Moreover, the multi-objective optimization results have shown that ITSOA is able to determine the ultimate solution among the Pareto front set based on the fuzzy decision-making approach and building energy utilization decisions. [ABSTRACT FROM AUTHOR]

In the coming decade, as restrictions on fossil fuel usage become more stringent, investment in renewable energy projects presents an increasingly appealing opportunity. Evaluating investment attractiveness involves considering both profitability and investment risk. This study proposes a multi-objective mathematical model for identifying the optimal Renewable Energy Project Portfolio (REPP), aiming to maximize net present value while minimizing investment risk. The key innovation of this model is its incorporation of project lifetime and workforce employment considerations to discern the best REPP. To optimize the objective functions of this mathematical model, a hybrid meta-heuristic algorithm combining Artificial Immune System (AIS) and Artificial Fish Swarm (AFS) algorithms is introduced. Genuine data from a varied spectrum of renewable energy projects spanning 20 countries has been meticulously collected. The proposed model is optimized using this dataset, considering portfolio sizes of 3, 5, 10, and 15. The numerical results indicate that, at a specific investment risk threshold, the proposed hybrid algorithm outperforms both AIS and AFS in terms of profitability. Furthermore, the assessment of the geographical distribution of selected projects reveals a deliberate effort to avoid concentration in any specific region, demonstrating a commitment to identifying optimal investment opportunities globally. This research advances the understanding of renewable energy project portfolio optimization, providing valuable insights for investors, policymakers, and sustainable development practitioners. [ABSTRACT FROM AUTHOR]

In this paper, a novel Moth-Flame Optimization (MFO) algorithm, namely MFO algorithm enhanced by Multiple Improvement Strategies (MISMFO) is proposed for solving parameter optimization in Multi-Kernel Support Vector Regressor (MKSVR), and the MISMFO-MKSVR model is further employed to deal with the software effort estimation problems. In MISMFO, the logistic chaotic mapping is applied to increase initial population diversity, while the mutation and flame number phased reduction mechanisms are carried out to improve the search efficiency, as well the adaptive weight adjustment mechanism is used to accelerate convergence and balance exploration and exploitation. The MISMFO model is verified on fifteen benchmark functions and CEC 2020 test set. The results show that the MISMFO has advantages over other meta-heuristic algorithms and MFO variants in terms of convergence speed and accuracy. Additionally, the MISMFO-MKSVR model is tested by simulations on five software effort datasets and the results demonstrate that the proposed model has better performance in software effort estimation problem. The Matlab code of MISMFO can be found at https://github.com/loadstar1997/MISMFO. [ABSTRACT FROM AUTHOR]

Shape-morphing capabilities are crucial for enabling multifunctionality in both biological and artificial systems. Various strategies for shape morphing have been proposed for applications in metamaterials and robotics. However, few of these approaches have achieved the ability to seamlessly transform into a multitude of volumetric shapes post-fabrication using a relatively simple actuation and control mechanism. Taking inspiration from thick origami and hierarchies in nature, we present a hierarchical construction method based on polyhedrons to create an extensive library of compact origami metastructures. We show that a single hierarchical origami structure can autonomously adapt to over 103 versatile architectural configurations, achieved with the utilization of fewer than 3 actuation degrees of freedom and employing simple transition kinematics. We uncover the fundamental principles governing theses shape transformation through theoretical models. Furthermore, we also demonstrate the wide-ranging potential applications of these transformable hierarchical structures. These include their uses as untethered and autonomous robotic transformers capable of various gait-shifting and multidirectional locomotion, as well as rapidly self-deployable and self-reconfigurable architecture, exemplifying its scalability up to the meter scale. Lastly, we introduce the concept of multitask reconfigurable and deployable space robots and habitats, showcasing the adaptability and versatility of these metastructures. Enabling complex shape morphing in engineering systems remains a significant challenge. In this work, authors demonstrate that a transformer-like hierarchical origami metastructure can self-reconfigure into over 1000 versatile structures with fewer than 3 actuation degrees of freedom and simple control. [ABSTRACT FROM AUTHOR]

In many engineering optimization problems, the number of function evaluations is severely limited by the time or cost constraints. These limitations present a significant challenge in the field of global optimization, because existing metaheuristic methods typically require a substantial number of function evaluations to find optimal solutions. This paper presents a new metaheuristic optimization algorithm that considers the information obtained by a radial basis function neural network (RBFNN) in terms of the objective function for guiding the search process. Initially, the algorithm uses the maximum design approach to strategically distribute a set of solutions across the entire search space. It then enters a cycle in which the RBFNN models the objective function values from the current solutions. The algorithm identifies and uses key neurons in the hidden layer that correspond to the highest objective function values to generate new solutions. The centroids and standard deviations of these neurons guide the sampling process, which continues until the desired number of solutions is reached. By focusing on the areas of the search space that yield high objective function values, the algorithm avoids exhaustive solution evaluations and significantly reduces the number of function evaluations. The effectiveness of the method is demonstrated through a comparison with popular metaheuristic algorithms across several test functions, where it consistently outperforms existing techniques, delivers higher-quality solutions, and improves convergence rates. [ABSTRACT FROM AUTHOR]

Parameter identification of solar photovoltaic (PV) cells is crucial for the PV system modeling. However, finding optimal parameters of PV models is an intractable problem due to the highly nonlinear characteristics between currents and voltages in different environments. To address this problem, whale optimization algorithm (WOA)-based meta-heuristic algorithm has turned out to be a feasible and effective approach. As a highly promising optimization algorithm, different enhanced WOA variants have been proposed. Nevertheless, there has been no comparative study of WOA and its variants for parameter identification of PV models so far. To further investigate and analyze the performance of WOA in the studied problem, this work applied and compared WOA and ten enhanced WOA variants for identifying five PV model parameters. Different evaluation indices including solution accuracy, search robustness, and convergence curve were employed to reveal their performance variation. Based on the simulation results, a multi-model statistical analysis with the Friedman test at a confidence level 0.05 was conducted to rank all algorithms. EWOA that hybridizes the sorting-based differential mutation operator and the Lévy flight strategy ranked first and its performance was further verified. Besides, according to the simulation results, possible effective improvement directions for WOA in tackling this intractable problem are concluded to guide future work. [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]

The Internet of Things (IoT) is an extensive system of interrelated devices equipped with sensors to monitor and track real world objects, spanning several verticals, covering many different industries. The IoT's promise is capturing interest as its value in healthcare continues to grow, as it can overlay on top of challenges dealing with the rising burden of chronic disease management and an aging population. To address difficulties associated with IoT-enabled healthcare, we propose a secure routing protocol that combines a fuzzy logic system and the Whale Optimization Algorithm (WOA) hierarchically. The suggested method consists of two primary approaches: the fuzzy trust strategy and the WOA-inspired clustering methodology. The first methodology plays a critical role in determining the trustworthiness of connected IoT equipment. Furthermore, a WOA-based clustering framework is implemented. A fitness function assesses the likelihood of IoT devices acting as cluster heads. This formula considers factors such as centrality, range of communication, hop count, remaining energy, and trustworthiness. Compared with other algorithms, the proposed method outperformed them in terms of network lifespan, energy usage, and packet delivery ratio by 47%, 58%, and 17.7%, respectively. [ABSTRACT FROM AUTHOR]

Child Drawing Development Optimization is a recently developed metaheuristic algorithm that has been demonstrated to perform well on multiple benchmark tests. In this paper, a binary Child Drawing Development Optimization (BCDDO) is proposed for wrapper feature selection. The proposed BCDDO is utilized to choose a subset of important features to reach the highest classification accuracy. Harris Hawk optimization, salp swarm algorithm, gray wolf optimization, and whale optimization algorithm are utilized to evaluate the effectiveness and efficiency of the suggested feature selection method. In the field of feature selection to improve classification accuracy, the proposed method has gained a considerable classification accuracy advantage over previously mentioned methods. Four datasets are used in this research work; breast cancer, moderate COVID, big COVID, and Iris using XGBoost classifier and the classification accuracies were (98.83%, 98.75%, 99.36%, and 96%), respectively, for the four mentioned datasets. [ABSTRACT FROM AUTHOR]

The intrusion detection system is responsible for revealing different intrusion activities, including the denial of service, man-in-middle, Mirai, Scan, and other types of intrusion activities. It is used in many applications, including the smart home Internet of Things networks, where security risks threaten the privacy of individuals. In this context, many works were proposed for detecting and classifying the different types of attacks. However, many challenges are identified for this type of problem, such as the large amount of data available, the imbalanced nature of the data, and the quality of detection and classification outcomes. This paper aims to address these challenges by proposing an approach that considers a metaheuristic-based random weight neural network to detect intrusion activities and classify the different types and subtypes of activities. The following points summarize the contribution of this paper. First, the automatic tuning of the neural network parameters where the weights, biases, regularization value, the number of neurons, and the type of activation function are optimized by different metaheuristic algorithms to produce high-quality results. Second, the proposed approach adopts a clustering with reduction technique to tackle the challenge of processing large volumes of data. Third, oversampling the dataset is also embedded in the proposed approach to avoid a biased classification of the majority class. The experiments are conducted based on a large dataset with more than half a million instances. The results show that the proposed approach outperforms the other classification approaches in geometric mean (G-Mean) and has promising results. [ABSTRACT FROM AUTHOR]

In artificial intelligence (AI), optimization techniques are used to solve several problems in different fields. One of these areas is software reliability verification, which is an important part of software products, as it helps determine how reliable the software is to complete its functions. This is done by estimating the parameters of software reliability growth models (SRGMs). SRGMs predict the expected number of failures after completion, while also serving as an indicator of software readiness for delivery. Therefore, this study aims to optimize the estimation of these parameters based on the available failure data using one of the stochastic optimization algorithms, the simulated annealing algorithm (SA) due to its power and effectiveness. Three SRGMs' models are studied: delayed S-shaped, Musa-Okumoto logarithmic and Power models, to examine the feasibility of the proposed algorithm using five different data sets. The results were compared and analyzed with several algorithms: Particle swarm optimization (PSO), cuckoo search (CS), modify whale optimization algorithm (MWOA), S-shaped model with logistic TEF and social spider algorithm (SSA). A comparison was also made with recent SRGMs that do not rely on AI techniques. The results showed that the proposed algorithm based on SA outperformed all other methods in finding the optimal parameters. [ABSTRACT FROM AUTHOR]

This paper introduces a novel meta-heuristic algorithm named Rhinopithecus Swarm Optimization (RSO) to address optimization problems, particularly those involving high dimensions. The proposed algorithm is inspired by the social behaviors of different groups within the rhinopithecus swarm. RSO categorizes the swarm into mature, adolescent, and infancy individuals. Due to this division of labor, each category of individuals employs unique search methods, including vertical migration, concerted search, and mimicry. To evaluate the effectiveness of RSO, we conducted experiments using the CEC2017 test set and three constrained engineering problems. Each function in the test set was independently executed 36 times. Additionally, we used the Wilcoxon signed-rank test and the Friedman test to analyze the performance of RSO compared to eight well-known optimization algorithms: Dung Beetle Optimizer (DBO), Beluga Whale Optimization (BWO), Salp Swarm Algorithm (SSA), African Vultures Optimization Algorithm (AVOA), Whale Optimization Algorithm (WOA), Atomic Retrospective Learning Bare Bone Particle Swarm Optimization (ARBBPSO), Artificial Gorilla Troops Optimizer (GTO), and Harris Hawks Optimization (HHO). The results indicate that RSO exhibited outstanding performance on the CEC2017 test set for both 30 and 100 dimension. Moreover, RSO ranked first in both dimensions, surpassing the mean rank of the second-ranked algorithms by 7.69% and 42.85%, respectively. Across the three classical engineering design problems, RSO consistently achieves the best results. Overall, it can be concluded that RSO is particularly effective for solving high-dimensional optimization problems. [ABSTRACT FROM AUTHOR]

This study examined the optimal size of an autonomous hybrid renewable energy system (HRES) for a residential application in Buea, located in the southwest region of Cameroon. Two hybrid systems, PV-Battery and PV-Battery-Diesel, have been evaluated in order to determine which was the better option. The goal of this research was to propose a dependable, low-cost power source as an alternative to the unreliable and highly unstable electricity grid in Buea. The decision criterion for the proposed HRES was the cost of energy (COE), while the system's dependability constraint was the loss of power supply probability (LPSP). The crayfish optimization algorithm (COA) was used to optimize the component sizes of the proposed HRES, and the results were contrasted to those obtained from the whale optimization algorithm (WOA), sine cosine algorithm (SCA), and grasshopper optimization algorithm (GOA). The MATLAB software was used to model the components, criteria, and constraints of this single-objective optimization problem. The results obtained after simulation for LPSP of less than 1% showed that the COA algorithm outperformed the other three techniques, regardless of the configuration. Indeed, the COE obtained using the COA algorithm was 0.06%, 0.12%, and 1% lower than the COE provided by the WOA, SCA, and GOA algorithms, respectively, for the PV-Battery configuration. Likewise, for the PV-Battery-Diesel configuration, the COE obtained using the COA algorithm was 0.065%, 0.13%, and 0.39% lower than the COE provided by the WOA, SCA, and GOA algorithms, respectively. A comparative analysis of the outcomes obtained for the two configurations indicated that the PV-Battery-Diesel configuration exhibited a COE that was 4.32% lower in comparison to the PV-Battery configuration. Finally, the impact of the LPSP reduction on the COE was assessed in the PV-Battery-Diesel configuration. The decrease in LPSP resulted in an increase in COE owing to the nominal capacity of the diesel generator. [ABSTRACT FROM AUTHOR]

The energy management (EM) solution of the multi-microgrids (MMGs) is a crucial task to provide more flexibility, reliability, and economic benefits. However, the energy management (EM) of the MMGs became a complex and strenuous task with high penetration of renewable energy resources due to the stochastic nature of these resources along with the load fluctuations. In this regard, this paper aims to solve the EM problem of the MMGs with the optimal inclusion of photovoltaic (PV) systems, wind turbines (WTs), and biomass systems. In this regard, this paper proposed an enhanced Jellyfish Search Optimizer (EJSO) for solving the EM of MMGs for the 85-bus MMGS system to minimize the total cost, and the system performance improvement concurrently. The proposed algorithm is based on the Weibull Flight Motion (WFM) and the Fitness Distance Balance (FDB) mechanisms to tackle the stagnation problem of the conventional JSO technique. The performance of the EJSO is tested on standard and CEC 2019 benchmark functions and the obtained results are compared to optimization techniques. As per the obtained results, EJSO is a powerful method for solving the EM compared to other optimization method like Sand Cat Swarm Optimization (SCSO), Dandelion Optimizer (DO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), and the standard Jellyfish Search Optimizer (JSO). The obtained results reveal that the EM solution by the suggested EJSO can reduce the cost by 44.75% while the system voltage profile and stability are enhanced by 40.8% and 10.56%, respectively. [ABSTRACT FROM AUTHOR]

The mechanical properties of arteries are often assessed with biaxial testing. Constitutive models are fitted to the experimental stress-stretch responses to determine relations describing the intrinsic characteristics of the material. Nonlinear least square-based optimization routines and the Levenberg–Marquardt and Trust-Region-Reflective algorithms are commonly used for fitting. But they may not always produce the best fit for the experimental data. We describe a different optimized fitting routine that can significantly improve the constitutive model fit quality. Experimental stress-stretch data were obtained from biaxial testing of 16 human superficial femoral arteries. A metaheuristic population-based algorithm, Differential Evolution (DE), and loss functions based on the Minkowski and Chebyshev Distance functions were used to improve the fit with common constitutive relations. Hyperparameter tuning by grid search method was performed to determine how algorithm settings affect the fit quality. The DE algorithm showed a superior fit in all samples compared to the traditional algorithms. The loss functions based on Minkowski Distance and Chebyshev relations rather than the square error produced better fits. This allows describing the experimental data with simpler constitutive relations that have fewer material parameters, which reduces the complexity and improves the efficiency of computational implementations. [ABSTRACT FROM AUTHOR]

This work presents two solution methods for the m-machine robust permutation flow shop problem with processing time uncertainty. The goal is to minimize the makespan of the worst-case scenario by utilizing an approach based on budgeted uncertainty, in which only a subset of operations will reach their worst-case processing time values. To obtain efficient solutions to this problem, we first extend an existing two-machine worst-case procedure, based on dynamic programming, generalizing it to m machines. The worst-case calculation is then incorporated into two proposed solution methods: an exact column-and-constraint generation algorithm and a GRASP metaheuristic. Based on experiments with four sets of literature-based instances, empirical results demonstrate the ability of the GRASP to efficiently produce an optimal or near-optimal solution in most cases. [ABSTRACT FROM AUTHOR]

The main resources in software projects are human resources equipped with various skills, which makes software development a typical intelligence-intensive process. Therefore, effective human resource scheduling is indispensable for the success of software projects. The aim of software project scheduling is to assign the right employee to the right activity at the right time. Uncertainty is inevitable in software development, which further complicates the scheduling of projects. We investigate the software project scheduling problem with uncertain activity durations (SPSP-UAD) and aim at obtaining effective scheduling policies for the problem. We present and transform a scenario-based non-linear chance-constrained stochastic programming model into an equivalent linear programming model. To solve the NP-hard SPSP-UAD efficiently, we develop a hybrid meta-heuristic TLBO-GA that combines the teaching–learning-based optimization algorithm (TLBO) and the genetic algorithm (GA). Our TLBO-GA is also equipped with some problem-specific operators, such as population initialization, rows exchange and local search. We use simulation to evaluate the scheduling policies obtained by our algorithms. Extensive computational experiments are conducted to evaluate the performance of our TLBO-GA in comparison to the exact solver CPLEX and four existing meta-heuristic algorithms. The comparative results reveal the effectiveness and efficiency of our TLBO-GA. Our TLBO-GA provides an extensible and adaptive automated scheduling decision support tool for the software project manager in the complex and uncertain software development environment. [ABSTRACT FROM AUTHOR]