Search

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]

Banking, a vital economic pillar worldwide, thrives with effective management, aiding economic growth. Mitigating risks and addressing cost control are key challenges. Prioritizing strategies to enhance performance in both risk management and cost efficiency is crucial for the banking sector's success and economic stability. One approach is to select partners in such a way that the risk of bank insolvency and total costs are reduced, and the capital adequacy of the bank is increased. So, in this work, we first created a mathematical model to achieve the above goals in the field of banking using the approach of selecting partners. In this model, three objective functions are considered for the optimal selection of partners, two of which aim to minimize risk and cost, and the last objective is to maximize capital adequacy. To solve this multi-objective model, we implemented an integrated intelligent system. A combination of a multiobjective genetic algorithm and a neural network was used in this system. A multilayer perceptron neural network is used to calculate the nondeterministic parameters based on the data from different periods. The proposed method was evaluated using a numerical example in MATLAB software. The obtained results and their comparison with one of the classic algorithms show the superiority and reliability of this intelligent system. Using this system, the optimal partners can be selected to achieve the set goals. The most important factors in the field of risk have been identified. Then, a meta-heuristic multiobjective algorithm (NSGA-II) along with an intelligent neural network system has been used to optimally select partners. According to this intelligent system, a suitable methodology is presented along with the optimization algorithm. [ABSTRACT FROM AUTHOR]

In modern production environments where perishable products are manufactured in a job shop system, machine reliability is of utmost importance, and delays during job processing are not acceptable. Therefore, it becomes crucial to consider machines maintenance activities and set upper bounds for interruptions between job operations. This paper tackels the Flexible Job Shop Scheduling Problem taking into account these factors. The study is conducted in two phases. Initially, a novel Mixed-Integer Linear Programming (MILP) model is elaborated for the problem and juxtaposed with the Benders decomposition method to assess computational efficiency. Nevertheless, owing to the elevated complexity of the problem, attaining an optimal solution for instances of realistic size poses an exceptionally challenging task using exact methods. Thus, in the second stage, a Discrete Grey Wolf Optimizer (D-GWO) as an alternative approach to solve the problem is proposed. The performance of the extended algorithms is evaluated through numerical tests. The findings indicate that for small instances, the Benders decomposition method outperforms other approaches. Nevertheless, as the instances grow in size, the efficiency of exact methods diminishes, and the Discrete Grey Wolf Optimizer (D-GWO) performs better under such conditions. Overall, this study highlights the importance of considering machines maintenance activities and interruptions in scheduling of job shop for the production of perishable products. The proposed model and Benders decomposition method in small instances, and the metaheuristic algorithm in large instances provide viable solutions. [ABSTRACT FROM AUTHOR]

Structural health monitoring (SHM) is an important and practical procedure for ensuring the structural integrity and serviceability of civil engineering structures such as bridges, buildings, and dams. Model-driven or data-driven strategies for structural response prediction are now widely combined with advances in engineering for use in SHM applications. Engineers have recently demonstrated increasing interest in using machine learning (ML) and artificial intelligence (AI) to achieve a variety of benefits and possibilities, notably for predicting structural reactions. This study serves as a comprehensive overview of the use of ML applications for structural response prediction in the context of SHM for civil engineering structures, with a particular focus on ML, deep learning (DL), and meta-heuristic algorithms. Accordingly, this study summarizes existing knowledge, presents concepts in a simple way, highlights trends, provides methodological insights, and provides a valuable resource for researchers, stakeholders, and decision-makers to benefit from. It is observed that the use of ML, DL, and meta-heuristic algorithms to predict the response of civil engineering structures within an acceptable accuracy range can be employed for SHM, resulting in improved speed, efficiency, and accuracy compared to conventional approaches. [ABSTRACT FROM AUTHOR]

Intelligent scheduling of knitting workshops is the key to realizing knitting intelligent manufacturing. In view of the uncertainty of the workshop environment, it is difficult for existing scheduling algorithms to flexibly adjust scheduling strategies. This paper proposes a scheduling algorithm architecture based on deep reinforcement learning (DRL). First, the scheduling problem of knitting intelligent workshops is represented by a disjunctive graph, and a mathematical model is established. Then, a multi-proximal strategy (multi-PPO) optimization training algorithm is designed to obtain the optimal strategy, and the job selection strategy and machine selection strategy are trained at the same time. Finally, a knitting intelligent workshop scheduling experimental platform is built, and the algorithm proposed in this paper is compared with common heuristic rules and metaheuristic algorithms for experimental testing. The results show that the algorithm proposed in this paper is superior to heuristic rules in solving the knitting workshop scheduling problem, and can achieve the accuracy of the metaheuristic algorithm. In addition, the response speed of the algorithm in this paper is excellent, which meets the production scheduling needs of knitting intelligent workshops and has a good guiding significance for promoting knitting intelligent manufacturing. [ABSTRACT FROM AUTHOR]

Optimization is a mathematical discipline or tool suitable for minimizing or maximizing a function. It has been largely used in every scientific field to solve problems where it is necessary to find a local or global optimum. In the engineering field of localization, optimization has been adopted too, and in the literature, there are several proposals and applications that have been presented. In the first part of this article, the optimization problem is presented by considering the subject from a purely theoretical point of view and both single objective (SO) optimization and multi-objective (MO) optimization problems are defined. Additionally, it is reported how local and global optimization problems can be tackled differently, and the main characteristics of the related algorithms are outlined. In the second part of the article, extensive research about local and global localization algorithms is reported and some optimization methods for local and global optimum algorithms, such as the Gauss–Newton method, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), and so on, are presented; for each of them, the main concept on which the algorithm is based, the mathematical model, and an example of the application proposed in the literature for localization purposes are reported. Among all investigated methods, the metaheuristic algorithms, which do not exploit gradient information, are the most suitable to solve localization problems due to their flexibility and capability in solving non-convex and non-linear optimization functions. [ABSTRACT FROM AUTHOR]

This study proposes a method to enhance the Chaos Game Optimization (CGO) algorithm for efficient multilevel image thresholding by incorporating a fitness distance balance mechanism. Multilevel thresholding is essential for detailed image segmentation in digital image processing, particularly in environments with complex image characteristics. This improved CGO algorithm adopts a hybrid metaheuristic framework that effectively addresses the challenges of premature convergence and the exploration-exploitation balance, typical of traditional thresholding methods. By integrating mechanisms that balance fitness and spatial diversity, the proposed algorithm achieves improved segmentation accuracy and computational efficiency. This approach was validated through extensive experiments on benchmark datasets, comparing favorably against existing state-of-the-art methods. [ABSTRACT FROM AUTHOR]

In the distribution system, proper placement of distributed generation (DG) is still a very challenging issue for getting their maximum potential benefits. Power system stability should be determined through load modeling, hybrid energy storage system (HESS), and photovoltaics (PV) modeling. This paper proposed the optimal sizing and location of photovoltaic using the Modified Harris Hawk Optimization (MHHO) algorithm. The energy generated from the photovoltaic (PV) is stored in the HESS, where the energy's charging and discharging from the storage unit is framed with a reduced power loss (active and reactive power). The optimal sizing and placement of the PV system will provide better voltage stability. The Modified Harris Hawk Optimization Algorithm (MHHO) frames the system's voltage stability. The Newton-Raphson load flow method is used to analyze the loading in the power system. The IEEE 33 and 69 bus systems are used to analyze the load flow to the consumers, thus analyzing the power system's dynamic performance. The performance and voltage stability of the presented model are compared with the existing optimization techniques, which include the Firefly Algorithm (FA), Crow Search Optimization (CSO), Particle Swarm Optimization (PSO), Analytical PSO (APSO), Improved Cayote Optimization Algorithm (COA) and Whale optimization algorithm (WOA) through the MATLAB/Simulink platform. [ABSTRACT FROM AUTHOR]

Scientific and accurate wind predictions are the basis for exploiting and utilizing wind energy. Combining the VMD and KELM, this research proposes a new hybrid model to capture the pattern of wind speed change, the parameters of which are optimized by the Spotted Hyena Optimizer(SHO) and Seagull Optimization Algorithm(SOA), respectively. The VMD is optimized by the SHO to achieve the purpose of adaptive decomposition of historical wind speed time series. After that, the parameters of the KELM are optimized by the SOA. Then, the decomposed wind speed series is input into the optimized KELM. The output prediction Intrinsic Mode Functions(IMFs) is added up to obtain the short-term wind speed prediction results. The measured wind speeds for four seasons were selected as the case study for the proposed model. The prediction results are compared with the measured wind speed series to verify the accuracy and reliability of the model. Besides, the prediction accuracy and stability of the proposed model are better than traditional prediction models, with stronger performance and lower computational cost. The results of case studies indicate that the proposed model can satisfy the need for actual applications. [ABSTRACT FROM AUTHOR]

Copyright of Przegląd Elektrotechniczny is the property of Przeglad Elektrotechniczny and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

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 recent years, researchers have paid increasing attention to Peer to Peer lending market. In this lending method, the lenders don't usually have enough knowledge to understand how much money must be allocated in each loan. So, it is important to help investors to assess the loans. According to the needs of investors, generally, a bi-objective optimization model is considered that maximizes return and minimizes risk. In current work, internal rate of return as return and probability of default as risk variable is considered. First, an artificial neural network is used to evaluate the return. Then, we apply logistic regression to predict the probability of loan default. After providing the model, due to its complexity, one of the essential issues is solving it. In this study, the model is solved by metaheuristic algorithms. This is done from different points of view, including non-dominated sorting genetic algorithm II, multi-objective particle swarm optimization, and Pareto envelope-based selection algorithm II. Finally, from the perspective of an investor, the best algorithm is introduced. [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]

In this paper, a new hybrid meta-heuristic algorithm called CEBWO (cross-entropy method and beluga whale optimization) is presented to solve the mean-CVaR portfolio optimization problem based on jump-diffusion processes. The proposed CEBWO algorithm combines the advantages of the cross-entropy method and beluga whale optimization algorithm with the help of co-evolution technology to enhance the performance of portfolio selection. The method is evaluated on 29 unconstrained benchmark functions from CEC 2017, where its performance is compared against several state-of-the-art algorithms. The results demonstrate the superiority of the hybrid method in terms of solution quality and convergence speed. Finally, Monte Carlo simulation is employed to generate scenario paths based on the jump-diffusion model. Empirical results further confirm the effectiveness of the hybrid meta-heuristic algorithm for mean-CVaR portfolio selection, highlighting its potential for real-world applications. [ABSTRACT FROM AUTHOR]

Predicting the system efficiency of green energy and developing forward-looking power technologies are key points to accelerating the global energy transition. This research focuses on optimizing the parameters of proton exchange membrane fuel cells (PEMFCs) and photovoltaic (PV) cells using the honey badger algorithm (HBA), a swarm intelligence algorithm, to accurately present the performance characteristics and efficiency of the systems. Although the HBA has a fast search speed, it was found that the algorithm's search stability is relatively low. Therefore, this study also enhances the HBA's global search capability through the rapid iterative characteristics of spiral search. This method will effectively expand the algorithm's functional search range in a multidimensional and complex solution space. Additionally, the introduction of a sigmoid function will smoothen the algorithm's exploration and exploitation mechanisms. To test the robustness of the proposed methodology, an extensive test was conducted using the CEC'17 benchmark functions set and real-life applications of PEMFC and PV cells. The results of the aforementioned test proved that with regard to the optimization of PEMFC and PV cell parameters, the improved HBA is significantly advantageous to the original in terms of both solving capability and speed. The results of this research study not only make definite progress in the field of bio-inspired computing but, more importantly, provide a rapid and accurate method for predicting the maximum power point for fuel cells and photovoltaic cells, offering a more efficient and intelligent solution for green energy. [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]

Previous works have proposed various techniques to address the premature convergence problem, where candidate solutions get trapped in local optima instead of reaching the global optimum. This has been tackled using different selection methods in metaheuristic search algorithms. However, while much of the literature focuses on either the search operators or the creation of algorithm variants, research indicates that the effectiveness of the search procedure depends on both the search operators and the selection methods. Incorporating problem-specific functional weights enhances dynamic adaptation to data patterns, reflects data relevance, and improves generalization. This paper offers an enhanced Artificial Bee Colony algorithm including functional weights and a modified selection strategy (ABC-FWMSS) to prioritize features, aiming to achieve an optimal solution and a dynamic balance between exploration and exploitation. The exploration ability of the Artificial Bee Colony is enhanced using pretrained model functional weights during the employed bee phase, while its exploitative capabilities are boosted using tournament selection and employed bee index during the onlooker bee phase. This approach dynamically balances exploration and exploitation. The proposed method achieved 96% precision on the 20 Newsgroups dataset, with the highest fitness score and a 48.8% drop in the number of selected features. [ABSTRACT FROM AUTHOR]

An efficient credit risk management model is a promising technique that provides Financial Institutions or Banks the ability to determine a creditworthy customer from a non-worthy customer. The fact remains that no country’s economy can survive or improve without credit using historically available data. This paper presents an evaluation of several gradient descent techniques, and metaheuristic optimization algorithms implemented in Machine Learning and Multi-layer perceptron for better credit risk prediction. It also handles imbalanced dataset using smote Edited Nearest Neighbour. The study provided various architectures and advantages of the algorithms while addressing how the limitations can be improved to build a better credit risk model and improve model accuracy. The study showed MLP WOA achieved accuracy of 98.56% based on Adam gradient descent to achieve faster convergence and exploration compared to MLP PSO with 98.39%. [ABSTRACT FROM AUTHOR]

Numerous heuristic and metaheuristic algorithms inspired by nature have been developed so far. These algorithms have demonstrated their excellence in resolving challenging problems across a variety of fields. However, many optimization algorithms fail while solving a complex real-world problem efficiently in an independent way because these problems have a distinct search behavior as they contain numerous equality and inequality constraints of the linear, nonlinear, and non-convex types. In this study, two optimization algorithms: the Marine Predators Algorithm (MPA) and the Social Group Optimization (SGO) algorithm are hybridized in order to increase their efficiency and problem-solving capability to solve this type of problem. This proposed hybrid optimization algorithm is named as Marine Predators Social Group Optimization (MPSGO) algorithm. This hybrid algorithm combines the strengths of both techniques to enhance the efficiency and effectiveness of the optimization process. It is validated through thirty benchmark functions of CEC2014 and after that 26 real-world optimization problems test suites of CEC 2020 from the chemical and mechanical engineering domain have been solved. The validation results are compared with ten state-of-art optimization algorithm and real-world optimization problem result is compared with BiPop matrix adaptation evolution strategy (BP-ϵMAg-ES), enhanced Multi-Operator Differential Evolution (EnMODE), LSHADE for Constrained Optimization (COLSHADE), Cohort Intelligence self-adaptive penalty function (CI-SAPF), and Cohort Intelligence self-adaptive penalty function Colliding Bodies Optimization (CI-SAPF-CBO). As MPSGO is a hybrid algorithm, again we have compared its performance with the seven best modified and improved optimization algorithms. In terms of convergence quality and improving solution quality, the simulated results of MPSGO have been shown to be competitive with those of state-of-the-art, hybrid, improved, and advanced optimization algorithms, proving the validity as well as the feasibility of the MPSGO algorithm. [ABSTRACT FROM AUTHOR]

Big data is generally derived with a large volume and combined categories of attributes like categorical and numerical. Among them, k -prototypes have been adopted into MapReduce structure, and thus, it provides a better solution for the huge range of data. However, k -prototypes need to compute all distances among every data point and cluster centres. Moreover, the computations of distances are redundant as data points are often present in similar clusters after fewer iterations. Nowadays, to cluster huge-scale datasets, one of the efficient solutions is k -means. However, k -means is not intrinsically appropriate to execute in MapReduce due to the iterative nature of this technique. Moreover, for every iteration, k -means should perform an independent MapReduce job but, it leads to higher Input/Output (I/O) overhead at every iteration. This research paper presents a novel enhanced linear time clustering for handling big data called Heuristic mrk-means (H-mrk-means) using optimized k -means on the MapReduce model. In order to manage big data that is time series in nature, the sampling and MapReduce framework are adopted, which utilize different machines for processing data. Before initiating the main clustering process, a sampling process is adopted to get the noteworthy information. The two main phases of the developed method are the map phase (divide and conquer) and the reduce phase (final clustering). In the map phase, the data are divided into diverse chunks that should be stored in assigned machines. In the reduce phase, data clustering is performed. Here, the cluster centroid of data is tuned with the help of hybrid Tunicate-Deer Hunting Optimization (T-DHO) algorithm by attaining a newly derived objective function. This type of optimal tuning of solution enhances the efficiency of clustering when compared over normal iterative k -means and mrk-means clustering. The experimental evaluation on varied counts of chunks using the proposed H-mrk-means has attained higher quality of clustering results and faster execution times evaluated with other clustering approaches. [ABSTRACT FROM AUTHOR]

In this study, we proposed an improved Harris Hawks Optimization (IHHO) algorithm based on the Sobol sequence, Whale Optimization Algorithm (WOA), and t-distribution perturbation. The improved IHHO algorithm was then used to optimize the BP neural network, resulting in the IHHO-BP model. This model was employed to predict the bonding strength of heat-treated wood under varying conditions of temperature, time, feed rate, cutting speed, and grit size. To validate the effectiveness and accuracy of the proposed model, it was compared with the original BP neural network model, WOA-BP, and HHO-BP benchmark models. The results showed that the IHHO-BP model reduced the Mean Absolute Error (MAE), Root Mean Square Error (RMSE), and Mean Absolute Percentage Error (MAPE) by at least 51.16%, 40.38%, and 51.93%, respectively, while increasing the coefficient of determination (R2) by at least 10.85%. This indicates significant model optimization, enhanced generalization capability, and higher prediction accuracy, better meeting practical engineering needs. Predicting the bonding strength of heat-treated wood using this model can reduce production costs and consumption, thereby significantly improving production efficiency. [ABSTRACT FROM AUTHOR]

Strong impacts and vibrations exist in various structures of rice combine harvesters in harvesting, so the bolt connection structure on the harvesters is prone to loosening and failure, which would further affect the service life and working efficiency of the working device and structure. In this paper, based on the vibration signal acquisition experiment on the bolt and connection structure of the vibrating screen on the harvester, failure feature identification is studied. According to the sensitivity analysis results and the primary extraction of the time-frequency feature, most features have limitations on the identification of failure features of vibrating screen bolts. Therefore, based on the establishment of a high-dimensional feature matrix and multivariate fusion feature matrix, the validity of the feature set was verified based on the whale optimization algorithm. And then, based on the SVM method and high-dimensional mapping of the kernel functions, the high-dimensional feature matrix is trained by the LIBSVM classification decision model. The identify success rates of time domain feature matrix A, frequency domain feature matrix B, WOA-VMD energy entropy matrix C, and normalized multivariate fusion feature matrix G are 64.44%, 74.44%, 81.11%, and more than 90%, respectively, which can reflect the applicability of the failure state identification of the normalized multivariate fusion feature matrix. This paper provided a theoretical basis for the identification of a harvester bolt failure feature. [ABSTRACT FROM AUTHOR]

This paper proposes an effective material delivery algorithm to address the challenges associated with Unmanned Aerial Vehicle (UAV) material transportation and delivery, which include complex route planning, low detection precision, and hardware limitations. This novel approach integrates the Whale-Swarm Hybrid Algorithm (WSHA) with the APCR-YOLOv8 model to enhance efficiency and accuracy. For path planning, the placement paths are transformed into a Generalized Traveling Salesman Problem (GTSP) to be able to compute solutions. The Whale Optimization Algorithm (WOA) is improved for balanced global and local searches, combined with an Artificial Bee Colony (ABC) Algorithm and adaptive weight adjustment to quicken convergence and reduce path costs. For precise placement, the YOLOv8 model is first enhanced by adding the SimAM attention mechanism to the C2f module in the detection head, focusing on target features. Secondly, GhoHGNetv2 using GhostConv is the backbone of YOLOv8 to ensure accuracy while reducing model Params and FLOPs. Finally, a Lightweight Shared Convolutional Detection Head (LSCDHead) further reduces Params and FLOPs through shared convolution. Experimental results show that WSHA reduces path costs by 9.69% and narrows the gap between the best and worst paths by about 34.39%, compared to the Improved Whale Optimization Algorithm (IWOA). APCR-YOLOv8 reduces Params and FLOPs by 44.33% and 34.57%, respectively, with mAP@0.5 increasing from 88.5 to 92.4 and FPS reaching 151.3. This approach can satisfy the requirements for real-time responsiveness while effectively preventing missed, false, and duplicate detections during the inspection of emergency airdrop stations. In conclusion, combining bionic optimization algorithms and image processing significantly enhances the efficiency and precision of material placement in emergency management. [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]

Crayfish optimization algorithm (COA) is a novel bionic metaheuristic algorithm with high convergence speed and solution accuracy. However, in some complex optimization problems and real application scenarios, the performance of COA is not satisfactory. In order to overcome the challenges encountered by COA, such as being stuck in the local optimal and insufficient search range, this paper proposes four improvement strategies: search-hide, adaptive spiral elite greedy opposition-based learning, competition-elimination, and chaos mutation. To evaluate the convergence accuracy, speed, and robustness of the modified crayfish optimization algorithm (MCOA), some simulation comparison experiments of 10 algorithms are conducted. Experimental results show that the MCOA achieved the minor Friedman test value in 23 test functions, CEC2014 and CEC2020, and achieved average superiority rates of 80.97%, 72.59%, and 71.11% in the WT, respectively. In addition, MCOA shows high applicability and progressiveness in five engineering problems in actual industrial field. Moreover, MCOA achieved 80% and 100% superiority rate against COA on CEC2020 and the fixed-dimension function of 23 benchmark test functions. Finally, MCOA owns better convergence and population diversity. [ABSTRACT FROM AUTHOR]

The optimization of numerical functions with multiple independent variables was a significant challenge with numerous practical applications in process control systems, data fitting, and engineering designs. Although RNA genetic algorithms offer clear benefits in function optimization, including rapid convergence, they have low accuracy and can easily become trapped in local optima. To address these issues, a new heuristic algorithm was proposed, a gradient descent-based RNA genetic algorithm. Specifically, adaptive moment estimation (Adam) was employed as a mutation operator to improve the local development ability of the algorithm. Additionally, two new operators inspired by the inner-loop structure of RNA molecules were introduced: an inner-loop crossover operator and an inner-loop mutation operator. These operators enhance the global exploration ability of the algorithm in the early stages of evolution and enable it to escape from local optima. The algorithm consists of two stages: a pre-evolutionary stage that employs RNA genetic algorithms to identify individuals in the vicinity of the optimal region and a post-evolutionary stage that applies a adaptive gradient descent mutation to further enhance the solution's quality. When compared with the current advanced algorithms for solving function optimization problems, Adam RNA Genetic Algorithm (RNA-GA) produced better optimal solutions. In comparison with RNA-GA and Genetic Algorithm (GA) across 17 benchmark functions, Adam RNA-GA ranked first with the best result of an average rank of 1.58 according to the Friedman test. In the set of 29 functions of the CEC2017 suite, compared with heuristic algorithms such as African Vulture Optimization Algorithm, Dung Beetle Optimization, Whale Optimization Algorithm, and Grey Wolf Optimizer, Adam RNA-GA ranked first with the best result of an average rank of 1.724 according to the Friedman test. Our algorithm not only achieved significant improvements over RNA-GA but also performed excellently among various current advanced algorithms for solving function optimization problems, achieving high precision in function optimization. [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]

Uncertain multi-modal transport path optimization (UMTPO) is a combined optimization non-deterministic polynomial-time hard problem. Its goal is to determine a path with the lowest total transportation cost and carbon emissions from the starting point to the destination. To effectively address this issue, this article proposes a modified dung beetle optimizer (DBO) to address it. DBO is a swarm-based metaheuristic optimization algorithm that has the features of a fast convergence rate and high solution accuracy. Despite this, the disadvantages of weak global exploration capability and falling easily into local optima exist. In this article, we propose a modified DBO called MSHDBO for function optimization and to solve the UMTPO problem. However, for the vast majority of metaheuristic algorithms, they are designed for continuous problems and cannot directly solve discrete problems. Therefore, this article employs a priority based encoding and decoding method to solve the UMTPO problem. To verify the performance and effectiveness of the MSHDBO algorithm, we compared it with other improved versions of the DBO algorithm used in the literature. We confirmed the excellent performance of MSHDBO using 41 benchmark test functions from the IEEE CEC 2017 test suite and IEEE CEC 2022 test suite. Additionally, we compared the MSHDBO algorithm with 10 other state-of-the-art metaheuristic optimization algorithms through a practical UMTPO problem. The experimental results indicated that the MSHDBO algorithm achieved very good performance when solving the UMTPO problem. [ABSTRACT FROM AUTHOR]

In optimization, metaheuristic algorithms have received extensive attention and research due to their excellent performance. The slime mould algorithm (SMA) is a newly proposed metaheuristic algorithm. It has the characteristics of fewer parameters and strong optimization ability. However, with the increasing difficulty of optimization problems, SMA has some shortcomings in complex problems. For example, the main concerns are low convergence accuracy and prematurely falling into local optimal solutions. To overcome these problems, this paper has developed a variant of SMA called CCSMA. It is an improved SMA based on horizontal crossover (HC) and covariance matrix adaptive evolutionary strategy (CMAES). First, HC can enhance the exploitation of the algorithm by crossing the information between different individuals to promote communication within the population. Finally, CMAES facilitates algorithm exploration and exploitation to reach a balanced state by dynamically adjusting the size of the search range. This benefits the algorithm by allowing it to go beyond the local space to explore other solutions with better quality. To verify the superiority of the proposed algorithm, we select some new original and improved algorithms as competitors. CCSMA is compared with these competitors in 40 benchmark functions of IEEE CEC2017 and CEC2020. The results demonstrate that our work outperforms the competitors in terms of optimization accuracy and jumping out of the local space. In addition, CCSMA is applied to tackle three typical engineering optimization problems. These three problems include multiple disk clutch brake design, pressure vessel design, and speed reducer design. The results showed that CCSMA achieved the lowest optimization cost. This also proves that it is an effective tool for solving realistic optimization problems. [ABSTRACT FROM AUTHOR]

The slime mould algorithm (SMA), as an emerging and promising swarm intelligence algorithm, has been studied in various fields. However, SMA suffers from issues such as easily getting trapped in local optima and slow convergence, which pose challenges when applied to practical problems. Therefore, this study proposes an improved SMA, named HESMA, by incorporating the covariance matrix adaptation evolution strategy (CMA-ES) and storing the best position of each individual (SBP). On one hand, CMA-ES enhances the algorithm's local exploration capability, addressing the issue of the algorithm being unable to explore the vicinity of the optimal solution. On the other hand, SBP enhances the convergence speed of the algorithm and prevents it from diverging to other inferior solutions. Finally, to validate the effectiveness of our proposed algorithm, this study conducted experiments on 30 IEEE CEC 2017 benchmark functions and compared HESMA with 12 conventional metaheuristic algorithms. The results demonstrated that HESMA indeed achieved improvements over SMA. Furthermore, to highlight the performance of HESMA further, this study compared it with 13 advanced algorithms, and the results showed that HESMA outperformed these advanced algorithms significantly. Next, this study applied HESMA to five engineering optimization problems, and the experimental results revealed that HESMA exhibited significant advantages in solving real-world engineering optimization problems. These findings further support the effectiveness and practicality of our algorithm in addressing complex engineering design challenges. [ABSTRACT FROM AUTHOR]

This study examines the problem of crew pairing and rostering under COVID-19 conditions. To keep the cockpit crew members safe against COVID-19, the problem is investigated in such a way that each cockpit crew member spends less daily sit time period in the airports and returns to his/her home base at the end of the day to take a rest. This study aims to introduce a Mixed-Integer Linear Programming (MILP) formulation for the problem. In order to solve the problem, three meta-heuristic algorithms including Genetic Algorithm (GA), Firefly Algorithm (FA), and Particle Swarm Optimization (PSO) are applied based on a new chromosome representation. The proposed algorithms could obtain solutions with the least possible number of cockpit crew members to cover the existing flights by considering some rules and regulation related to employing cockpits. Moreover, the findings indicate that the algorithms can provide solutions near the optimal solutions (1.94%, 2.49%, and 2.43% gaps for the GA, FA, and PSO on average, respectively) for the small-scale instances extracted from the data sets. Additionally, the proposed GA can find lower-cost solutions in comparison to the FA and PSO in approximately similar CPU time for problem instances with different sizes. [ABSTRACT FROM AUTHOR]

In recent years, global trade volume has been increasing, and marine transportation plays a significant role here. In marine transportation, the choice of transportation route has been widely discussed. Minimizing fuel consumption, minimizing voyage time, and maximizing voyage security are concerns of the International Maritime Organization (IMO) regarding Maritime Autonomous Surface Ships (MASS). These goals are contradictory and have not yet been effectively resolved. This paper describes the ship path-planning problem as a multi-objective optimization problem that considers fuel consumption, voyage time, and voyage security. The model considers wind and waves as marine environmental factors. Furthermore, this paper uses an improved Whale Optimization Algorithm to solve multi-objective problems. At the same time, it is compared to three advanced algorithms. Through seven three-objective test functions, the performance of the algorithm is tested and applied in path planning. The results indicate that the algorithm can effectively balance the fuel consumption, voyage time, and voyage security of the ship, offering reasonable paths. [ABSTRACT FROM AUTHOR]

With the wide application of Underwater Wireless Sensor Networks (UWSNs) in various fields, more and more attention has been paid to deploying and adjusting network nodes. A UWSN is composed of nodes with limited mobility. Drift movement leads to the network structure's destruction, communication performance decline, and node life-shortening. Therefore, a Node Adjustment Scheme based on Motion Prediction (NAS-MP) is proposed, which integrates the layered model of the ocean current's uneven depth, the layered ocean current prediction model based on convolutional neural network (CNN)–transformer, the node trajectory prediction model, and the periodic depth adjustment model based on the Seagull Optimization Algorithm (SOA), to improve the network coverage and connectivity. Firstly, the error threshold of the current velocity and direction in the layer was introduced to divide the depth levels, and the regional current data model was constructed according to the measured data. Secondly, the CNN–transformer hybrid network was used to predict stratified ocean currents. Then, the prediction data of layered ocean currents was applied to the nodes' drift model, and the nodes' motion trajectory prediction was obtained. Finally, based on the trajectory prediction of nodes, the SOA obtained the optimal depth of nodes to optimize the coverage and connectivity of the UWSN. Experimental simulation results show that the performance of the proposed scheme is superior. [ABSTRACT FROM AUTHOR]

Foam mixers are classified as low-pressure and high-pressure types. Low-pressure mixers rely on agitator rotation, facing cleaning challenges and complex designs. High-pressure mixers are simple and require no cleaning but struggle with uneven mixing for high-viscosity substances. Traditionally, increasing the working pressure resolved this, but material quality limits it at higher pressures. To address the issues faced by high-pressure mixers when handling high-viscosity materials and to further improve the mixing performance of the mixer, this study focuses on a polyimide high-pressure mixer, identifying four design variables: impingement angle, inlet and outlet diameters, and impingement pressure. Using a Full Factorial Design of Experiments (DOE), the study investigates the impacts of these variables on mixing unevenness. Sample points were generated using Optimal Latin Hypercube Sampling—OLH. Combining the Sparrow Search Algorithm (SSA), Convolutional Neural Network (CNN), and Long Short-Term Memory Network (LSTM), the SSA-CNN-LSTM model was constructed for predictive analysis. The Whale Optimization Algorithm (WOA) optimized the model, to find an optimal design variable combination. The Computational Fluid Dynamics (CFD) simulation results indicate a 70% reduction in mixing unevenness through algorithmic optimization, significantly improving the mixer's performance. [ABSTRACT FROM AUTHOR]

This research introduces a novel approach to enhancing bucket elevator design and operation through the integration of discrete element method (DEM) simulation, design of experiments (DOE), and metaheuristic optimization algorithms. Specifically, the study employs the firefly algorithm (FA), a metaheuristic optimization technique, to optimize bucket elevator parameters for maximizing transport mass and mass flow rate discharge of granular materials under specified working conditions. The experimental methodology involves several key steps: screening experiments to identify significant factors affecting bucket elevator operation, central composite design (CCD) experiments to further explore these factors, and response surface methodology (RSM) to create predictive models for transport mass and mass flow rate discharge. The FA algorithm is then applied to optimize these models, and the results are validated through simulation and empirical experiments. The study validates the optimized parameters through simulation and empirical experiments, comparing results with DEM simulation. The outcomes demonstrate the effectiveness of the FA algorithm in identifying optimal bucket parameters, showcasing less than 10% and 15% deviation for transport mass and mass flow rate discharge, respectively, between predicted and actual values. Overall, this research provides insights into the critical factors influencing bucket elevator operation and offers a systematic methodology for optimizing bucket parameters, contributing to more efficient material handling in various industrial applications. [ABSTRACT FROM AUTHOR]

In recent decades, fog computing has played a vital role in executing parallel computational tasks, specifically, scientific workflow tasks. In cloud data centers, fog computing takes more time to run workflow applications. Therefore, it is essential to develop effective models for Virtual Machine (VM) allocation and task scheduling in fog computing environments. Effective task scheduling, VM migration, and allocation, altogether optimize the use of computational resources across different fog nodes. This process ensures that the tasks are executed with minimal energy consumption, which reduces the chances of resource bottlenecks. In this manuscript, the proposed framework comprises two phases: (i) effective task scheduling using a fractional selectivity approach and (ii) VM allocation by proposing an algorithm by the name of Fitness Sharing Chaotic Particle Swarm Optimization (FSCPSO). The proposed FSCPSO algorithm integrates the concepts of chaos theory and fitness sharing that effectively balance both global exploration and local exploitation. This balance enables the use of a wide range of solutions that leads to minimal total cost and makespan, in comparison to other traditional optimization algorithms. The FSCPSO algorithm's performance is analyzed using six evaluation measures namely, Load Balancing Level (LBL), Average Resource Utilization (ARU), total cost, makespan, energy consumption, and response time. In relation to the conventional optimization algorithms, the FSCPSO algorithm achieves a higher LBL of 39.12%, ARU of 58.15%, a minimal total cost of 1175, and a makespan of 85.87 ms, particularly when evaluated for 50 tasks. [ABSTRACT FROM AUTHOR]

Feature Selection (FS) is a key pre-processing step in pattern recognition and data mining tasks, which can effectively avoid the impact of irrelevant and redundant features on the performance of classification models. In recent years, meta-heuristic algorithms have been widely used in FS problems, so a Hybrid Binary Chaotic Salp Swarm Dung Beetle Optimization (HBCSSDBO) algorithm is proposed in this paper to improve the effect of FS. In this hybrid algorithm, the original continuous optimization algorithm is converted into binary form by the S-type transfer function and applied to the FS problem. By combining the K nearest neighbor (KNN) classifier, the comparative experiments for FS are carried out between the proposed method and four advanced meta-heuristic algorithms on 16 UCI (University of California, Irvine) datasets. Seven evaluation metrics such as average adaptation, average prediction accuracy, and average running time are chosen to judge and compare the algorithms. The selected dataset is also discussed by categorizing it into three dimensions: high, medium, and low dimensions. Experimental results show that the HBCSSDBO feature selection method has the ability to obtain a good subset of features while maintaining high classification accuracy, shows better optimization performance. In addition, the results of statistical tests confirm the significant validity of the method. [ABSTRACT FROM AUTHOR]

The moth search algorithm (MSA) is a meta-heuristic optimization technique inspired by moth behavior, has shown remarkable efficacy in solving optimization challenges. However, its poor exploration capability results in an imbalance between exploitation and exploration. To address this issue, this research introduces a new mutation operator to enhance exploration by increasing population diversity. The proposed enhanced moth search algorithm (EMSA) aims to expedite convergence and improve overall robustness by exploring new solutions more effectively. Evaluation on ten benchmark functions demonstrates EMSA's superior exploration capabilities, efficiently tackling optimization problems and yielding more optimal solutions within the search space. Compared to conventional MSA and other established algorithms, EMSA delivers well-balanced results, showcasing its effectiveness in optimizing the search space. In the future, the EMSA could potentially find applications in addressing real-world engineering optimization challenges. [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]

This study presents a hybrid method, namely the marine predator algorithm (MPA) and Aquila optimizer (AO). The proposed algorithm is named MAO. AO duplicated the existence of the Aquila bird in nature while hunting for prey while MPA was inspired by predators in marine animal life. Although AO is widely accepted, it has several disadvantages. This causes various weaknesses such as a weak exploitation phase and slow growth of the convergence curve. Thus, certain exploitation and exploration in conventional AO can be studied to achieve the best balance. The MPA demonstrates the capacity to deliver optimal design and statistically efficient outcomes. The proposed method used AO as the main algorithm. To measure the performance of the proposed method, this study depicted a comparison using the AO, MPA, and whale optimization algorithm (WOA) methods. This paper was evaluated the performance of MAO on twenty-one CEC2017 benchmark functions test and droop control performance on direct current (DC) microgrid. From the simulation, MAO shows superior convergence ability. The proposed method and its application to droop control was successfully implemented and implied a promising performance. [ABSTRACT FROM AUTHOR]

This paper presents the use of a new hybrid optimization approach known as particle swarm optimization and grey wolf optimizer (PSO-GWO) for improving frequency stability load frequency control (LFC) in tow-area power systems. The approach consists in optimizing the fuzzy proportionalintegral-derivative (fuzzy-PID) controller parameters with meta-heuristic hybrid algorithm: PSO-GWO. This technique allows to have dynamic responses with the least possible frequency deviation in very short response times. The approach proposes to controls the tie-line power and the frequency deviation in the considered two-area power systems under variable perturbation in load and changing of system parameters in order to evaluate its effectiveness. The suggested hybrid algorithm-based fuzzy-PID controller is compared with various widely used control methods in the literature such as PID controller and algorithms such as PSO and GWO in order to evaluate its effectiveness and its robustness. Through the simulations carried out on MATLAB/Simulink, the proposed PSO-GWO fuzzy-PID and the objective function exhibit improved performance, achieving minimal objective values. The proposed technique proved to be quite powerful tool in the resolution of problems related to electrical power systems, particularly in load frequency control. [ABSTRACT FROM AUTHOR]

Reconfiguration strategies are used to reduce power losses and increase the reliability of the distribution systems. Since the optimal reconfiguration problem is a multi-objective optimization problem with non-convex functions and constraints, meta-heuristic algorithms are the most suitable choice for the problem-solving approach. One of the new meta-heuristic algorithms that exhibits excellent performance in solving multi-objective problems is the wild mice colony (WMC) algorithm, which is implemented based on aggressive and mating strategies of wild mice. In this paper, the distribution network reconfiguration problem is solved to reduce power losses, improve reliability, and increase the voltage profile of network buses using the WMC algorithm. In addition, the obtained results are compared with conventional multi-objective algorithms. The optimal reconfiguration problem is applied to the IEEE 33-bus and 69-bus test systems. The comparative study confirms the superior performance of the proposed algorithm in terms of convergence speed, execution time, and the final solution. [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]

This paper presents a pioneering exploration into the optimization of Home Energy Management Systems (HEMS) through the novel application of the Bacterial Foraging Metaheuristic Optimization (BFMO) algorithm and Deep Reinforcement Learning (DRL). The study systematically addresses the pressing challenge of enhancing residential energy efficiency, focusing on dynamic appliance scheduling within HEMS. A robust methodology is established, encompassing data collection from smart homes, implementation details of the BFMO algorithm, DRL techniques, and a comprehensive evaluation framework. The unique contribution of this research lies in the effective integration of the BFMO algorithm and DRL to orchestrate energy‐conscious scheduling of home appliances within HEMS. The BFMO algorithm demonstrates its adaptability to fluctuating energy costs and consumption patterns by simulating the foraging behaviour of bacteria. At the same time, DRL enhances the system's ability to learn and optimize scheduling decisions over time, showcasing their combined efficacy in real‐world scenarios. The algorithms' iterative application of chemotaxis, reproduction, elimination‐dispersal, swarming, and learning consistently yields optimized appliance schedules. The main focus of this study resides in the evaluation metrics illustrating the tangible benefits of BFMO and DRL compared to traditional HEMS. Significant reductions in total energy consumption and cost, accompanied by improved peak demand management, exemplify the algorithms' impact. Furthermore, the study delves into enhancing user comfort, integrating renewable energy sources, and the overall robustness of HEMS, all demonstrating the multifaceted advantages of the BFMO and DRL approaches. This research contributes methodologically by introducing and detailing these algorithms and provides a valuable dataset and evaluation metrics for future research in the domain. The findings underscore the immediate and long‐term relevance of optimizing HEMS with BFMO and DRL, catering to researchers, practitioners, and policymakers involved in advancing smart grid technologies and sustainable residential energy management. In summary, this work establishes the BFMO algorithm and DRL as pioneering and versatile tools for energy‐conscious appliance scheduling in HEMS, offering a substantial leap forward in the quest for efficient and sustainable residential energy management. [ABSTRACT FROM AUTHOR]

Summary In recent years, the use of wireless sensor devices in several applications, for example, monitoring in dangerous geographical spaces and the Internet of Things, has dramatically increased. Though sensor nodes (SNs) have limited power, battery replacement is not feasible in most cases. Therefore, energy saving in wireless sensor networks (WSN) is the major concern in the design of effective transmission protocol. Clustering might lower energy usage and increase network lifetime. Routing protocol for WSN represents an engineering area that has gained considerable interest among researchers due to its rapid evolution and development. Among them, the clustering routing protocol corresponds to the most effective technique to manage the energy consumption of each SN. In this manuscript, we focus on the design of a new metaheuristic optimization‐based energy‐aware clustering with routing protocol for lifetime maximization (MOEACR‐LM) method in WSN. The purpose of the MOEACR‐LM method is to improve network efficiency via proper selection of cluster heads (CHs) and effective data transmission. Initially, a hunter–prey optimization (HPO) method‐based clustering technique is used for cluster construction and the CH selection process. Next, the clouded leopard optimization (CLO) model is used for the route selection process in WSN. The HPO and CLO models derive a fitness function involving multiple parameters for clustering and routing processes. A comprehensive experimental analysis is carried out to demonstrate the enhanced performance of the MOEACR‐LM technique. The overall comparison study pointed out the improved energy efficiency results of the MOEACR‐LM technique over other existing approaches. [ABSTRACT FROM AUTHOR]

This article explores the optimization of global navigation satellite system (GNSS) acquisition using metaheuristic techniques. It focuses on improving the detection performance of the GNSS acquisition system by optimizing the cell averaging constant false alarm rate (CA-CFAR) thresholding in Rayleigh fading channels. The study suggests the use of metaheuristic optimization algorithms such as particle swarm optimization (PSO), biogeography-based optimization (BBO), firefly algorithm (FA), and simulated annealing (SA). The results demonstrate that the optimized thresholds have a significant impact on the system's performance. The article also discusses the use of the constant false alarm rate (CFAR) technique, which utilizes two CA-CFAR detectors to estimate the noise power level and adaptively set a threshold for detection. The detection performance can be further improved by combining the outputs of the two detectors using fusion rules. The article presents and compares the results of simulations and theoretical analysis for different optimization algorithms, showing that the CA-CFAR detector with optimization outperforms the fixed threshold detector and the CA-CFAR detector without optimization. The best results are achieved when two different detectors are used with the CA-CFAR detector and the fusion rule is applied. The study suggests further research in non-homogeneous environments and the exploration of other types of detectors with new optimization methods. [Extracted from the article]