Search

Lot streaming technology enables continuous overlapping operations, which is of great significance in shortening production cycles, reducing unnecessary waiting time, and increasing production capacity. However, the capacity constraint of batch processing machines may lead to inevitable variations in sublots. Therefore, the key focus of our research is to control variations of sublot for maximising benefits. In view of this, we investigate a hybrid flowshop scheduling problem (HFSP) with batch processing machines and variable sublots (HFSP-BVS) integrating sequence-dependent setup times and transportation times. To address HFSP-BVS, a MILP model is first established, and a novel collaborative iterative greedy (NCIG) algorithm is proposed to optimise the cumulative payoffs associated with delivery dates. In NCIG, a collaborative initialisation method by extracting good information from an archive is proposed, and a specific destruction-reconfiguration strategy is designed to control the variations of sublots in the batch processing stage. Furthermore, a dynamic acceptance criterion is designed to balance the algorithm's exploitation and exploration capabilities. Lastly, we conduct comparisons between the NCIG algorithm and five other metaheuristic algorithms on 100 test instances. The results show that NCIG outperforms them by 1.89% and 61.42% on average in terms of the total penalty and RPI values, respectively. [ABSTRACT FROM AUTHOR]

Metasurface has the ability to flexibly modulate the wavefront and detect the polarization states, thus receiving widespread research attention. The combination of polarization multiplexing techniques and focused beams with polarization information provides a new approach to compact polarization detection behavior. Here, an all-dielectric metasurface based on polarization multiplexing encoding technique is demonstrated and assigns the independent phase distributions to x- and y-polarized channels to separate different polarized components. Combining Stokes parameters and visualized polarization ellipses, realizing one-to-one mapping of the incident polarization states with far-field images. We obtain the Poincaré sphere and visualized polarization ellipses based on Stokes parameters to verify the polarization detection ability of the designed metasurface. The proposed scheme is expected to provide potential applications in fields such as full-Stokes polarization detection, high-resolution imaging, and terahertz communication. [ABSTRACT FROM AUTHOR]

In most seaports, pilotage is compulsory for incoming and outgoing vessels to use pilotage services. Maritime pilots play a critical role in providing local knowledge and assistance to ensure the safety of vessels and seafarers. Typically, pilots are classified into multiple classes on the basis of their experiences and qualifications. Moreover, pilotage duration is usually stochastic due to various factors, including harsh weather conditions, visibility, and traffic changes. In this study, we address a multi-class pilot dispatching problem with stochastic pilotage duration. We formulate this problem as a stochastic programming model that considers the expected penalty cost for late arrival at each task's location. To solve this problem, we develop a branch-and-price algorithm that integrates column generation within the branch and bound framework. Additionally, we develop a novel labelling algorithm and several effective acceleration techniques to enhance the efficiency of the proposed algorithm. Extensive numerical experiments demonstrate the effectiveness of the proposed algorithm and show that it can handle realistic-sized instances while outperforming a metaheuristic search method. [ABSTRACT FROM AUTHOR]

Original lidar return signals are covered by high levels of noise that seriously affect the accuracy of subsequent data processing and inversion. Therefore, it is important to separate the effective signal from the returned signal with noise interference. In this paper, an efficient denoising method based on the variational mode decomposition (VMD) algorithm optimized using the global search strategy-based whale algorithm and the total variational stationary wavelet transform (GSWOA-VMD-SWTTV) is proposed, and this method is applied to denoising of lidar return signals. First, the global search strategy-based whale optimization algorithm (GSWOA) is used to acquire the optimal parameters of the VMD algorithm adaptively, and the lidar return signal is then decomposed by global search strategy-based whale optimization algorithm (GSWOA)-VMD. The effective modal components are then determined using the cross-correlation coefficient method from the decomposed modal components, and total variation stationary wavelet denoising is performed on each effective mode. Finally, the effective modes are reconstructed to obtain a clean lidar return signal. Moreover, to provide further verification of the effectiveness of the proposed method, it is compared with the ensemble empirical mode decomposition (EEMD) method, the complete EEMD with adaptive noise (CEEMDAN) method, the singular value decomposition (SVD) method, and the wavelet threshold method under sunny, cloudy, and dusty weather conditions. The experimental results demonstrate the superior noise reduction performance of the proposed algorithm, which can filter out strong noise from the signal while retaining the complete signal details without distortion; additionally, the proposed method has the highest signal-to-noise ratio and lowest mean square error. [ABSTRACT FROM AUTHOR]

Changes to components, known as engineering changes (ECs), rarely occur on their own. In fact, in complex assembly systems, most ECs are introduced in batches to ensure that changed components match. As a result, to implement ECs optimally, multiple component's stock must be considered until the change is executed on the EC effectivity date. This problem is known as the EC effectivity date optimisation problem, a variation of the general inventory control problem with deterministic and dynamic demand. As optimisation and monitoring of this problem is computationally expensive, research has suggested to investigate whether metaheuristics can provide adequate support. To fill this research gap, we present the results of a benchmark on basic metaheuristics for EC effectivity date optimisation. To do so, we have compared five common metaheuristics in their basic form (Ant Colony Optimisation, Genetic Algorithm, Particle Swarm Optimisation, Tabu Search, and Simulated Annealing) on a real-world test set. Of the tested algorithms the Genetic Algorithm identified most best solutions and returned good average results for the test cases. However, as its reliability was comparatively low, our research suggests a sequential application of the Genetic Algorithm and Tabu Search. [ABSTRACT FROM AUTHOR]

Human–robot collaborative technology maximises the advantages of the capabilities of humans and robots, and provides diverse operating scenarios for the remanufacturing industry. Accordingly, this paper proposes an innovative human–robot collaborative disassembly line balancing problem (HRC-DLBP). First, a mixed-integer programming (MIP) model is devised for the HRC-DLBP to minimise the number of workstations, smoothness index, and various costs. Second, a hybrid local search genetic algorithm (HLSGA) is developed to solve the proposed HRC-DLBP efficiently. According to the problem characteristics, a four-layer encoding and decoding strategy was constructed. The search mechanism of the local search operator was improved, and its search strategy was adjusted to suit the genetic algorithm structure better. Furthermore, the accuracy of the proposed MIP model and HLSGA is verified through two HRC-DLBP examples. Subsequently, three HRC-DLBP examples are used to prove that the HLSGA is superior to five other excellent algorithms. The case of the two-sided disassembly line problem reported in the literature is also solved using the HLSGA. The results are found to be significantly better than the reported outputs of the improved whale optimisation algorithm. Besides, HLSGA also outperforms the results reported in the literature in solving EOL state-oriented DLBP. Finally, the HLSGA is applied to a power battery disassembly problem, and several optimal allocation schemes are obtained. [ABSTRACT FROM AUTHOR]

This paper studies the customer order scheduling problem in the context of additive manufacturing. The study discusses an integrated problem involving the nesting of parts as well as the scheduling of batches of nested parts onto unrelated parallel machines. A mixed-integer programming model is presented, based on existing formulations from the literature, that integrates different materials and sequence-dependent setup times. Additionally, a metaheuristic based on an iterated local search is proposed for the problem configuration under consideration. Focusing on minimizing the total weighted tardiness of orders, the efficiency of the heuristic approach is evaluated using comprehensive test data. Further, we show the importance of the considered order-related objective by using qualitative analysis. [ABSTRACT FROM AUTHOR]

We study a problem from a real-world application, in which a daily set of orders must be processed following two stages, consisting of preparing perishable products on benches and allocating them to conveyors to be packed in disposable trays. Daily decisions must be made regarding the number and start time of working shifts, the number of workers and their allocation to machines, and the scheduling of orders in a two-stage flexible flow shop environment. The flow shop environment of the studied problem is common in many industries of perishable products, making the problem very general. The problem involves a number of operational constraints, and three objective functions that are minimised in a lexicographic way. To solve the problem, we implement a constructive heuristic and embed it within three metaheuristics: a Random multi-start algorithm (MR), a Biased random key genetic algorithm (BRKGA), and a Variable neighbourhood search (VNS) based one. We perform computational experiments over a set of realistic instances, and present a lower bound obtained from a constraint programming model for the scheduling counterpart. The results of the experiments show that the BRKGA is the most effective in practice for the integrated problem of workforce allocation and scheduling. [ABSTRACT FROM AUTHOR]

In this article, maintenance operations were incorporated to the sequence-dependent setup blocking flow shop to minimise total completion time subject to total maintenance costs. A mixed integer linear programming and procedures to incorporate maintenance to job sequence were developed. A constructive heuristic and three metaheuristics, greedy randomised adaptative search procedure (GRASP), discrete artificial bee colony (DABC), variable block insertion heuristic (VBIH) and iterated greedy algorithm (IG), designed to the blocking flow shop with total completion time minimisation were adapted to minimise total maintenance costs and the hierarchical function, respectively.All the methods were applied to solve small and medium and large size instance sets, with respective 1920 and 2200 problems. Experimental results shows that for small size instances set, DABC with α = 20 (DABC(20)) obtained the best trade-off between effectiveness and efficiency. For medium and large size instances set, DABC(20) VBIH with α = 20 (VBIH(20)) generated the best trade-off between quality of solution and computational time. Considering both instances set together, both DABC(20) and VBIH(20) obtained the best performance between quality of solution and computational time. [ABSTRACT FROM AUTHOR]

This study investigated a multi-objective resequencing scheduling problem in the automotive manufacturing systems due to operational requirements on the color-batching of the paint shop and sequential requirements on the sequence adherence of an assembly shop. Resequencing cars as color-oriented batches reduced the costs of color changes and operational costs for paint shops. Also, assembly shops required paint shops to complete cars with fewer delays so that high sequence adherence with its demand was assured. Based on real-world applications, we investigated two contradictory objectives-color change costs and sequence tardiness-in a single-machine flowshop scheduling environment. A multi-objective-deep-Q-network algorithm was developed to determine the Pareto frontier. Reward shaping was designed to improve the convergence of the neural network. The 2D-folded-normal distribution was designed to sample the preference, which made the exploration and exploitation of the neural network more comprehensive and improved the training efficiency. Two experiments were conducted and showed that the proposed approach outperformed the meta-heuristic algorithm and the envelope Q-learning algorithm in solving time, performance, the convergence of the neural network, and the diversity of the Pareto frontier. Therefore, the proposed approach can be used in automotive paint shops to improve scheduling efficiency and reduce operational costs. [ABSTRACT FROM AUTHOR]

Numerous applications of wireless sensor networks (WSNs) highly depend on the node location, such as maritime rescue, agriculture, and hazardous environments. GPS-enabled sensors are not cost-effective or energy efficient. Henceforth, the precise location of sensor nodes significantly impacts the performance of WSNs. Finding the position of a target node (an unknown node) is known as node localization. Gaussian noise and RSSI are cost-effective approaches for estimating the location of a target node. In this paper, the Seagull optimization algorithm and its enhanced versions are applied to increase the NL accuracy of localized nodes. To enhance the accuracy and improve the randomness of the seagull optimization algorithm (SOA)., levy flight and a chaotic map are employed in this work to enhance the seagull optimization algorithm Furthermore, the chaotic map-based SOA (C-SOA) and the Levy flight-based SOA (LF-SOA) are used for node location in WSNs. The performance evaluation and result comparison of SOA, C-SOA, and LF-SOA show that LF-SOA is better than C-SOA and SOA. [ABSTRACT FROM AUTHOR]

The early detection of cancer is of paramount importance in the medical field, as it can lead to more precise and effective interventions for successful cancer treatments. Cancer datasets typically contain numerous gene expression levels as features but with a limited number of samples. Thus, feature selection is a crucial initial step to streamline prediction algorithms. These selected features, or genes, play a pivotal role in cancer identification, treatment selection, and variation analysis among different techniques. To address this challenge, present two novel methodologies, by combining Cuckoo Search (CS) and Spider Monkey Optimization (SMO), referred to as SMOCS (Cuckoo Search followed by Spider Monkey Optimization) and CSSMO (Spider Monkey Optimization followed by Cuckoo Search). These approaches are designed for harnessing the strengths of both metaheuristic algorithms to identify a subset of genes that aid in early-stage cancer prediction. Additionally, to enhance the accuracy of the both algorithms, we employ a gene expression reduction method known as minimum Redundancy Maximum Relevance (mRMR) to reduce redundancy in cancer datasets. Subsequently, these gene subsets are classified using Deep Learning (DL) to identify distinct groups or classes associated with specific cancer types. We evaluate the performance of our proposed approaches using six different cancer datasets, assessing cancer sample classification and prediction through metrics such as Recall, Precision, F1-Score, and confusion matrix analysis. Our gene selection methods, in conjunction with DL, achieves significantly improved prediction accuracy when applied to large gene expression datasets compared to existing Deep Learning (DL) and Machine learning models. Experimental results shows that both SMOCS and CSSMO tend to classify cancer with high prediction accuracy, but SMOCS algorithm gives higher prediction accuracy for all the six datasets used with a maximum accuracy of 100%. [ABSTRACT FROM AUTHOR]

Image dehazing is said to be an emerging research area in the platform of computer vision and image processing. Due to the cruel fog, air dispersion, and haze around the environment, the hazes images are resulted in different challenges in retrieving the actual information of the original image. On the other hand, the conventional approaches are ensured with the huge computational complexity and also with the distortion of actual images like over-saturation and halos. The recent methods are used for restoring the haze-free images however they are worked with the physical models and along with the learning methods. It is a very challenging task to maintain the detailed details of the image at the time of reducing the fog in the single-image dehazing. With an advanced development deep structured strategy, mostly Convolutional Neural Network (CNN)-aided dehazing approaches are developed for processing the single image dehazing. However, haze residual and slow training of the convergence rate are considered as the two main drawbacks in these conventional dehazing networks. To deal with these problems, the latest approach is proposed for the restoration of haze-free images. The hazy images are gathered from the standard datasets. At first, Adaptive Discrete Wavelet Transform (ADWT) is utilized for decomposing the images, where the ADWT is implemented by Hybrid African Vultures Fire Fly Optimization (HAVFFO). Further, image dehazing is designed by Optimized Residual-Based Deep CNN (OR-Deep CNN), where the hyperparameters of the Residual-Based Deep CNN are optimized by the same HAVFFO. Finally, the restoration of haze-free images is carried out through adaptive inverse DWT. Through the performance analysis, our recommended model is better in quantitative visual and performances on online resources. [ABSTRACT FROM AUTHOR]

This study introduces the CP-EODE algorithm, a novel hybrid of the Equilibrium Optimizer (EO), and the Differential Evolution (DE) algorithm. It addresses EO's tendency toward premature convergence by enhancing its exploration capabilities. The motivation for this research stems from the need for more efficient and economically viable designs in engineering, particularly in the optimization of shell-and-tube heat exchangers (STHEs) and photovoltaic module parameters. The CP-EODE algorithm leverages DE's exploration strengths to enhance EO's performance adopting a cooperative parallel approach that divides the population into EO and DE sub-populations for a more effective search space exploration. The validation of CP-EODE's effectiveness commenced with its application to 29 benchmark functions, where a Friedman test yielded an F r value of 22.19, significantly surpassing the critical value of 7.81, and a Wilcoxon signed rank test confirmed statistical improvements with a z-score beyond − 1.96. Four quality metrics were discussed to provide a detailed assessment of CP-EODE's performance highlighting its robust exploration and exploitation capabilities. In practical applications, CP-EODE demonstrated significant advancements in STHE design achieving up to 19.706% reduction in heat exchanger surface area compared to traditional and other algorithmic designs, showcasing its potential to enhance engineering design efficiency and cost-effectiveness. A critical examination of the algorithm's convergence rate revealed its swift optimization capability, with rapid attainment of optimal solutions in various test cases, further establishing CP-EODE's advantage in handling complex optimization challenges. Through rigorous statistical analysis and performance metrics, CP-EODE emerges as a superior solution for complex optimization challenges, underscoring the value of hybrid algorithmic strategies in engineering optimizations. [ABSTRACT FROM AUTHOR]

Summary The base station receives the environmental data from a predetermined field that is collected and transferred by the sensors for processing and analysis. However, coverage maximization is the major issue that requires the deployment of varied sensor nodes (SNs), in such a way that optimizes network coverage while enduring practical limitations. This is pointed out to be a significant challenge in constructing WSNs. Since this is considered to be a well‐known NP‐hard issue, metaheuristic methods must be used for solving the realistic problem sizes. Hence, our work considers the problem of finding the best placement to ensure good network coverage in WSN. Accordingly, the solution to the above‐mentioned problem is modeled by covering a new 2‐D distance evaluation based on weighted Minkowski. Further, we deploy the Self Improved Sealion with Opposition Behavior (SI‐SLOB) algorithm for determining the optimal placement of given sensor nodes. In the end, we perform varied evaluations on distance and coverage area to ensure the enhancement of the SI‐SLOB scheme over the other state‐of‐the‐art algorithms. The proposed method achieves minimum distance mean value in target node 25, which is 4.1%, 4.0%, 2.3%, 5.1%, 3.5%, 3.0%, and 4.1% better than the other methods such as SLO, GWO, PSO, BMO, BOA, RHSO, and WOA, respectively. Thus the proposed WSN node coverage models have diverse applications across various domains, contributing to improved efficiency, safety, and resource management. [ABSTRACT FROM AUTHOR]

In order to improve the accuracy and efficiency of hydrogen energy storage system (HESS) risk assessment, the study proposes a risk portfolio assessment model based on kernel principal component analysis-tuna swarm optimization-least squares support vector machine (KPCA-TSO-LSSVM) algorithm. Firstly, the original data were downscaled using KPCA to extract principal components with at least 98% information content. These principal components use the extracted principal components as inputs to the model. Secondly, TSO is used to implement the optimization of parameter settings for LSSVM. Thirdly, the applicability of the proposed KPCA-TSO-LSSVM in HESS risk assessment is verified by case analysis. Finally, the superiority of the model proposed is verified by comparing TSO, whale optimization algorithm (WOA) and particle swarm optimization (PSO). The results show that KPCA-TSO-LSSVM performs optimally in HESS risk assessment. The classification time of the test sample is shorter at 0.0416 s. The accuracy is higher at 97%. Therefore, the proposed model can effectively identify HESS risks, reduce the operational risks of HESS, and improve the stability and reliability of the system. • Kernel principal component analysis extracts principal components of 98% or more. • Tuna swarm algorithm optimises parameters of least squares support vector machine. • Case study validates the applicability of KPCA-TSO-LSSVM in risk assessment. • Multi-method comparisons confirm that KPCA-TSO-LSSVM is the best with 97% accuracy. [ABSTRACT FROM AUTHOR]

To improve energy utilization efficiency for fuel cell vehicles (FCVs), it is crucial to pay particular attention to the coordination relationships between speed planning and energy management on the road with multiple signal lights. However, the coordination relationships are complex optimization problems with large computational loads, which make it challenging to consider speed planning and energy management simultaneously. Then, a co-optimization method based on Pontryagin's minimum principle (PMP) with the cooperative optimization algorithm is proposed for speed planning and energy management in the FCVs. An optimization control model for the speed planning problem online is established using the signal light timing model and solved using the PMP method to reduce the number of accelerations and decelerations, get closer to the desired speed, and decrease the demand power. Meanwhile, the optimization objective function for energy management is built to achieve the minimum hydrogen consumption, and the PMP method is re-applied to achieve a reasonable distribution of the output power of the fuel cell and lithium battery. Additionally, a cooperative optimization algorithm by conjunct use of the Whale optimization algorithm (WOA) and the Grey wolf optimization (GWO) is put forward to optimize the parameters in the PMP method. The simulation results indicate that the proposed method avoids waiting at red lights during the vehicle speed planning phase, minimizes speed fluctuations, and improves driving comfort. Moreover, compared to the Quadratic Programming (QP), when this method is utilized for power distribution between two sources, the FCHEV consumes 7.51% less hydrogen in route one and 1.35% less hydrogen in route 2. Besides, the method yields a more stable output power from the fuel cell. In summary, the method proposed in this paper fulfills the real-time optimization requirements for speed and energy. [Display omitted] • A co-optimization approach for speed planning and energy management is presented. • Speed planning and energy management are investigated using optimized PMP. • A cooperative WOA-GWO is proposed to optimize the parameters in the PMP. • Lower hydrogen consumption and faster calculation speed are achieved. [ABSTRACT FROM AUTHOR]

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

The article examines strategies for managing voltage issues in distribution networks integrated with distributed energy resources, particularly photovoltaic (PV) systems. Topics include the challenges of voltage regulation in active distribution networks (ADNs) due to high proportions of distributed energy resources, the role of distributed energy storage and flexible loads in emergency voltage control, and the proposed composite sensitivity analysis for prioritizing voltage control measures.

Parkinson's Disease (PD) is a degenerative and progressive neurological disorder worsens over time. This disease initially affects people over 55 years old. Patients with PD often exhibit a variety of non-motor and motor symptoms and are diagnosed based on those motor and non-motor symptoms as well as numerous clinical indicators. Advancement in medical science has produced medicines for many diseases but till now no significant remedies are discovered for Parkinson disease. It is very necessary to detect PD at early phase to take precautions accordingly to reduce its harmful impact and improve the patient's life style to a considerable level. In this direction Artificial Intelligence (AI) based approaches have recently attracted many researchers to work accordingly as AI can handle vast amounts of data and generate accurate statistical predictions. Addressing this imperative, researchers have turned their focus toward Artificial Intelligence (AI) as a promising avenue. AI's capacity to manage vast datasets and generate precise statistical predictions makes it an invaluable tool for PD detection. This article aims to provide a comprehensive survey and in-depth analysis of various AI-based approaches. Leveraging machine learning (ML), deep learning (DL), and meta-heuristic algorithms, these approaches contribute to the prediction of PD. Additionally, the article delves into current research directions. As the pursuit of advancements continues, the integration of AI holds promise in revolutionizing early detection methods and subsequently improving the lives of individuals grappling with Parkinson's disease. [ABSTRACT FROM AUTHOR]

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

Highlights This study emphasizes the significance of stacking sequence and hybridization of glass, carbon, kevlar and basalt fibers to enhance the mechanical characteristics and the overall wear response of polymer composites. The carbon layer on the outside of the composite exhibited higher ultimate tensile and flexural strengths. The abrasive wear of fabricated hybrid composites is also explored by performing experiments using Box–Behnken design approach. The pin‐on‐disc tester is utilized to do the wear test by varying composite type, sliding distance, and sliding velocity, with specific wear rate (SWR) serving as the response parameter. Regression analysis is performed to predict SWR using control and response parameters derived from experimentation. A novel firefly algorithm technique is adopted to determine the optimal process parameter combination. By utilizing optimized parameters (430 m, 10.5 m/s, and the CKBG4BKC stacking sequence), the SWR is considerably reduced to 16.82 × 10−5 mm3/Nm. Scanning electron microscopy on the worn‐out wear surface reveals enhanced interfacial bonding, fiber breakage and plowing as the fundamental wear mechanism. This work provides insight into hybrid composites for constructing aircraft and automobile body structures, where they provide an optimal blend of strength, sustainability, and structural performance. Hybrid composite: Stacking sequence impacts on mechanical and abrasive wear. Box–Behnken design: Applied on stacking order, sliding distance and velocity. Utilizing metaheuristic firefly algorithm to enhance specific wear results. Optimal parameters: 430 m, 10.5 m/s, and CKBG4BKC stacking sequence. Lightweight, high‐strength, cost‐effective, and sustainable hybrid composites. [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]

A high‐speed railway system is one of the sustainable alternatives to other modes of transportation and may connect the most congested urban cities with minimum carbon emissions. However, the vibration intensity increases as the train's operating speed increases, resulting in deteriorated ride comfort and stability. Hence, this article investigates a 27‐degree‐of‐freedom (DOF) dynamic model of railway vehicles with an improved active suspension system. The decentralized control structure performs the controlling action with five optimized Proportional Integral Derivative (PID) controllers that suppress the vehicle body's vertical, lateral, pitch, roll, and yaw motions. Further, to optimize the PID parameters, three metaheuristic optimization techniques, Genetic algorithm (GA), Grey Wolf Optimization (GWO), and Flower Pollination Algorithm (FPA), are utilized, and their simulated results are compared with the passive system as well as other conventional tuning technique. Moreover, the performance of the proposed control strategy is evaluated in the frequency domain under random track irregularities, and the results are characterized in terms of power spectral densities (PSDs). The simulated results show that among the proposed metaheuristic algorithms, FPA outperforms with a significant reduction in vehicle vibration compared to other tuning methods. The percentage reduction of the vertical, lateral, pitch, rolls, and yaw accelerations is 71.4%, 35.1%, 52.8%, 48.1%, and 38.2%, respectively, ensuring enhanced vehicle ride comfort. [ABSTRACT FROM AUTHOR]

This paper proposes an improved dual-phased framework for energy-efficient, cluster-based routing in Wireless Sensor Networks (WSNs). It addresses the critical challenge of balancing energy consumption with reliable network performance. Cluster-based routing is a crucial parameter for WSN operational efficiency, especially in applications demanding minimal energy use and dependable data transmission. The proposed framework integrates two advanced meta-heuristic algorithms: Sailfish Optimization (SFO) and Spotted Hyena Optimization (SHO). This combined approach leverages SFO's rapid exploration for efficient clustering and optimal Cluster Head (CH) selection. Additionally, SHO's refined exploitation capabilities optimize efficient routing paths. This innovative methodology significantly improves network performance metrics like energy efficiency, network lifetime, and Packet Delivery Ratio (PDR). The originality of this work lies in the dual-phased optimization strategy. It distinctively outperforms traditional single-algorithm based approaches by employing a unique hybrid optimization approach, offering greater originality and value. Experimental simulations demonstrate that the proposed framework outperforms several popular algorithms in terms of key performance metrics. This makes it a valuable contribution to the field and an efficient solution for diverse applications. [ABSTRACT FROM AUTHOR]

Solar energy has emerged as a key solution in the global transition to renewable energy sources, driven by environmental concerns and climate change. This is largely due to its cleanliness, availability, and cost-effectiveness. The precise assessment of hidden factors within photovoltaic (PV) models is critical for effectively exploiting the potential of these systems. This study employs a novel approach to parameter estimation, utilizing the electric eel foraging optimizer (EEFO), recently documented in the literature, to address such engineering issues. The EEFO emerges as a competitive metaheuristic methodology that plays a crucial role in enabling precise parameter extraction. In order to maintain scientific integrity and fairness, the study utilizes the RTC France solar cell as a benchmark case. We incorporate the EEFO approach, together with Newton-Raphson method, into the parameter tuning process for three PV models: single-diode, double-diode, and three-diode models, using a common experimental framework. We selected the RTC France solar cell for the single-diode, double-diode, and three-diode models because of its significant role in the field. It serves as a reliable evaluation platform for the EEFO approach. We conduct a thorough evaluation using statistical, convergence, and elapsed time studies, demonstrating that EEFO consistently achieves low RMSE values. This indicates that EEFO is capable of accurately estimating the current-voltage characteristics. The system's smooth convergence behavior further reinforces its efficacy. Comparing the EEFO with competing methodologies reinforces its competitive advantage in optimizing solar PV model parameters, showcasing its potential to greatly enhance the usage of solar energy. [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]

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 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]

In this article, a production–assembly scheduling problem is presented in three steps. In the first step, the production operation is performed by dedicated parallel machines; in the second step, the assembly operation is performed by the same parallel machines, and in the third step, the post-assembly operation is performed by one machine, and these three steps exist in parallel factories. This problem is NP hard and cannot be solved in a reasonable time by mathematical models. Therefore, a mixed integer linear programming algorithm is presented for small-sized problems, and a new metaheuristic algorithm is presented for large-sized problems, by combining quantum-behaved particle swarm optimization (QPSO), shortest processing time (SPT) and dominance rules, which is called the hybrid QPSOSPT dominance rules (HQSD) algorithm. Accurate parameter adjustment was achieved by analysis of variance. The HQSD algorithm was shown to obtain better results than the other algorithms. [ABSTRACT FROM AUTHOR]

The minimum multiplex arrangement problem locates each vertex of a graph on an integer point on a line, with each integer point being assigned at most $ \mathfrak {m} $ m vertices. The case with $ \mathfrak {m}=2 $ m = 2 , known as the minimum duplex arrangement (MinDA) problem, is investigated in this study. MinDA is $ \mathscr {N}\!\!\mathscr {P} $ N P -hard and is related to applications such as manufacturing systems design and VLSI layout. A mixed-integer linear programming formulation of MinDA is presented. The capabilities of the proposed formulation are assessed on 63 problem instances with varying densities and sizes up to 25 vertices. Additionally, an examination of the structure of an optimal MinDA solution is conducted. Based on this analysis, an iterated local search (ILS) algorithm is established, and novel strategies are developed to enhance its effectiveness. In contrast to traditional ILS approaches, where the local search phase invariably reaches a local optimum, the local search phase in the proposed algorithm may converge to a point in the vicinity of a local optimum, thereby reducing the computational burden for large-scale instances. Extensive computational experiments employing the ILS algorithm are conducted on instances with sizes n up to 10,240 vertices. [ABSTRACT FROM AUTHOR]

This paper presents a recent bio-inspired optimization algorithm for the critical topic of load frequency control (LFC) in an isolated multi-source power generating system. A specific model that emerges from the scientific literature and consists of reheated thermal, hydro and gas-turbine power sources is examined. The main goal is to tune the controller of each generating source i.e. find their optimal gains through bio-inspired optimization algorithms. Namely, the algorithms applied are the Whale Optimization Algorithm (WOA), Grey Wolf Optimizer (GWO), Particle Swarm Optimization (PSO), and the newly proposed Harris Hawks Optimization (HHO). It was observed that all optimization algorithms succeeded in obtaining controllers' gain values which ensure stable system operation. Also, the simulation results indicated the superiority of the proposed HHO algorithm over the other algorithms for all the considered scenarios. In this article, for the first time to the authors' knowledge extend an attempt has been made to optimize an isolated multi-source system using the bio-inspired HHO algorithm. The present study considered the LFC problem with a variety of different scenarios, taking into account both sub-cases of nonlinearities (e.g., generation rate constraint, boiler dynamics, etc.) and their combinations, as well as combinations of different controllers and load disturbances, which are not found in the literature. Last but not least, the robustness of the selected controller was further evaluated. The obtained results clearly demonstrated that the controller's gains established in normal conditions do not require retuning when critical system parameters undergo a significant variation. [ABSTRACT FROM AUTHOR]

Considering the detrimental impact of thermal phenomena on the geometric precision of machine tools, a machine tool ball screw's omni-directional error model is created using the LSTM neural network algorithm. Subsequently, the machine tool ball screw's omni-directional error compensation module is devised by combining the core functions of the Huazhong numerical control system with the visual programming environment of QT and the numerical computation capability of Matlab. To enhance the practicality and accuracy of the compensation model, this study has employed the Whale Optimization Algorithm (WOA) to optimize the parameters of the LSTM model. This has resulted in an improvement in the model's generalization ability and prediction performance, making it more effective. During the experimental validation phase, the Z-axis error of the machine tool was practically operated and analyzed using the compensation method. Results manifestly show that, after employing the compensation method, the peak amplitude of the Z-axis error fluctuations have been notably curtailed to ±0.006 mm -- a considerable reduction compared to the initial error bandwidth of ±0.0145 mm. These empirical findings substantiate the efficacy of the proposed compensation strategy in substantially boosting the machining precision of products, thus furnishing a substantial and instructive benchmark for future inquiries into CNC machine tool error compensation technologies. [ABSTRACT FROM AUTHOR]

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

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

Anomaly detection (AD) in the industrial internet of things (IIoT) platform is said to be the major module of security the consistency, safety, and efficacy of industrial procedures. In IIoT, several sensors and devices always gather massive data counts from tools, infrastructure, and equipment. Ensuring the safety of IIoT AD systems is vital for protecting against cyber-attacks. AD and Intrusion detection are required to work in tandem to maintain industrial procedures. Machine learning (ML) and deep learning (DL) approaches generally employed for AD in IIoT. These methods allow automated AD and pattern detection. With this motivation, this study develops an enhanced pelican optimization model with an ensemble voting-based anomaly detection (EPOA-EVAD) approach. Primarily, the SMOTE approach is used for class imbalance data handling. The presented EPOA-EVAD technique integrates the EPOA-based feature selection and ensemble voting classifier to enhance the accuracy and efficiency of AD in IIoT environments. In addition, the group teaching optimization algorithm with SMOTE approach is used for the purpose of class imbalance data handling. EPOA optimally chooses the related features from the complex and high-dimensional IIoT data. For AD, the EPOA-EVAD technique involves an ensemble learning process comprising gated recurrent unit (GRU), bi-directional long short-term memory (BiLSTM), and stacked autoencoder (SAE). Lastly, the seagull optimization (SGO) algorithm fine-tunes the parameters compared with the DL approaches. The simulation values exhibited that the proposed system outperforms standard approaches, offering robust and adaptive AD capabilities in dynamic IIoT settings. The proposed EPOA-EVAD technique contributes to the advancement of AD techniques crucial for maintaining the integrity and efficiency of industrial processes in the era of IIoT. [ABSTRACT FROM AUTHOR]

Over the past few years, global use of Online Social Networks (OSNs) has increased. The rising use of OSN makes protecting users' privacy from OSN attacks difficult. Finally, it affects the basic commitment to protect OSN users from such invasions. The lack of a distributed, dynamic, and artificial intelligence (AI)-based privacy-preserving strategy for performance trade-offs is a research challenge. We propose the Distributed Privacy Preservation (DPP) for OSN using Artificial Intelligence (DPP-OSN-AI) to reduce Information Loss (IL) and improve privacy preservation from different OSN threats. DPP-OSN-AI uses AI to design privacy notions in distributed OSNs. DPP-OSN-AI consists of AI-based clustering, l-diversity, and t-closeness phases to achieve the DPP for OSN. The AI-based clustering is proposed for dynamic and optimal clustering of OSN users to ensure personalized k-anonymization to protect from AI-based threats. First, the optimal number of clusters is discovered dynamically with simple computations, and then the Whale Optimization Algorithm is designed to optimally place the OSN users across the clusters such that it helps to protect them from AI-based threats. Because k-anonymized OSN clusters are insufficient to handle all privacy concerns in a distributed OSN environment, we systematically applied the l-diversity privacy idea followed by the t-closeness to it, resulting in higher DPP and lower IL. The DPP-OSN-AI model is assessed for IL Efficiency (ILE), Degree of Anonymization (DoA,) and computational complexity using publically accessible OSN datasets. Compared to state-of-the-art, DPP-OSN-AI model DoA is 15.57% higher, ILE is 17.85% higher, and computational complexity is 3.61% lower. [ABSTRACT FROM AUTHOR]

The continual increase in the amount of generated data by social media, IoT devices, and monitoring systems have motivated the use of Distributed Data Stream Processing (DSP) systems to harness data in a real-time manner. The scheduling of processing tasks in DSP systems across the machines in a cluster or cloud environment is an NP-Hard problem. Different scheduling schemes have been proposed to address the scheduling problem, but most fail to take into account the runtime adaptation and workload changes after initial scheduling. In this paper, we propose a new scheduler (GT-Scheduler) that leverages a heuristic and rule-based algorithm to schedule tasks at near-optimal performance alongside using a meta-heuristic algorithm to make runtime adaptation. Firstly, K-way graph partitioning divides the tasks in an application graph according to the communication patterns. It places tasks with the highest amount of communication near each other to limit an increase in the topology response time. Secondly, instead of assigning tasks to the worker nodes, a partition of tasks is assigned to the nodes by adopting a greedy strategy. If the capacity of nodes is insufficient to host a specific partition of tasks, this partition is iteratively divided by the k-partitioning algorithm to assign to a proper node. The idea of runtime adaptation lies in detecting overutilized worker nodes and reassigning their tasks by exploiting a Tabu-Search and a new scoring strategy to find the best solution in a way that no worker node is overutilized. GT-Scheduler is implemented on the standard Apache Storm and using the standard benchmarks, it is shown that GT-Scheduler outperforms the R-Storm and the Online-Scheduler by at least 35% in reducing the topology response time. [ABSTRACT FROM AUTHOR]

This paper proposes a new meta-heuristic optimization algorithm, the crown growth optimizer (CGO), inspired by the tree crown growth process. CGO innovatively combines global search and local optimization strategies by simulating the growing, sprouting, and pruning mechanisms in tree crown growth. The pruning mechanism balances the exploration and exploitation of the two stages of growing and sprouting, inspired by Ludvig's law and the Fibonacci series. We performed a comprehensive performance evaluation of CGO on the standard testbed CEC2017 and the real-world problem set CEC2020-RW and compared it to a variety of mainstream algorithms such as SMA, SKA, DBO, GWO, MVO, HHO, WOA, EWOA, and AVOA. The best result of CGO after Friedman testing was 1.6333/10, and the significance level of all comparison results under Wilcoxon testing was lower than 0.05. The experimental results show that the mean and standard deviation of repeated CGO experiments are better than those of the comparison algorithm. In addition, CGO also achieved excellent results in specific applications of robot path planning and photovoltaic parameter extraction, further verifying its effectiveness and broad application potential in practical engineering problems. [ABSTRACT FROM AUTHOR]

Electric vehicles (EVs) have gained considerable popularity, driven in part by an increased concern for the impact of automobile emissions on climate change. Electric vehicles (EVs) cover more than just conventional cars and trucks. They also include electric motorcycles, such as those produced by Gogoro, which serve as the primary mode of transportation for food and package delivery services in Taiwan. Consequently, the Electric Vehicle Routing Problem (EVRP) has emerged as an important variation of the Capacitated Vehicle Routing Problem (CVRP). In addition to the CVRP's constraints, the EVRP requires vehicles to visit a charging station before the battery level is insufficient to continue service. EV battery consumption is linearly correlated to their weight. These additional constraints make the EVRP more challenging than the conventional CVRP. This study proposes an improved Harmony Search Algorithm (HSA), with performance validated by testing 24 available benchmark instances in the EVRP. This study also proposes a novel update mechanism in the improvement stage and a strategy to improve the routes with charging stations. The results show that in small and large instances, the proposed HSA improved the number of trips to the charging stations by 24% and 4.5%, respectively. These results were also verified using the Wilcoxon signed-rank significant test. [ABSTRACT FROM AUTHOR]

In this study, an advanced cooling method for microelectronic modules in a magnetic field is examined through a numerical and artificial intelligence approach. The research utilized a serpentine microchannel with a rectangular cross section and a laminar and steady flow, assessing various flow rates ranging from 0.01 to 0.1 mL s−1. A hybrid nanofluid made of soybean oil with MgO and Al2O3 nanoparticles served as the coolant, tested at different mixing ratios and volume fractions of 1–4%. The impact of several parameters, including forced convection, magnetic field intensity (0–1 Tesla), module heating capacity (3–7 W), and aspect ratio of the microchannel section (AR) (0.5, 1, and 2), was explored using computational fluid dynamics. The research findings revealed that a 1 Tesla magnetic field notably increased module temperatures, with the maximum cooling efficiency observed with the application of the hybrid nanofluid, optimized convection, an AR of 0.5, and the inclusion of a magnetic insulator. This optimal setup resulted in a significant temperature reduction ranging from 5.98 to 112.88 K compared to the use of pure soybean oil without forced convection and a magnetic field strength of 1 Tesla. Furthermore, the study integrated an artificial neural network (ANN) model, which demonstrated superior accuracy and reliability in predicting the system's performance compared to genetic algorithm models. The effectiveness of ANN as a predictive tool suggests a reduction in dependency on elaborate physical experiments for evaluating the cooling performance of microelectronic modules under magnetic influence. This research proposes a potent and systematic approach for managing the thermal challenges faced by microelectronic devices in magnetic fields and deems further exploration into hybrid ANN models with meta-heuristic algorithms beneficial for enhancing solar collector modeling. [ABSTRACT FROM AUTHOR]

Reliable estimation of reference evapotranspiration (ETo), an essential component of optimal irrigation management, is challenging in many regions due to its complex dependence on meteorological factors. Alternative empirical models, often used to estimate ETo considering data limitations, provide highly unreliable estimates for Iraq. This study aimed to formulate simpler empirical models for accurate ETo estimation with fewer variables in different climate regions of Iraq. The metaheuristic Whale Optimization Algorithm (WOA) was used to finetune the coefficients of the nonlinear least square fitting regression (NLLSF) model during development. Two simpler models were developed based on (1) only mean air temperature (T) (NLLSF-T) and (2) solar radiation and T (NLLSF-R) as inputs. The performance of the models was validated using historical ground observations (2012–2021), and the ETo was estimated using the Penman–Monteith method from the reanalyzed (ERA5) datasets (1959–2021). The models' spatial, seasonal, and temporal performance in estimating daily ETo was rigorously evaluated using multiple statistical metrics and visual presentations. The Kling-Gupta Efficiency (KGE) and normalized root mean square error (NRMSE) of the NLLSF-T model were 0.95 and 0.30, respectively, compared to 0.75 and 0.40 for Kharrufa, the best-performing temperature-based models in Iraq. Similarly, NLLSF-R improved the KGE from 0.78 to 0.97 in KGE and NRMSE from 0.44 to 0.22 compared to Caprio, the best-performing radiation-based model in Iraq. The spatial assessment revealed both the models' excellent performance over most of Iraq, except in the far north, indicating their suitability in estimating ETo in arid and semi-arid regions. [ABSTRACT FROM AUTHOR]

Agricultural diesel engines can be operated continuously under complex and variable conditions for extended periods. The higher requirements are posed on the Diesel Particulate Filter (DPF) regeneration and reliability. This study aims to enhance the safe and efficient performance of DPF regeneration, emissions, and fuel economy of agricultural diesel engines. An intelligent multi-objective optimization was also proposed to enhance multiple cyclic training. Taking the agricultural engines as the research object, the sample data of the bench test was obtained after experimental design. A prediction model was then constructed in the conditions of DPF regeneration using a Back Propagation neural network (BPNN). According to the Seagull Optimization Algorithm (SOA), the Adaptive Memory Seagull Optimization (AMSO) was proposed to optimize the structure parameters of the BPNN model, in order to meet the requirements of precision. The targets of optimization included T4, T5, O2 concentration, Brake Specific Fuel Consumption (BSFC), NOx, and smoke opacity. In the specific conditions of agricultural diesel engines, multi-objective optimization of injection and intake control parameters was realized under regeneration mode using the Non-dominated Sorting Genetic Algorithm (NSGA)-III. The AMSO-BP prediction model was used to evaluate the fitness of the Pareto optimal solutions, in order to validate the NSGA-III optimal dataset. The optimized MAP values were written into the Engine Control Unit (ECU) after bench tests. Steady-state and World Harmonized Transient Cycle (WHTC) experiments were carried out to verify the multi-objective optimization of the model. The results indicate that the AMSO significantly outperformed the SOA in the optimization of the BPNN prediction model. The AMSO-BPNN prediction model more accurately utilized experimental data to predict the T4, T5, O2 concentration, BSFC, NOx, and smoke opacity, with the R² values of 0.97, 0.99, 0.95, 0.99, 0.98, and 0.95, respectively, on the validation set. Furthermore, the Mean Absolute Percentage Errors (MAPE) on the validation set were reduced by 0.1%, 0.33%, 0.8%, 0.04%, 0.08%, and 4.2%, respectively, compared with the SOA-BP model. The steady-state tests before and after optimization showed that T4 and T5 increased by an average of 3.14%, where the concentration of exhaust oxygen increased by 2.07% and 10.79%, respectively. Simultaneously, the average reductions in the NOx, smoke opacity, and BSFC were 8.68%, 12.07%, and 1.03%, respectively. Efficient and safe DPF regeneration was achieved to significantly reduce the emissions of diesel engines. There was particularly notable optimization under the operation of agricultural diesel engines, which were often working at low speeds and high loads, fully meeting the usage requirements of these engines. The WHTC transient test also showed that the effectiveness of the optimization was achieved in the T4, T5, and O2 concentrations, which increased by 31%, 2.6%, and 0.5%, respectively. Additionally, NOx and soot emissions decreased by 10.4% and 0.8%, and BSFC was reduced by 3.5%. These findings demonstrate that better performance was obtained under the complex and variable conditions of agricultural diesel engines. In conclusion, the safe and efficient DPF regeneration can be expected to reduce the emissions and operational costs for agricultural diesel engines. The specific requirements of agricultural diesel engines can also be fully met to enhance the system reliability in the engineering application. This research can offer practical guidance to optimize the control parameters under the regeneration mode of diesel engines, particularly for more sustainable and efficient agricultural machinery. [ABSTRACT FROM AUTHOR]

The precise evaluation of predicting software development effort is a serious process in software engineering. The underestimates require more time, which seems to be the negotiation of complete efficient design and complete software testing. Thus, this paper devises a novel model for inspecting the effort taken for the design of software. The Mayfly Lion Optimization (MFLion) algorithm is devised, which ensembles the Mayfly Algorithm (MA) with the Lion Optimization Algorithm (LOA) for precise estimation. The deep maxout network (DMN) is adapted wherein the different weights are produced out of which the most suitable is infused considering the MFLion during model training. The optimal features are selected using recursive feature elimination (RFE) wherein the best features are selected and the remaining irrelevant features are eliminated from the list. The proposed MFLion obtained better performance with the smallest mean magnitude of relative error (MMRE) of 5.909 and the smallest root mean square error (RMSE) of 75.505, respectively. Each technique is produced using a separate database generated using the Promise software engineering repository. The outcomes produced from the assessment of the accuracies of models suggested that the MFLion‐DMN is a substitute to forecast software effort, which is extensively devised in engineering platforms. [ABSTRACT FROM AUTHOR]