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]

The work presents a newly designed penalty function to be added with an existing Cross Entropy based fitness function [3] for optimal selection of multi-level thresholds for image segmentation. The extended fitness function so designed is tested here for Brain magnetic resonance (MR) image segmentation using nature-inspired meta-heuristics such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Whale Optimization Algorithm (WOA) and Moth-flame Optimization (MFO), and MFO is finally selected. The proposed method excels in Brain MR image segmentation when tested on WBA database and BrainWeb MR image database with other nature-inspired meta-heuritic based methods. It outperformed the other methods in terms of the three performance metrics Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM) and Feature Similarity Index (FSIM). The best results shown by the proposed method on WBA database in terms of these metrics - PSNR, SSIM and FSIM - are 29.77, 0.927 and 0.899 respectively. On BrainWeb database, the proposed method yields 26.91, 0.864 and 0.892 for the three respective metrics. [ABSTRACT FROM AUTHOR]

Since many years ago, walnuts have been extensively available around the world and come in various quality varieties. The proper variety of walnut can be grown in the right area and is vital to human health. This fruit's production is time-consuming and expensive. However, even specialists find it challenging to differentiate distinct kinds since walnut leaves are so similar in color and feel. There aren't many studies on the classification of walnut leaves in the literature, and the most of them were conducted in laboratories. The classification process can now be carried out automatically from leaf photos thanks to technological advancements. The walnut data set was applied to the suggested deep learning model. There aren't many studies on the classification of walnut leaves in the literature, and the most of them were conducted in laboratories. The walnut data set, which consists of 18 different types of 1751 photos, was used to test the suggested deep learning model. The three most successful algorithms among the commonly utilized CNN algorithms in the literature were first selected for the suggested model. From the Vgg16, Vgg19, and AlexNet CNN algorithms, many features were retrieved. Utilizing the Whale Optimization Algorithm (WOA), a new feature set was produced by choosing the top extracted features. KNN is used to categorize this feature set. An accuracy rating of 92.59% was attained as a consequence of the tests. [ABSTRACT FROM AUTHOR]

The bitterling fish is a prime example of intelligent behavior in nature for survival. The bitterling fish uses the oyster spawning strategy as their babysitter. The female bitterling fish looks for a male fish stronger than other fish to find the right pair. In order to solve optimization issues, the Bitterling Fish Optimization (BFO) algorithm is modeled in this manuscript based on the mating behavior of these fish. The bitterling fish optimization algorithm is more accurate than the gray wolf optimization algorithm, whale optimization algorithm, butterfly optimization algorithm, Harris Hawks optimization algorithm, and black widow optimization algorithm, according to experiments and implementations on various benchmark functions. Data mining and machine learning are two areas where meta-heuristic techniques are frequently used. In trials, the MLP artificial neural network and a binary version of the BFO algorithm are used to lower the detection error for intrusion traffic. The proposed method's accuracy, precision, and sensitivity index for detecting network intrusion are 99.14%, 98.87%, and 98.85%, respectively, according to experiments on the NSL KDD data set. Compared to machine learning approaches like NNIA, DT, RF, XGBoot, and CNN, the proposed method is more accurate at detecting intrusion. The BFO algorithm is used for feature selection in the UNSW-NB15 dataset, and the tests showed that the accuracy of the proposed method is 96.72% in this dataset. The proposed method of the BFO algorithm is also used to improve Kmeans clustering, and the tests performed on the dataset of covid 19, diabetes, and kidney disease show that the proposed method performs better than iECA*, ECA*, GENCLUST + + (G + +) methods. Deep has KNN, LVQ, SVM, ANN, and KNN. [ABSTRACT FROM AUTHOR]

When contemplating the improvement of overall performance in machine learning (ML) models, a critical strategy for optimizing data preparation is feature selection (FS). There has been a significant rise in the popularity of metaheuristic FS algorithms in recent times. This can be attributed to their proficiency in accurately identifying and selecting the most relevant features for ML tasks. This study presents three feature selection strategies that utilize metaheuristic algorithms. The methodologies mentioned include the Gravitational Search Optimization Algorithm (GSA), Emperor Penguin Optimization (EPO), and a hybrid approach of GSA and EPO referred to as hGSAEPO. Previous research has explored the use of baseline algorithms for feature selection in various ML tasks. However, there is a lack of investigation regarding their application specifically in breast cancer(BC) classification. A combination of these two has been utilized for the first occasion. The purpose of selecting BC as the study of investigation is due to the reason that this illness is recognized as the second most prevalent cause of mortality in the female population. If the condition is detected in its initial phases, it can be remedied and can assist individuals in evading superfluous medical processes. The procedure of selecting relevant features holds significant importance in the purpose of predicting ailments like BC. The current research presents an innovative methodology that employs three soft-computing algorithms, EPO, GSA, and their proposed hybrid hGSAEPO to efficiently identify significant features while concurrently decreasing the occurrence of irrelevant ones, simplifying overall complexity and enhancing the accuracy. The utilization of these soft computing methodologies and six ML classifiers presents a viable framework for prognostic research through the classification of data instances on Wisconsin Diagnostic Breast Cancer (WDBC). The experimental findings of eight experiments conducted suggest that the suggested approach exhibits exceptional performance in the context of binary classification for BC by computing astounding results like precision of 0.9800, sensitivity of 0.9700, specificity of 0.9887, F1-score of 0.9539, area under the curve(AUC) surpassing 0.998, with an accuracy of 98.31%. We achieved our objectives by presenting a dependable clinical prediction system for healthcare professionals for efficient diagnosis. [ABSTRACT FROM AUTHOR]

Summary: Wireless sensor networks (WSNs) represent the collection of restricted energy sensor nodes that are deployed in an area of target for gathering potential environment data for decision‐making with respect to their objective of application. However, the implementation of energy‐effective data gathering strategies in large‐scale WSNs is the most challenging due to the limited energy resources. Clustering‐based data gathering strategies are identified to be quite effective for energy saving that directly attributes to extended network lifetime. Moreover, optimal path amid the cluster head (CH) and sink node needs to be selected for sustaining energy efficiency and improving network lifespan. In this article, Hybrid Salp Swarm and Improved Whale Optimization Algorithm (HSSIWOA)‐based clustering scheme is proposed for improving the network lifetime and routing optimization with maximized energy efficacy. It integrated the exploration capability of Salp Swarm Optimization Algorithm (SSOA) with exploitation benefits of Improved Whale Optimization Algorithm (IWOA) for balancing the trade‐off between the rate of exploration and exploitation during CH selection process. It utilized the parameters of residual energy, load balance, intra‐cluster distance, inter‐cluster distance, and node centrality into account during the process of fitness evaluation. It performed well by constructing an optimized number of clusters, such that energy stability and network lifetime are maintained in the network. The experimental results of the proposed HSSIWOA scheme confirmed extended network lifetime of 21.64%, minimized energy utilization of 23.42%, and maximized throughput of 18.56%, better than the baseline approaches. [ABSTRACT FROM AUTHOR]

A brain-computer interface (BCI) based on an electroencephalograph (EEG) establishes a new channel of communication between the human brain and a computer. Redundant, noisy, and irrelevant channels lead to high computational costs and poor classification accuracy. Therefore, an effective feature selection technique for determining the optimal number of channels can improve BCI's performance. However, existing meta-heuristic algorithms are prone to get trapped in local optimum due to high dimensional dataset. Thus, to reduce dimension, solve inter subject variation and choose an optimal subset of channels, a novel framework called Component Loading followed by Clustering and Classification (CLCC) is proposed in this paper. This novel framework is further divided into two experiment configurations-CLCC with Feature Selection (CLCC-FS) and CLCC without Feature Selection (CLCC-WFS). All these frameworks have been implemented on a motor imagery (MI) EEG dataset of 10 subjects in order to choose the best subset of channels. Further, seven different classifiers have been employed to assess the performance. Experimental outcomes show that on comparing various feature selection techniques, our proposed algorithm i.e., CLCC-FS Opposition-Based Whale Optimization Algorithm (CLCC-FS(OBWOA)) performed substantially better than the other feature selection techniques. We demonstrate that the proposed algorithm is able to achieve 99.6% accuracy by using only few channels and can improve the practicality of the BCI system by reducing the computation cost. [ABSTRACT FROM AUTHOR]

It is very tiresome for a practiser to detect the best feasible sizing design of structural members including reinforced concrete columns that is a highly nonlinear and complicated structural engineering optimization problem. This is due to such a design is practically conducted via conventional trial-and-error computing methods in which resistance to external loads, cost efficiency, and aesthetic factors, etc. have to be considered. This study focuses on minimizing the design cost of primarily proposed reinforced concrete column design problem via three overnew swarm-based optimizers such as Coati Optimization Algorithm, Fox Optimizer and Pelican Optimization Algorithm (POA) that are firstly utilized for this purpose. In this regard, the type of steel rebar distribution, the characteristic strength of the concrete, the height and width of the column section, and the number and diameter of the rebars are treated as discrete design variables of the newly proposed complex reinforced concrete column design cost optimization problem. In solution, the design requirements specified in practice code provisions should also be met. Here, Turkish Building Earthquake Code 2018 specifications are considered as practice structural design constraints. Consequently, the algorithmic performances of three overnew swarm-based metaheuristic optimization algorithms are compared and evaluated in detail. Amongst them, the POA shows most fruitful algorithmic design solution performance. [ABSTRACT FROM AUTHOR]

The artificial hummingbird algorithm (AHA) has been applied in various fields of science and provided promising solutions. Although the algorithm has demonstrated merits in the optimization area, it suffers from local optimum stagnation and poor exploration of the search space. To overcome these drawbacks, this study redesigns the update mechanism of the original AHA algorithm with the natural survivor method (NSM) and proposes a novel metaheuristic called NSM-AHA. The strength of the developed algorithm is that it performs population management not only according to the fitness function value but also according to the NSM score value. The adopted strategy contributes to NSM-AHA exhibiting powerful local optimum avoidance and unique exploration ability. The optimization ability of the proposed NSM-AHA algorithm was compared with 21 state-of-the-art algorithms over CEC 2017 and CEC 2020 benchmark functions with dimensions of 30, 50, and 100, respectively. Based on the Friedman test results, it was observed that NSM-AHA ranked 1st out of 22 competitive algorithms, while the original AHA ranked 8th. This result highlights that the NSM update mechanism provides a remarkable evolution in the convergence performance of the original AHA algorithm. Furthermore, two constrained engineering problems including the optimization of single-diode solar cell model (SDSCM) parameters and the design of a power system stabilizer (PSS) are solved with the proposed algorithm. The NSM-AHA algorithm provided better results compared to other algorithms with a value of 9.86E − 04 root mean square error for SDSCM and 1.43E − 03 integral time square error for PSS. The experimental results showed that the proposed NSM-AHA is a competitive optimizer for solving global and engineering problems. [ABSTRACT FROM AUTHOR]

Photovoltaic (PV) system performance and reliability can be improved through the detection of defects in PV modules and the evaluation of their effects on system operation. In this paper, a novel system is proposed to detect and classify defects based on electroluminescence (EL) images. This system is called Fault Detection and Classification (FDC) and splits into four modules, which are (1) Image Preprocessing Module (IPM), (2) Feature Extraction Module (FEM), (3) Feature Selection Module (FSM), and (4) Classification Module (CM). In the first module (i.e., IPM), the EL images are preprocessed to enhance the quality of the images. Next, the two types of features in these images are extracted and fused together through FEM. Then, during FSM, the most important and informative features are extracted from these features using a new feature selection methodology, namely, Feature Selection-based Chaotic Map (FS-CM). FS-CM consists of two stages: filter stage using chi-square to initially select the most effective features and a modified selection stage using an enhanced version of Butterfly Optimization Algorithm (BOA). In fact, BOA is a popular swarm-based metaheuristic optimization algorithm that has only recently found success. While BOA has many benefits, it also has some drawbacks, including a smaller population and an increased likelihood of getting stuck in a local optimum. In this paper, a new methodology is proposed to improve the performance of BOA, called chaotic-based butterfly optimization algorithm. Finally, these selected features are used to feed the proposed classification model through CM. During CM, Hybrid Classification Model (HCM) is proposed. HCM consists of two stages, which are binary classification stage using Naïve Bayes (NB) and multi-class classification stage using enhanced multi-layer perceptron. According to the experimental results, the proposed system FDC outperforms the most recent methods. FDC introduced 98.2%, 89.23%, 87.2%, 87.9%, 87.55%, and 88.20% in terms of accuracy, precision, sensitivity, specificity, g-mean, and f-measure in the same order. [ABSTRACT FROM AUTHOR]

Metaheuristic is one of the techniques to improve the security of image encryption. However, existing metaheuristic image cryptosystems based on metaheuristic may have convergence difficulties during the optimization process, which cause insecurity and slow convergence. Besides, the time cost of the parallel execution model applied to metaheuristic image cryptosystems is not low enough. Therefore, a parallel many‐objective optimized key generation framework is proposed. Firstly, if four or more security indicators of cryptosystem, which are the results of security test, need to be optimized, the many‐objective optimization algorithm is employed to the proposed framework. With method adjusts the chaotic system parameters as the optimization key, which effectively avoid the convergence difficulty of the encryption key. Secondly, a master‐slave parallel model is improved to metaheuristic encryption. The model allocates the most time‐consuming fitness calculation work to slave nodes, which makes the modified model more reasonable and thus reduces the encryption time. To evaluate the performance of the proposed framework, a specific encryption scheme is constructed, that utilizes a 2D quadric map and many‐objective optimization algorithm based on dominance and decomposition (MOEA/DD) to optimize five security indicators. Experimental results reveal that this scheme has good security performances and less parallel encryption time. [ABSTRACT FROM AUTHOR]

Hybrid metaheuristics is one of the most exciting improvements in optimization and metaheuristic algorithms. A current research topic combines two algorithms to provide a more advanced solution to optimization problems. The present study applies a new approach called HWOA‐TTA which means a hybrid of the whale optimizer algorithm (WOA) and tiki‐taka algorithm (TTA). The hybrid WOA‐TTA combines the exploitation phase of WOA with the exploration phase of TTA. Two stages in the hybridized model are suggested. First, the WOA exploitation phase incorporates the TTA mechanism. Second, a new approach is included in the research phase to enhance the result with each iteration to a set of unconstrained benchmark test functions and engineering design applications. To verify the performance of the improved algorithm, thirteen benchmark functions have been used to compare HWOA‐TTA with the classical intelligent population algorithms (PSO, TTA, and WOA). The hybrid algorithm is applied to two well‐known engineering mathematical models. The experiments show that the HWOA‐TTA outperforms other algorithms. [ABSTRACT FROM AUTHOR]

The content of heavy metal Cu in soil is an important indicator for assessing soil quality. However, soil hyperspectral data contain a large amount of redundant data, which can affect the effectiveness of spectral modelling. To address this problem, a combined method based on Whale Optimization Algorithm and Successive Projection Algorithm (WOA-SPA) is proposed to select the characteristic bands. And a prediction model of soil heavy metal Cu content was constructed using the partial least squares method. The experimental results show that: (1) The prediction accuracy of soil Cu content using the WOA-PLSR model was higher than that of the SPA-PLSR model, with RPD increased by 0.229, the R2 increased by 0.07, and RMSE decreased by 0.354. (2) Running the WOA and WOA-SPA combination algorithms 30 times respectively to prove the stability of the algorithms, the prediction accuracy of the model constructed based on the WOA-SPA combination algorithm is better than that of the model constructed based on the WOA algorithm as a whole. (3) Compared with the WOA or SPA algorithm alone, the prediction model constructed based on the WOA-SPA algorithm has a better prediction performance, with RPD of 2.259, R2 of 0.804, and RMSE of 2.396 for the prediction set. (4) Comparing the spatial distribution maps of the measured and predicted values, it can be observed that the spatial distribution between the predicted Cu content values based on the combined WOA-SPA algorithm and the measured Cu content values are basically consistent. This study indicates that the WOA-SPA-PLSR model has good stability and prediction accuracy for the prediction of Cu content in soil, which is of great practical significance for the rapid and accurate estimation of heavy metal Cu content in soil. HIGHLIGHTS: A novel dimensionality reduction method based on WOA-SPA was proposed. The WOA-SPA-PLSR model was constructed, which can accurately and quantitatively predict the content of heavy metal Cu in soil. The characteristic band selected by the WOA-SPA combination algorithm accounts for 2.79% of the full band, effectively reducing the dimensionality of soil hyperspectral data. Comparing the spatial distribution maps of measuredsoil Cu content and predicted soil Cu content,it can be found that the spatialdistribution of thetwois basically consistent. This shows that the WOA-SPA-PLSR model can effectively predict the spatialdistribution of soil Cu content in this area. [ABSTRACT FROM AUTHOR]

Affected by the uncertainty of external environmental factors, wind power generation has significant characteristics of randomness and non-stationarity. Accurately predicting wind power is a necessary technical means to improve the efficiency of wind energy utilization and reduce wind abandonment. Integrating large-scale wind power into the grid has put higher requirements for wind power prediction accuracy. Hence, this study proposes a combined prediction model based on wavelet denoising (WD), hybrid enhanced seagull optimization algorithm (HESOA) and support vector machine (SVM) to predict short-term wind power. The WD technology obtains effective signals from original wind power data, providing a reasonable basis for prediction research. The HESOA is proposed by introducing the Tent mapping, individual self-learning factor and Gaussian population strategy into the original seagull optimization algorithm to optimize SVM's prediction ability. The case study results reflect that the prediction method is feasible and universal in suppressing wind power generation volatility in spring and winter. The RMSE of short-term wind power prediction is controlled below 65 kW, and the value of R2 is above 98%. This study improves the accuracy of wind power prediction and helps to strengthen the renewable energy consumption level and reliability of wind power grid-connected generation systems. [ABSTRACT FROM AUTHOR]

This paper proposes a novel structural damage identification approach coupling the Mayfly algorithm (MA) with static displacement-based response surface (RS). Firstly, a hybrid optimal objective function is established that simultaneously considers the sensitivity-based residual errors of static damage identification equation and the static displacement residual. In the objective function, the static damage identification equation is addressed by the Tikhonov regularization technique. The MA is subsequently employed to conduct an optimal search and pinpoint the location and intensity of damages at the structural element level. To handle the inconformity of the static loading points and the measurement points of displacements, the model reduction and displacement extension techniques are implemented to reconstruct the static damage identification equation. Meanwhile, the static displacement-based RS is constructed to calculate the displacement residual in the hybrid objective function, thereby circumventing the time-consuming finite element calculations and improving computational efficiency. The identification results of the numerical box girder bridge demonstrate that the proposed method outperforms the particle swarm optimization, differential evolution, Jaya and whale optimization algorithms about both convergence rate in optimal searching and identification accuracy. The proposed method enables more accurate damage identification compared to methods solely based on the indicator of the residual of static damage identification equations or displacement residual. The results of identifying damage in the 21 element-truss structure and the static experiments on identifying damage in an aluminum alloy cantilever beam confirm the high efficiency of the proposed approach. [ABSTRACT FROM AUTHOR]

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

Predicting carbon dioxide emissions is crucial for addressing climate change and achieving environmental sustainability. Accurate emission forecasts provide policymakers with a basis for evaluating the effectiveness of policies, facilitating the design and implementation of emission reduction strategies, and helping businesses adjust their operations to adapt to market changes. Various methods, such as statistical models, machine learning, and grey prediction models, have been widely used in carbon dioxide emission prediction. However, existing research often lacks comparative analysis with other forecasting techniques. This paper constructs a new Discrete Fractional Accumulation Grey Gompertz Model (DFAGGM(1,1) based on grey system theory and provides a detailed solution process. The Whale Optimization Algorithm (WOA) is used to find the hyperparameters in the model. By comparing it with five benchmark models, the effectiveness of DFAGGM(1,1) in predicting carbon dioxide emissions data for China and the United States is validated. [ABSTRACT FROM AUTHOR]

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

Summary: Internet of Things (IoT) based sensor networks have been established as a pillar in intelligent communication systems for efficiently handling roadside congestion and accidents. These IoT networks sense, collect, and process data on a real‐time basis. However, IoT based sensor network clustering has various energy constraints such as inefficient routing due to long‐haul transmission, hot spot problem, network overhead, and unstable network whenever deployed along with the roadside that affect their architecture. In such networks, clustering techniques play a crucial role in extending the lifespan and optimizing the routes by integrating sensor devices through clusters. Therefore, a meta‐heuristic algorithm for clustering in IoT sensor networks for an intelligent transportation system is proposed. In this work, the seagull optimization algorithm is applied for clustering by considering residual and average energy, node spacing, and distance fitness parameters. Moreover, this work also considers the dynamic communication range of the cluster heads for increasing the stability period and lifetime of the proposed networks. The experiment results demonstrate that the proposed Seagull optimization algorithm for clustering in IoT networks (SOAC‐IoTNs) and Seagull optimization algorithm for clustering in IoT networks with dynamic communication range (SOAC‐IoTNs‐DR) achieve a significant increase in the stability period and network lifetime, with percentage increments of 55.68% and 71.47%, and 10.03% and 88.66% respectively, compared to the existing optimized genetic algorithm for cluster head selection with single static sink (OptiGACHS‐StSS). [ABSTRACT FROM AUTHOR]

Efficient flood risk management hinges on the precise mapping and assessment of areas vulnerable to flooding. This research endeavors to advance the flood susceptibility mapping in Jeddah, Saudi Arabia by harnessing the long short-term memory (LSTM) algorithm enriched with two sophisticated metaheuristic optimizers: invasive weed optimization (IWO) and harmony search (HS). The process commenced with the utilization of synthetic aperture radar (SAR) imagery to construct a detailed flood inventory map. A comprehensive geodatabase encompassing various flood conditioning factors—encompassing lithology, land use, proximity to water bodies, hydrologic soil group (HSG), topographical features (such as slope, plan curvature, and aspect), and hydrological indices [including profile curvature, Topographic Wetness Index (TWI), flow accumulation, Topographic Position Index (TPI), altitude, Terrain Ruggedness Index (TRI), and Stream Power Index (SPI)] was meticulously curated. To develop the model, 70% of this dataset was employed, while the remaining 30% served to validate the predictive efficacy of the resultant flood susceptibility maps. These maps' accuracy was quantitatively gauged through the receiver operating characteristic curve and the area under the curve (AUC) statistics. Findings reveal that the integration of LSTM with IWO and HS metaheuristic algorithms significantly enhances accuracy (LSTM-IWO: AUC = 0.900; LSTM-HS: AUC = 0.876) in comparison to the standalone LSTM approach (AUC = 0.863). The implementation of these hybrid algorithms manifests as a potent and economically viable approach for detailed geospatial modeling of flood susceptibility, providing invaluable insights to bolster flood mitigation, preparedness, and emergency response strategies. [ABSTRACT FROM AUTHOR]

Hybrid energy system (HES) is considered a solution to the energy supply issue, particularly in rural areas to achieve their sustainable development goals. The rise in energy consumption has increased the appeal of renewable resources, because of their potential to supply consumers with competitive, carbon-free electricity. This paper suggests strategies for managing energy and the most recently published optimizers for designing a stand-alone HES positioned in a remote region of southwest Egypt. This HES includes two green energy sources (wind and solar) and a storage system for energy (battery) as the first backup in addition to a second backup (diesel). The most recent sizing techniques employing the Chernobyl disaster optimizer, dynamic control cuckoo search (DCCS), and gold rush optimizer have been suggested to obtain the optimal design of the utilized HES. Furthermore, an in-depth evaluation of the applied optimization approaches has been achieved based on a comparative study. A detailed analysis of the studied algorithms aims to identify the optimum algorithm that provides the lowest possible cost at the highest level of reliability for the proposed HES. The simulation results verified that, the DCCS algorithm outperformed other algorithms, indicating its potential for achieving promising solutions. [ABSTRACT FROM AUTHOR]

Brain tumor is the most serious and deadly disease, and it is formed due to abnormal cell production. There are two different sorts of tumors including benign (non-cancerous) and malignant (cancerous), and the third level of a brain tumor is cancerous, which is a highly deadly form of cancer. Detecting brain tumors early is crucial for accurate diagnosis and efficient treatment planning. Although numerous techniques are established, the prediction techniques are time-consuming, have higher computational complexity, prone to overfitting, and have limited accuracy. Thus we proposed an Attention Bi-directional Gated Recurrent Unit Ensemble Support Vector Machine (ABES model) for detecting brain tumors. Here, the Bi-GRU layer learns the most important context information for every image. The attention layer also uses the attention mechanism to assign weights to each Bi-GRU layer output. The ensemble SVM classifier performs the categorization of brain tumors. Then, the training set is used to train the Attention BiGRU model and Ensemble SVM classifiers. The ABES classifier weights are optimized by utilizing the improved whale optimization algorithm. To demonstrate the efficiency of our proposed method, we compare it to four existing methods including Fully Automatic Heterogeneous Segmentation-based Support Vector Machine, Whale Harris Hawks Optimization-based Deep Learning, Machine learning-based back propagation neural networks, and Deep Convolutional Neural Network. Also, the ABES model is validated using the MRI dataset and the Figshare brain tumor dataset. Accuracy, precision, specificity, and sensitivity are the performance metrics used to evaluate classification performance, which achieves 97.2% accuracy, 98.61% Precision, 96.48% Specificity, and 97.34% Sensitivity, respectively. [ABSTRACT FROM AUTHOR]

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

Software reliability growth models (SRGMs) are universally admitted and employed for reliability assessment. The process of software reliability analysis is separated into two components. The first component is model construction, and the second is parameter estimation. This study concentrates on the second segment parameter estimation. The past few decades of literature observance say that the parameter estimation was typically done by either maximum likelihood estimation (MLE) or least squares estimation (LSE). Increasing attention has been noted in stochastic optimization methods in the previous couple of decades. There are various limitations in the traditional optimization criteria; to overcome these obstacles metaheuristic optimization algorithms are used. Therefore, it requires a method of search space and local optima avoidance. To analyze the applicability of various developed meta-heuristic algorithms in SRGMs parameter estimation. The proposed approach compares the meta-heuristic methods for parameter estimation by various criteria. For parameter estimation, this study uses four meta-heuristics algorithms: Grey-Wolf Optimizer (GWO), Regenerative Genetic Algorithm (RGA), Sine-Cosine Algorithm (SCA), and Gravitational Search Algorithm (GSA). Four popular SRGMs did the comparative analysis of the parameter estimation power of these four algorithms on three actual-failure datasets. The estimated value of parameters through meta-heuristic algorithms are approximately near the LSE method values. The results show that RGA and GWO are better on a variety of real-world failure data, and they have excellent parameter estimation potential. Based on the convergence and R2 distribution criteria, this study suggests that RGA and GWO are more appropriate for the parameter estimation of SRGMs. RGA could locate the optimal solution more correctly and faster than GWO and other optimization techniques. [ABSTRACT FROM AUTHOR]

Introduction: Mechanical damage significantly reduces the market value of fruits, making the early detection of such damage a critical aspect of agricultural management. This study focuses on the early detection of mechanical damage in blueberries (variety: Sapphire) through a non-destructive method. Methods: The proposed method integrates hyperspectral image fusion with amultistrategy improved support vector machine (SVM) model. Initially, spectral features and image features were extracted from the hyperspectral information using the successive projections algorithm (SPA) and Grey Level Co-occurrence Matrix (GLCM), respectively. Different models including SVM, RF (Random Forest), and PLS-DA (Partial Least Squares Discriminant Analysis) were developed based on the extracted features. To refine the SVM model, its hyperparameters were optimized using a multi-strategy improved Beluga Whale Optimization (BWO) algorithm. Results: The SVM model, upon optimization with the multi-strategy improved BWO algorithm, demonstrated superior performance, achieving the highest classification accuracy among the models tested. The optimized SVM model achieved a classification accuracy of 95.00% on the test set. Discussion: The integration of hyperspectral image information through feature fusion proved highly efficient for the early detection of bruising in blueberries. However, the effectiveness of this technology is contingent upon specific conditions in the detection environment, such as light intensity and temperature. The high accuracy of the optimized SVM model underscores its potential utility in post-harvest assessment of blueberries for early detection of bruising. Despite these promising results, further studies are needed to validate the model under varying environmental conditions and to explore its applicability to other fruit varieties. [ABSTRACT FROM AUTHOR]

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

In coastal areas, coconuts are a common crop. Everyone from farmers to lawmakers and businesses would benefit from an accurate forecast of coconut production. Internet of Things (IoT) sensors are strategically positioned to continuously monitor the environment and gather production statistics to obtain accurate agricultural output predictions. To effectively estimate coconut prediction, this study presents an enhanced deep learning classifier called Bi-directional Long Short-Term Memory (BILSTM) with the integrated Lévy Flight and Seagull Optimization Algorithm (LFSOA). LASSO feature selection is applied to eliminate the superfluous characteristics in the yield estimation. To further enhance the coconut yield estimate, the optimal set of hyperparameters for BILSTM is tuned by the LFSOA, which helps to avoid the overfitting issue. For the results, the BILSTM is compared against different classifiers such as Recurrent Neural Network (RNN), Random Forest Classifier (RFC), and LSTM. Similarly, LFSOA-based hyperparameter tuning is contrasted with different optimization algorithms. The outputs show that LFSOA-based hyperparameter tuning in BILSTM achieved accuracy, precision, recall, and f1-score of 98.963%, 99.026%, 99.155%, and 95.758%, respectively, which are higher when compared to existing methods. Similarly, the BILSTM-LFSOA accomplished better results in statistical measures, including the Root Mean Square Error (RMSE) of 0.105, Mean Squared Error (MSE) of 0.011, Mean Absolute Error (MAE) of 0.094, and coefficient of determination (R2) of 0.954, respectively. From the overall analysis, the proposed BILSTM-LFSOA improves coconut yield prediction by achieving better results in all the performance measures when compared with existing models. The results of this study are important to many stakeholders, including but not limited to policymakers, farmers, banks, and insurance companies. As coconuts are an important crop in developing countries, accurate coconut yield forecasting will lead to greater financial and food security in these regions. [ABSTRACT FROM AUTHOR]

Autonomous driving systems are a rapidly evolving technology. Trajectory prediction is a critical component of autonomous driving systems that enables safe navigation by anticipating the movement of surrounding objects. Lidar point-cloud data provide a 3D view of solid objects surrounding the ego-vehicle. Hence, trajectory prediction using Lidar point-cloud data performs better than 2D RGB cameras due to providing the distance between the target object and the ego-vehicle. However, processing point-cloud data is a costly and complicated process, and state-of-the-art 3D trajectory predictions using point-cloud data suffer from slow and erroneous predictions. State-of-the-art trajectory prediction approaches suffer from handcrafted and inefficient architectures, which can lead to low accuracy and suboptimal inference times. Neural architecture search (NAS) is a method proposed to optimize neural network models by using search algorithms to redesign architectures based on their performance and runtime. This paper introduces TrajectoryNAS, a novel neural architecture search (NAS) method designed to develop an efficient and more accurate LiDAR-based trajectory prediction model for predicting the trajectories of objects surrounding the ego vehicle. TrajectoryNAS systematically optimizes the architecture of an end-to-end trajectory prediction algorithm, incorporating all stacked components that are prerequisites for trajectory prediction, including object detection and object tracking, using metaheuristic algorithms. This approach addresses the neural architecture designs in each component of trajectory prediction, considering accuracy loss and the associated overhead latency. Our method introduces a novel multi-objective energy function that integrates accuracy and efficiency metrics, enabling the creation of a model that significantly outperforms existing approaches. Through empirical studies, TrajectoryNAS demonstrates its effectiveness in enhancing the performance of autonomous driving systems, marking a significant advancement in the field. Experimental results reveal that TrajcetoryNAS yields a minimum of 4.8 higger accuracy and 1.1* lower latency over competing methods on the NuScenes dataset. [ABSTRACT FROM AUTHOR]

Large-scale optimization (LSO) problems among photovoltaic (PV) and concentrated solar power (CSP) systems are attracting increasing attention as they help improve the energy dispatch efficiency of PV and CSP systems to minimize power costs. Therefore, it is necessary and urgent to systematically analyze and summarize various LSO methods to showcase their advantages and disadvantages, ensuring the efficient operation of hybrid energy systems comprising different PV and CSP systems. This paper compares and analyzes the latest LSO methods for PV and CSP systems based on meta-heuristic algorithms (i.e., Particle Swarm Optimization, Genetic Algorithm, Enhanced Gravitational Search Algorithm, and Grey Wolf Optimization), numerical simulation and stochastic optimization methods (i.e., Constraint Programming, Linear Programming, Dynamic Programming Optimization Algorithm, and Derivative-Free Optimization), and machine learning-based AI methods (Double Grid Search Support Vector Machine, Long Short-Term Memory, Kalman Filter, and Random Forest). An in-depth analysis and A comparison of the essence and applications of these algorithms are conducted to explore their characteristics and suitability for PV and CSP or hybrid systems. The research results demonstrate the specificities of different LSO algorithms, providing valuable insights for researchers with diverse interests and guiding the selection of the most appropriate method as the solution algorithm for LSO problems in various PV and CSP systems. This also offers useful references and suggestions for extracting research challenges in LSO problems of PV and CSP systems and proposing corresponding solutions to guide future research development. [ABSTRACT FROM AUTHOR]

The state of charge (SOC) is a core parameter in the battery management system for LMFP batteries. Accurate SOC estimation is crucial for ensuring the safety and reliability of energy storage applications and new energy vehicles. In order to achieve better SOC estimation accuracy, this article proposes an adaptive whale optimization algorithm (WOA) with chaotic mapping to improve the BP neural network (BPNN) model. The SOC estimation accuracy of the BPNN model was improved by utilizing WOA to find the optimal target weight values and thresholds. Comparative simulation experiments (including constant current and working condition discharge experiments) were conducted in Matlab/Simulink R2018a to verify the proposed algorithm and the other four algorithms. The experimental results show that the proposed algorithm had higher SOC estimation accuracy than the other four algorithms, and its prediction errors were less than 1%. This indicates that the proposed SOC estimation method has better prediction accuracy and stability, and has certain theoretical research significance. [ABSTRACT FROM AUTHOR]

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition 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.)

Copyright of Transactions of the Chinese Society of Agricultural Engineering is the property of Chinese Society of Agricultural Engineering 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.)

This study focuses on the delivery routing problem faced by a transport company located in Phuket, Thailand. The goal of this study is to find a daily optimum route in order to minimize the total transportation cost, which comprises fixed costs associated with vehicle rental and variable costs calculated based on factors of travel distance, fuel prices, and fuel consumption. The complexity of this problem is compounded by the fact that customer demand often exceeds a vehicle capacity, in terms of weight and volume. In addition, delivery must be made within specific time windows. To tackle this issue, the delivery routing problem is classified as a multi-trip capacitated vehicle routing problem with time window (MTCVRPTW). Since the problem is NP-hard, an application of metaheuristic is more practical to determine the delivery routing of the company within a reasonable computing time. In this study, Particle Swarm Optimization (PSO) and Differential Evolution (DE) algorithm are applied to solve MTCVRPTW. The numerical results show that DE provides better solution quality compared to those obtained from PSO and company current practices. [ABSTRACT FROM AUTHOR]

To improve the reliability of the glass fiber-reinforced plastic (GFRP) mortar culvert structure more effectively, their failure modes were estimated by combining the Tsai–Wu and Tang failure criteria. The reliability of GFRP mortar culverts was analyzed using the Monte Carlo method. According to the characteristics of structure of GFRP mortar pipe culvert, the adaptive adjustment weights were introduced to improve the whale optimization (WOA) algorithm. The improved WOA algorithm was used to optimize the structure design of the GFRP mortar pipe culvert with its reliability as the objective function under a certain weight. It was determined that the laminated structure produces different optimal lamination angles with different relative thicknesses of single layers. As the number of layers increases, the optimal angle of fibers increases significantly. The optimization based on three design variables gave better results than based on two design variables. It was determined the optimal characteristics to reach maximum reliability of structure of GFRP mortar pipe culvert. [ABSTRACT FROM AUTHOR]

Various popular multiplayer battle royale games share a lot of common elements. Drawing from our observations, we summarized these shared characteristics and subsequently proposed a novel heuristic algorithm named multiplayer battle game-inspired optimizer (MBGO). The proposed MBGO streamlines mainstream multiplayer battle royale games into two discrete phases: movement and battle. Specifically, the movement phase incorporates the principles of commonly encountered "safe zones" to incentivize participants to relocate to areas with a higher survival potential. The battle phase simulates a range of strategies players adopt in various situations to enhance the diversity of the population. To evaluate and analyze the performance of the proposed MBGO, we executed it alongside ten other algorithms, including three classics and five latest ones, across multiple diverse dimensions within the CEC2017 and CEC2020 benchmark functions. In addition, we employed several industrial design problems to evaluate the scalability and practicality of the proposed MBGO. The statistical analysis results reveal that the novel MBGO demonstrates significant competitiveness, excelling in convergence speed and achieving high levels of convergence accuracy across both benchmark functions and real-world problems. [ABSTRACT FROM AUTHOR]

The Harris hawk Optimization (HHO) has the advantage of employing various local search strategies to adapt to different situations during the exploitation phase. Hence, HHO can search deeper into discovered prospective regions. The reason of poor robustness is that HHO exhibits high randomness in the exploration phase. In the scene of optimizing high-dimensional or multimodal Tasks, the increased dimensionality and parameter correlation lead to the problem of local optimal regions, which affects the accuracy and convergence of the solution. To address these issues, we propose Dynamic Random Mutation Hybrid Harris hawk Optimization (DRM-HHHO). In the hybrid algorithm, the Kepler Optimization Algorithm (KOA) was enhanced (called EKOA) to replace the exploration phase of HHO to solve the problem of excessive diffusion. At the end of each iteration, the leader's position is perturbed by the Dynamic Random Mutation (DRM) algorithm. The mutation probability is adjusted based on the dimension to suit problems of different scales. We conduct ablation experiment to test the effectiveness of the two improved mechanisms. Testing our method on the CEC2017 and CEC2019 benchmark functions, we find that the significance of mutation probability differences decreases with increasing dimensionality. Compared to other Metaheuristic Algorithms (MAs), such as WOA, TSA, and so on, DRM-HHHO shows superior overall performance, especially in solving high-dimensional problems. Furthermore, we successfully apply DRM-HHHO to optimize the Kernel Extreme Learning Machine (KELM) critical parameters. DRM-HHHO-KELM outperforms four traditional machine learning methods and five MAs-KELM strategies on the Australian Credit and Pima Indian Diabetes datasets. [ABSTRACT FROM AUTHOR]