Search

Data mining and machine learning require feature selection because features can dramatically improve model performance. In contrast, there are no polynomial solutions for selecting a subset feature. It is possible to achieve this by using meta-heuristic algorithms, specifically population-based algorithms that are able to provide a subset of features that is optimal and not exact. Meta-heuristic algorithms face challenges such as staying in local minima, easily falling into local optimum, weakly global searchability, premature convergence, and slow convergence speeds. However, recent research has limitations such as high complexity and weak initialization. In order to overcome these limitations, a three-stage model is proposed. In the first stage, the correlation of features and the correlation of features with class are considered during feature selection and used to create the initial population in the pathfinder optimization algorithm (PFA). PFA is a population-based algorithm and has some drawbacks, in the last iterations, the fluctuation rate (A) and vibration vector (ε) parameters converge to 0, and finding a new solution is impossible. As a second stage, a fuzzy inference system is designed to adjust these parameters adaptively and is called fuzzy-pathfinder optimization (FPO). In the third stage, FPO is used to select relevant features based on classification error, proportion of selected features, and redundancy. Finally, different algorithms such as simulated annealing (SA), differential evolutionary (DE), genetic algorithm (GA), particle swarm optimization (PSO), PFA, estimation of distribution algorithm (EDA), and symmetrical uncertainty criterion (SUC-PSO) are used for comparison. Based on the results, the proposed model is able to reach an average accuracy of 96% on average. Based on a comparison of the proposed algorithm with SA, DE, GA, PSO, PFA, EDA, and SUC-PSO, the objective function is improved by 17.3%, 5.6%, 3.0%, 4.5%, 5.0%, 0.5%, and 1.2%, respectively. The use of comprehensive objective functions, the adaptive adjustment of parameters, and the creation of a targeted initial population are key strengths of FPO. [ABSTRACT FROM AUTHOR]

In this study, we introduce the pied kingfisher optimizer (PKO), a novel swarm-based meta-heuristic algorithm that draws inspiration from the distinctive hunting behavior and symbiotic relationships observed in pied kingfishers in the natural world. The PKO algorithm is structured around three distinct phases: perching/hovering for prey (exploration/diversification), diving for prey (exploitation/intensification), and fostering symbiotic relations. These behavioral aspects are translated into mathematical models capable of effectively addressing a wide array of optimization challenges across diverse search spaces. The algorithm's performance is rigorously evaluated across thirty-nine test functions, which encompass various unimodal, multimodal, composite, and hybrid ones. Additionally, eight real-world engineering optimization problems, including both constrained and unconstrained scenarios, are considered in the assessment. To gauge PKO's efficacy, it is subjected to a comparative analysis against 3 categories of rival optimizers. The 1st category comprises well-established and widely-cited optimizers such as particle swarm optimization and genetic algorithm. The 2nd category encompasses recently published algorithms, including Harris Hawks optimization, Whale optimization algorithm, sine cosine algorithm, Grey Wolf optimizer, gravitational search algorithm, and moth-flame optimization. The 3rd category includes advanced algorithms, such as covariance matrix adaptation evolution strategy and Ensemble Sinusoidal Differential Covariance Matrix Adaptation with Euclidean Neighborhood (LSHADE-cnEpSin). The comparative analysis employs various performance metrics, including the Friedman mean rank and the Wilcoxon rank-sum test, to reveal PKO's effectiveness and efficiency. The overall results highlight PKO's exceptional ability to tackle intricate optimization problems characterized by challenging search spaces. PKO demonstrates superior exploration and exploitation tendencies while effectively avoiding local optima. The source code for the PKO algorithm is publicly accessible at https://www.mathworks.com/matlabcentral/fileexchange/160043-pied-kingfisher-optimizer-pko. [ABSTRACT FROM AUTHOR]

Metaheuristic methods have emerged as powerful tools for solving complex optimization problems in various domains, including the sustainability of water distribution systems. They provide efficient and effective solutions by mimicking natural processes and searching for the optimal option within a large solution space. Despite the existence of these methods in the water distribution field for several years, a direct comparison between the various proposed solutions often proves challenging, due to the different parameter definitions used by the authors. The present review presents the solutions proposed by a total of 36 research papers taken from the Web of Science, Scopus and Google Scholar databases focusing on the application of metaheuristic methods for leakage reduction and energy saving in water distribution networks. The review is intended to facilitate comparative analysis among the solutions proposed by authors concerning key aspects of the optimization process. These aspects include the definition of the algorithm, the specification of the objective function, and the strategies employed for reducing the search space. The characteristics of the networks used as case studies by the reviewed papers are also presented to allow the reader to evaluate the applicability of the solutions to specific networks. [ABSTRACT FROM AUTHOR]

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

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

The flexible job shop scheduling problem (FJSP) is a classic NP-hard problem, and the quality of its scheduling solution directly affects the operational efficiency of the manufacturing system. However, the traditional scheduling algorithms suffer from poor generalization when solving FJSP; there are problems such as long computational time and dimensional disasters, especially as the scale of FJSP increases. Therefore, an effective deep actor-critic reinforcement learning (DACRL) method is proposed for solving FJSP. Firstly, the FJSP is modeled as a multi-agent Markov decision process (MMDP), the state space, action space, and reward function in the MMDP are designed. Secondly, a DACRL model is constructed to solve FJSP. The actor network is responsible for choosing the most suitable scheduling rule in different states, while the critic network is responsible for outputting the value function of the actions and providing feedback to the actor network to better adjust the scheduling strategy. Finally, the proposed DACRL method is validated on benchmark FJSP instances of different scales. The experimental results show that the proposed method significantly outperforms the heuristic scheduling rules and double deep Q-network (DDQN) in terms of solution quality. Compared with the meta-heuristic algorithms and the self-learning genetic algorithm (SLGA), the proposed method has higher solution efficiency with the same solution quality. [ABSTRACT FROM AUTHOR]

Network function virtualization (NFV) is a contemporary network architecture concept that integrates complex network functions into software-based virtual network functions (VNFs) instead of specialized hardware. Resource allocation for multiple service function chain requests (SFC) in NFV-enabled networks is a fundamental challenge for network providers. Several research studies have focused on this problem in detail. Specifically, SFC routing attempts to satisfy each request by assigning a path across data centers that places the ordered set of required VNFs. This paper formulates this problem as an SFC provisioning problem (SFCRP) with the two objectives of maximizing the number of accepted requests and balancing the utilization of network resources. To address this problem, a two-stage routing algorithm (2PRT) that integrates Yen's algorithm and a genetic algorithm is proposed. The simulation results based on 12 scenarios that use three real-world networks and randomly generated requests indicate that the batch mode significantly enhances the acceptance rate compared to the existing methods. [ABSTRACT FROM AUTHOR]

Topology control is a significant research problem when it comes to designing energy-efficient wireless sensor networks (WSNs). It is a metric for evaluating network service quality. To ensure the quality of network services, it is critical to provide energy-efficient sensor node scheduling in order to extend the network's lifespan. In this paper, we propose an energy-aware scheduling protocol (ESP)-based hybrid metaheuristic technique for minimizing the amount of energy consumption and ensuring sufficient coverage for the monitored area while maximizing the network lifespan for WSNs. The ESP consists of two phases: distributed clustering and sensor node scheduling. The clustering phase implements the DBSCAN clustering algorithm with slide modification to cluster the sensor nodes in the area of interest into clusters of nodes, and the efficient periodic cluster head election approach is proposed based on criteria such as remaining energy, number of neighbors, and distance for each node in the cluster. This clustering is only performed at the beginning to group the nodes into clusters. Then, only the cluster head election will be done every period. In the scheduling phase, we model the scheduling optimization problem using three objectives: reducing the number of uncovered zones, minimizing the number of active sensors, and selecting the active sensor nodes with the maximum remaining energy. This scheduling optimization model is solved using a hybrid metaheuristic algorithm. When the genetic algorithm's operators were added to the regular Cuckoo algorithm, the balance between exploration and exploitation abilities was improved even more. The algorithms were able to search a larger area. Extensive simulation experiments were conducted using the OMNeT++ network simulator. The results show that the proposed ESP protocol introduces better performance in terms of coverage ratio, active sensor ratio, energy consumption, network lifespan, and execution time compared to other existing techniques. [ABSTRACT FROM AUTHOR]

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

An important and realistic class of scheduling problems is considered in this paper: the total earliness and tardiness minimization in the blocking flowshop, where there is no intermediate buffer between machines. Blocking occurs when a completed item or product remains on the machine until the next machine is available. We proposed a new hybrid evolutionary algorithm: the Genetic Iterated Greedy Algorithm (GIGA). In our innovative solution approach, a genetic algorithm presents a hybrid crossover based on the Iterated Greedy metaheuristic. The hybrid crossover considers the Hamming distance as an indicator of the diversity of the current population. In the first generations, the crossover will adopt larger values for the destruction parameter, and this value is gradually reduced throughout the search process. Our proposal is compared to four competitive metaheuristics reported for earliness and tardiness flowshop. Two performance indicators are considered: the Average Relative Percentage Deviation (ARPD) and the Success Rate (SR). Based on the statistical analysis of the computational experimentation, our GIGA outperformed all the implemented algorithms of the literature with statistical significance. Concerning the performance indicators, GIGA achieved ARPD = 0.02% and SR = 83.5%, pointing to the superiority of the proposed solution approach. [ABSTRACT FROM AUTHOR]

Digital twin network (DTN) as an emerging network paradigm, have garnered growing attention. For large-scale networks, a crucial problem is how to effectively map physical networks onto the infrastructure platform of DTN. To address this issue, we propose a heuristic method of the adaptive boundary whale optimization algorithm (ABWOA) to solve the digital twin network construction problem, improving the efficiency and reducing operational costs of DTN. Extensive comparison experiments are conducted between ABWOA and various algorithms such as genetic algorithm, particle swarm optimization, artificial bee colony, differential evolution algorithm, moth search algorithm and original whale optimization algorithm. The experimental results show that ABWOA is superior to other algorithms in terms of solution quality, convergence speed, and time cost. It can solve the digital twin network construction problem more effectively. [ABSTRACT FROM AUTHOR]

Logistics distribution is one of the main sources of carbon dioxide emissions at present, and there are also such distribution problems in the shipbuilding process. With the increasing attention paid to environmental problems, how to effectively reduce the energy consumption of block transportation and improve the utilization rate of resources in the factory is the key problem that China's shipbuilding industry needs to solve at present. This article considers the time windows for block transportation tasks, as well as the self-loading constraints of different types of flat cars, and establishes an optimization model that minimizes the empty transport time and energy consumption of the flat cars as the optimization objective. Then, an Improved Genetic Whale Optimization Algorithm is designed, which combines the cross and mutation ideas of genetic algorithms and proposes a whale individual position updating mechanism under a mixed strategy. Furthermore, the performance and computational efficiency of the algorithm are verified through comparative analysis with other classical optimization algorithms on standard test examples. Finally, the shipyard's block transportation example proves that the energy-saving ship block transportation scheduling method can effectively improve the efficiency of shipbuilding enterprise's block transportation and reduce the energy consumption in the block transportation process. It proves the engineering practicality of the green dispatching method proposed in this paper, which can further provide a decision-making method for shipyard managers. [ABSTRACT FROM AUTHOR]

Feature selection (FS) is a crucial preprocessing step that aims to eliminate irrelevant and redundant features, reduce the dimensionality of the feature space, and enhance clustering efficiency and effectiveness. FS is categorized as NP-Hard due to the high number of existing solutions. Various metaheuristic methods have been developed to address the FS problem, yielding promising results. Particularly, particle swarm optimization (PSO), an evolutionary computing (EC) approach guided by swarm intelligence, has gained widespread adoption owing to its implementation simplicity and potential for global search. This paper analyzes several variants of PSO algorithms and introduces a new FS method called HPSO. The proposed approach utilizes an asynchronously adaptive inertia weight and an improved constriction factor. Additionally, it incorporates a chaotic map and a MAD fitness function with a feature count penalty to tackle the clustering FS problem. The efficiency of the developed method is evaluated against the genetic algorithm (GA) and well-known variants of PSO algorithms, including PSOs with fixed inertia weights, PSOs with improved inertia weights, PSOs with fixed constriction factors, PSOs with improved constriction factors, PSOs with adaptive inertia weights, and PSO's includes advanced learning exemplars and sophisticated structure topologies. This paper assesses two different reference text data sets, Reuters-21578 and Webkb. In comparison with competitive methods, the proposed HPSO method achieves higher clustering precision and selects a more informative feature set. [ABSTRACT FROM AUTHOR]

The location planning of relief distribution centres (DCs) is crucial in humanitarian logistics as it directly influences the disaster response and service to the affected victims. In light of the critical role of facility location in humanitarian logistics planning, the study proposes a two-stage relief distribution location problem. The first stage of the model determines the minimum number of relief DCs, and the second stage find the optimal location of these DCs to minimize the total cost. To address a more realistic situation, restrictions are imposed on the coverage area and capacity of each DCs. In addition, for optimally solving this complex NP-hard problem, a novel two-phase algorithm with exploration and exploitation phase is developed in the paper. The first phase of the algorithm i.e., exploration phase identifies a near-optimal solution while the second phase i.e. exploitation phase enhances the solution quality through a close circular proximity investigation. Furthermore, the comparative analysis of the proposed algorithm with other well-known algorithms such as genetic algorithm, pattern search, fmincon, multistart and hybrid heuristics is also reported and computationally tested from small to large data sets. The results reveal that the proposed two-phase algorithm is more efficient and effective when compared to the conventional metaheuristic methods. [ABSTRACT FROM AUTHOR]

Ultra-high-pressure (UHP) water jetting is commonly used to remove rust from ship hulls. However, few studies have been undertaken to optimize the topology of reaction rotating sprinklers (RRS) using UHP. This work proposes two contributions aimed at optimizing the RRS topology and maximizing the efficiency of rust removal. The first contribution is a novel accumulative impinging-duration model, which can accurately quantify the spiral trajectory density of multiple water jets and provide a practical means to evaluate the feasibility of RRS topology. The second contribution is the development of a new meta-heuristic algorithm called adaptive genetic algorithm (AGA), which offers high-quality solutions for the combinatorial topology optimization problem associated with RRS. The AGA converges significantly faster than the conventional genetic algorithm (CGA) and avoids being trappped at a local optimum. The effectiveness of the proposed topology optimization method is demonstrated through two case studies involving RRS with different model specifications. The AGA significantly increases the utilization ratio of water-jet energy by more than 50.6 %, outperforming CGA. The rust-removal efficiency of AGA-optimized RRS is theoretically predicted by analyzing the maximal translation speed and further validated through field experiments. Results show that the rust-removal efficiency of AGA-optimized RRS for ship hulls is greatly improved, with improvements of over 50 % and 43 % in theoretical and practical verification, respectively. This research introduces a unique quantization method and an efficient optimization algorithm for practical RRS design. [ABSTRACT FROM AUTHOR]

Substantial deterioration of surface water quality, mainly caused by human activities and climate change, makes the assessment of water quality a global priority. Thus, in this study, four metaheuristic algorithms, namely the particle swarm optimization (PSO), differential evolution (DE), ant colony optimization algorithm (ACOR), and genetic algorithm (GA), were employed to improve the performance of the adaptive neuro-fuzzy inference system (ANFIS) in the evaluation of surface water total dissolved solids (TDS). Monthly and annual TDS were considered as target variables in the analysis. In order to evaluate and compare the authenticity of the models, an economic factor (convergence time) and statistical indices of the coefficient of determination (R2), Kling Gupta efficiency (KGE), root mean squared error (RMSE), mean absolute error (MAE), and Nash-Sutcliff efficiency (NSE) were utilized. The results revealed that the hybrid methods used in this study could enhance the classical ANFIS performance in the analysis of the monthly and annual TDS of both stations. For more clarification, the models were ranked using the TOPSIS approach by simultaneously applying the effects of statistical parameters, temporal and spatial change factors, and convergence time. This approach significantly facilitated decision-making in ranking models. The ANFIS-ACOR annual model considering discharge had the best performance in the Vanyar Station; Furthermore, the ANFIS-ACOR monthly model ignoring discharge was outstanding in the Gotvand Station. In total, after utilizing two defined and proposed temporal and spatial change factors, the ANFIS-ACOR and ANFIS-DE hybrid models had the best and worst performance in TDS prediction, respectively. [ABSTRACT FROM AUTHOR]

In this study, the optimization of the location of oil production and injection wells, the number of production and injection wells, and the economic evaluation in the water injection process has been carried out using three algorithms: PSO, GA, and HGAPSO. Optimizing the oil extraction process by optimizing well locations, the optimal number of production and injection wells, and economic evaluation can improve the performance and efficiency of the process. In this study, the optimization of the water injection process into oil reservoirs using the PSO, GA, and HGAPSO algorithms has been addressed. Additionally, economic evaluation, considering costs and profits from oil production using the best-optimized parameters, has been conducted, and the best Net Present Value (NPV) has been calculated. Initially, the optimal well location problem is modeled, taking into account reservoir characteristics and geological conditions. Using the PSO and GA algorithms, the best well location and number of water injection wells have been obtained, leading to improved efficiency and cost reduction. Then, the GA algorithm is used to combine and modify viewpoints and optimize the number and location of wells. This algorithm explores optimal solutions in the well location space. Economic evaluation is performed using the best-optimized parameters by the algorithms. Costs of water injection, oil production costs, and profits from increased oil production are considered. By calculating the best Net Present Value (NPV), optimal decisions regarding the water injection process and enhancing the performance of oil reservoirs are made. Simulation results indicate that the GA algorithm outperforms other algorithms and can be used as a robust and effective method for optimizing well locations and the number of production and injection wells in the oil injection process. Ultimately, this study assists the oil industry in making better decisions about optimizing water injection and improving the efficiency and profitability of the process using the introduced optimization algorithms. [ABSTRACT FROM AUTHOR]

Traditional delivery route planning faces challenges in reducing logistics costs and improving customer satisfaction with growing customer demand and complex road traffic, especially in uncertain supply chain environment. To address these challenges, we introduce an innovative two-phase delivery route planning method integrating edge intelligence technology. The novelty of our approach lies in utilizing edge computing devices to monitor real-time changes in road conditions and dynamically adjust delivery routes, thereby providing an effective solution for efficient and flexible logistics. Initially, we construct a mixed-integer programming model that minimizes the total cost under constraints such as customer destinations and time windows. Subsequently, in the cloud-edge collaborative mode, edge computing devices are utilized to collect real-time road conditions and transmit it to the cloud server. The cloud server comprehensively considers customer demand and road condition changes and employs adaptive genetic algorithms and A-star algorithms to adjust the delivery routes dynamically. Finally, comprehensive experiments are conducted to validate the effectiveness of our method. The results demonstrate that our approach can promptly respond to changes in customer demands and road conditions and flexibly plan the optimal delivery routes, thereby significantly reducing overall costs and enhancing customer satisfaction. [ABSTRACT FROM AUTHOR]

The chimp optimization algorithm (ChOA) is a nature-inspired algorithm that imitates chimpanzees' individual intelligence and hunting behaviors. In this algorithm, the hunting process consists of four steps: driving, blocking, chasing, and attacking. Because of the novelty of ChOA, the steps of the hunting process have been modeled in the simplest possible way, leading to slow and premature convergence similar to other iterative algorithms. This paper proposes six spiral functions and introduces two novel hybrid spiral functions (SEB-ChOA) to rectify the abovementioned deficiencies. The SEB-ChOAs' performance is evaluated on 23 standard benchmarks, 20 benchmarks of IEEE CEC-2005, 10 cases of IEEE CEC06-2019 test-suite, and 12 constrained real-world engineering problems of IEEE CEC-2020. The SEB-ChOAs are compared with three groups of optimization algorithms, including Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) as the most well-known optimization algorithms, Slime Mould Algorithm (SMA), Marine Predators Algorithm (MPA), Ant Lion Optimization (ALO), Henry Gas Solubility Optimization (HGSO), as almost novel optimization algorithms, and jDE100 and DISHchain1e+12, as winners of IEEE CEC06-2019 competition, and also EBOwithCMAR and CIPDE as superior secondary optimization algorithms. The SEB-ChOAs reached the first rank among almost all benchmarks and demonstrated very competitive results compared to jDE100 and DISHchain1e+12 as the best-performing optimizers. Statistical evidence shows that the SEB-ChOA outperforms the PSO, GA, SMA, MPA, ALO, and HGSO optimizers while producing results comparable to those of the jDE100 and DISHchain1e+12 algorithms. [ABSTRACT FROM AUTHOR]

The index tracking problem consists of constructing a portfolio that has the closest performance of a given index as possible, with fewer assets in its composition. When considering a large number of assets, including all of them on the solution may incur high transaction fees, harming the accumulated returns in the long term. The constraint that limits the portfolio size imposes a combinatorial nature on the problem and the computation of the optimal solution becomes infeasible as the universe of assets grows. To get around this issue, pure and hybrid metaheuristics have been proposed in the literature to achieve good solutions in practical time. Different from pure metaheuristics, hybrid metaheuristics do not need any constraint handling or solution repairing approaches since they often use general-purpose solvers to adjust portfolio weights. This work presents a comparison between pure and hybrid genetic algorithms, which is one of the most popular heuristics applied in the portfolio selection field. We considered linear and nonlinear index tracking models in the experiments, where the GA that obtained the best performance in a single period optimization strategy, was selected to backtest in a dynamic index tracking approach. The results showed that hybrid GAs can compute good or even better solutions than the CPLEX solver and pure GAs, in a shorter time. [ABSTRACT FROM AUTHOR]

Designing effective PID controllers for gimbal payload systems (GPS) in naval applications poses inherent challenges due to the dynamic nature of these systems. The gimbal system requires precise control to stabilize its line of sight (LOS) for accurate target tracking in electro-optical systems. Conventional PID controllers often struggle to address the complex dynamics and nonlinearities inherent in gimbal systems, resulting in suboptimal performance. Therefore, in this study, we introduce a novel control design framework for the gimbal payload system (GPS) employed in naval applications. A more effective PID controller is developed by utilizing the hunting mechanism of the antlion optimization technique. This controller precisely manages and stabilizes the LOS of the GPS, ensuring seamless target tracking in electro-optical systems. Furthermore, we assess the robustness of the proposed controller by varying system parameters, including moment of inertia (± 20%) and motor resistance (+ 10%). The results demonstrate robust target tracking even in the presence of changes within the system. Additionally, the gimbal system exhibits zero overshoot, and the achieved high values of gain and phase margins outperform other techniques such as genetic algorithm, particle swarm optimization, and classical methods. [ABSTRACT FROM AUTHOR]

The Whale Optimisation Algorithm (WOA) is a meta-heuristic model inspired by the hunting behaviours of humpback whales. Similar to many other meta-heuristic models, e.g., Particle Swarm Optimisation (PSO), Artificial Bee Colony (ABC), and Ant Colony Optimisation (ACO), the WOA is susceptible to the issues of slow convergence and local optima. In this study, we address these short comings by first proposing an Enhanced WOA (EWOA) model for tackling single-objective optimisation. Specifically, EWOA integrates the WOA and Differential Evolution (DE). DE is a population-based algorithm that generates new candidate solutions by combining the existing ones, employing a simple yet robust formula. This amalgamation aids in generating diverse solutions during the exploration stage by utilising a non-linear coefficient vector, adaptive weight, and sub-population strategies. Furthermore, fast non-dominated sorting and crowding distance techniques from the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are incorporated into EWOA, resulting in a multi-objective EWOA (MOEWOA) model. We evaluate both EWOA and MOEWOA with a broad spectrum of benchmark functions. The results from 51 single-objective optimisation problems indicate the usefulness of EWOA in terms of a fast convergence rate and with increased performance. On the other hand, MOEWOA demonstrates a better convergence rate and an effective balance between convergence and diversity in 12 multi-objective optimisation problems. In addition, MOEWOA successfully solves 21 complex multi-objective constrained mechanical design problems, outperforming other compared algorithms at the 95% confidence level. The empirical outcomes of our study indicate the potential of EWOA and MOEWOA for undertaking complex, real-world optimisation problems. [ABSTRACT FROM AUTHOR]

Recently, there has been a growing interest in employing optimization techniques to ascertain the most efficient operation of reservoirs. This involves their application to various facets of the reservoir operating system, particularly in determining optimal rule curves. This study delves into the exploration of different algorithms, including Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Firefly Algorithm (FA), Invasive Weed Optimization (IWO), Teaching Learning-Based Optimization (TLBO), and Harmony Search (HS). Each algorithm was integrated into a reservoir simulation model, focusing on finding optimal rule curves for the Mujib reservoir in Jordan from 2004 to 2019. The primary objective was to evaluate the long-term impact of water shortages and excess releases on the Mujib reservoir. Furthermore, the study aimed to determine the effects of water demand management by reducing it by 10%, 20%, and 30%. The results revealed that the used algorithms effectively mitigated water shortages and excess releases compared to the current operational strategy. Notably, the Teaching Learning-Based Optimization (TLBO) algorithm yielded the most favorable outcomes, reducing the frequency and average of water shortages to 55.09% and 56.26%, respectively. Additionally, it curtailed the frequency and average of excess releases to 63.16% and 73.31%, respectively. [ABSTRACT FROM AUTHOR]

This paper aims to solve the Chinese Postman Problem (CPP) using an Ant Colony Optimization (ACO) algorithm. In graph theory, the CPP looks for the shortest closed path that visits every edge of a connected undirected graph. This problem has many applications, including route optimization, interactive system analysis, and flow design. Although numerous algorithms aimed at solving CPP are present in the literature, very few meta-heuristic algorithms are proposed, and no ACO applications have been proposed to solve them. This paper tries to fill this gap by presenting an ACO algorithm that solves CPP (ACO-CPP). To prove its consistency and effectiveness, ACO-CPP is compared with a Genetic Algorithm (GA) and a recursive algorithm throughout three experiments: (1) recursive-ACO-GA comparisons over randomly generated graphs for the attainment of the global optimum; (2) ACO-GA statistical comparisons over specifically generated graphs; (3) recursive-ACO-GA comparisons by changing ACO hyperparameters over randomly generated graphs for the attainment of the global optimum. The experiments prove that the ACO-CPP algorithm is efficient and exhibits a consistency similar to GA when the number of possible solutions to explore is relatively low. However, when that number greatly exceeds those explored, ACO outperforms GA. This suggests that ACO is more suitable for solving problems with a CPP structure. [ABSTRACT FROM AUTHOR]

In the real market, the item's demand is substantially affected by the item's selling price and frequency of advertising. This study focuses on an optimal ordering policy followed by advertising, pricing, and preservation policies. The present study incorporates the quantity-dependent ordering cost and time-dependent holding cost. A partial prepayment scheme is developed for inventory purchase decisions. The spoilage impact can be effectively reduced by an optimal investment in refrigeration. The optimal decision policy has been proposed by using three metaheuristic algorithms, namely particle swarm optimization, real-coded genetic algorithm, and differential evolution algorithm. A comparison is made for these metaheuristic schemes based on the numerical illustrations. The parameter sensitivity is performed to get insights of the variability in the indicators of the inventory model. [ABSTRACT FROM AUTHOR]

This paper introduces an innovative approach that significantly enhances the reliability indices of the radial distribution system, thereby effectively upgrading its overall performance. The optimal location and number of isolators in the electrical distribution network are determined using a metaheuristic algorithm, such as the genetic algorithm and particle swarm optimization approaches. The product of the system's annual outage length and the total number of consumers affected is used to frame the problem within the restrictions of the ideal number of switches and the need for a power supply that can meet consumer requests. The cost of energy not served (CENS) and system average interruption duration index (SAIDI) are reliability indicators that have been used to identify the root of the issue. The method has been put to the test on 59 and 34 load point systems, and the results demonstrate that the suggested method in the study is accepted. The GA and PSO are compared on 34 and 59 bus radial network and found that GA provide better result. The ENS and profit have been compared, and it is found GA provides superb result in both cases. It is also observed that the optimal number of isolators required in 59 bus system is 31 and 42 for GA and PSO, respectively. The application of the suggested technique for isolator placement in 59 bus radial network provides a reduction in SAIDI 45.6% and 43.97% from GA and PSO, respectively, it is also observed that reduction in ENS is 59.9% and 58.45% from GA and PSO, respectively. Diminution in ENS indicates that the final group of clients is happy with the quality of the service being rendered in their location. [ABSTRACT FROM AUTHOR]

Optimizing resource utilization and train scheduling is essential to satisfy passengers and reduce operating costs. This study develops the train schedule under scenario-oriented stochastic conditions. The proposed approach is a multi-objective mathematical-based mixed integer linear programming (MILP) approach; the objective is to minimize the average passenger expectation and the total number of train operation cycles. The non-dominated sorting genetic algorithm (NSGA-II) has been developed with multi-crossover and multi-mutation operators, then hybrid with simulating annealing (SA) operator (NSGA-II-SA). The model with four meta-heuristic algorithms has been technically analyzed. In a case study, the train schedule in the double-track rail network of the Tehran–Mashhad railway of Iran has been compared with the golden point. Experimental results show that a proposed approach can suitably fit the problem considering important metrics with an improvement of %7.34 and %6.89 for the average passenger waiting time and the total number of train operation cycles, respectively. [ABSTRACT FROM AUTHOR]

This study proposes a hybrid multi-objective meta-heuristics and possibilistic intuitionistic fuzzy c-means (PIFCM) algorithms for cluster analysis. The PIFCM algorithms combine Atanassov's intuitionistic fuzzy sets (IFSs) with possibilistic fuzzy c-means (PFCM) algorithms. In this study, three metaheuristic algorithms are used to improve the clustering results, specifically a genetic algorithm (GA), a particle swarm optimization (PSO) algorithm, and a gradient evolution (GE) algorithm. Therefore, three clustering algorithms are proposed, including multi-objective GA-based PIFCM (MOGA–PIFCM), multi-objective PSO-based PIFCM (MOPSO–PIFCM), and multi-objective GE-based PIFCM (MOGE–PIFCM). Their performance results are compared with those of other clustering algorithms, such as intuitionistic fuzzy c-means (IFCM) algorithm, possibilistic intuitionistic fuzzy c-means (PIFCM) algorithm, single-objective GA–PIFCM algorithm, single-objective PSO–PIFCM algorithm, and single-objective GE–PIFCM algorithm using 15 benchmark datasets. Adjusted Rand Index and accuracy measures are employed as performance indices for comparison. Experiment results shows that the MOGE–PIFCM obtains better solutions than the other clustering algorithms in terms of all performance validation indices. [ABSTRACT FROM AUTHOR]

Meta-heuristic algorithms distinguish themselves from conventional optimization methods owing to their intrinsic adaptability and straightforward implementation. Among them, the sine cosine algorithm (SCA) is lauded for its ability to transition seamlessly between exploration and exploitation phases throughout the optimization process. However, there exists potential for enhancing the balance that SCA maintains between exploration and exploitation. To augment the proficiency in global optimization of SCA, an innovative strategy—nSCA—that integrates the roulette wheel selection (RWS) with opposition-based learning was formulated. The robustness of nSCA was rigorously evaluated against leading-edge methods such as the genetic algorithm (GA), particle swarm optimization, moth-flame optimization, ant lion optimization, and multi-verse optimizer, as well as the foundational SCA. This evaluation included benchmarks set by both CEC 2019 and CEC 2021 test functions. Additionally, the performance of nSCA was confirmed through numerous practical optimization problems, emphasizing its effectiveness in applied settings. In all evaluations, nSCA consistently showcased superior performance compared to its evolutionary algorithm counterparts, delivering top-tier solutions for both benchmark functions and real-world optimization challenges. Given this compelling evidence, one can posit that nSCA serves as a strong candidate for addressing intricate optimization challenges found in real-world contexts, regardless of whether they are of a discrete or continuous nature. [ABSTRACT FROM AUTHOR]

Rapid technological advances have made daily life easier and more convenient in recent years. As an emerging technology, the Internet of Things (IoT) facilitates interactions between physical devices. With the advent of sensors and features on everyday items, they have become intelligent entities able to perform multiple functions as services. IoT enables routine activities to become more intelligent, deeper communication, and processes more efficient. In the dynamic landscape of the IoT, effective service discovery is key to optimizing user experiences. A Quality of Service (QoS)-aware service discovery technique is proposed in this paper to address this challenge. Through whale optimization and genetic algorithms, our method aims to streamline decision-making processes in IoT service selection. The bio-inspired optimization techniques employed in our approach facilitate the discovery of services more efficiently than traditional methods. Our results demonstrate superior performance regarding reduced data access time, optimized energy utilization, and cost-effectiveness through comprehensive simulations. [ABSTRACT FROM AUTHOR]

In the field of post-quantum security, isogeny-based cryptography stands out for its ability to fight quantum attacks. One of the key operations in isogeny-based schemes is finite field multiplication, which plays a crucial role in cryptographic protocols such as key exchange and digital signatures. To ensure practical implementations of these schemes, efficient finite field multiplication is essential. In this research, a novel optimization approach, the Crossover-Boosted Water Cycle Algorithm (CB-WCA), to enhance the efficiency of finite field multiplication in isogeny-based cryptography is proposed. By using both the WCA and a crossover method inspired by genetic algorithms, the CB-WCA effectively explores solution areas, aiming for the best solutions. The formulation of the finite field multiplication optimization problem and an objective function that quantifies the efficiency of the multiplication process based on computational cost is presented and defined. The CB-WCA is then applied to find the optimal set of parameters for finite field multiplication algorithms. Extensive experimental evaluations are conducted, comparing the performance of the CB-WCA-optimized algorithms with traditional optimization methods and other metaheuristic algorithms. Through the findings, it is evident that the CB-WCA stands out for its ability to achieve faster execution times and decrease computational costs. Furthermore, the optimized finite field multiplication algorithms are integrated into isogeny-based cryptographic schemes and evaluate their impact on cryptographic protocol efficiency and security. Real-world implementations showcase the practical applicability of the optimized algorithms in hardware and software environments. To ensure the security of the optimized algorithms, rigorous cryptanalysis is performed to verify their resilience against potential attacks, ensuring they meet the highest standards of security. [ABSTRACT FROM AUTHOR]

In this paper we study the performance of a two-stage approach to scheduling under uncertainty making use of sequences of groups of permutable operations. Given a sample set of uncertainty realization scenarios, the goal is to compute a sequence of groups of permutable operations representing a partial scheduling decision in the first-stage, that yields the best possible score in the second-stage, when, for a specific scenario, a full operation sequence is obtained via a second-stage decision policy. This approach is described for a single-machine problem and the jobshop problem with stochastic and robust optimization, as well as several commonly studied objectives. We propose new constraint programming models as well as a genetic algorithm meta-heuristic to compute such two-stage solutions. We also investigate a warm-start scheme to work around the difficult search space of sequences of permutable operations. Experiments are carried out to characterize when this two-stage approach yields better results. We also compare the introduced methods with existing ones. Theoretical extensions of the known methods are also described and evaluated. [ABSTRACT FROM AUTHOR]

This paper addresses an integrated material flow optimization problem of cross-docking satellites, in which the transportation problem, the truck-door assignment problem with material placement plans, and the two-dimensional truck loading problem are taken into account. The study aims to find the best distribution and operational plans for the cross-docking satellites to minimize the total transportation cost of the materials. To solve the considered problem, a hybrid genetic algorithm (HGA) is developed, which integrates simulated annealing (SA) algorithm within a genetic algorithm (GA). In this way, a new individual with a low solution quality is rejected by using the stochastic solution acceptance feature of the SA. Moreover, the HGA is enhanced with an advanced two-dimensional loading-check procedure and a rule-based material placement procedure to obtain efficient solutions. The proposed loading-check procedure reduces the processing time of the HGA by avoiding duplicate examinations for the truck loading plans. Likewise, the rule-based material placement procedure prevents unnecessary searches for the assignment plans of the products in a temporary storage area. In computational studies, the performance of the HGA is tested on two different problem sets by comparing HGA with the SA and GA. Furthermore, the HGA is applied to a problem set that is formed by using real-life data of a logistics company. The computational results show that the HGA introduces effective solutions and outperforms both the SA and GA. In addition, the results of the real-life application denote that the HGA can be employed to find effective material flow plans in real situations of cross-docking operations. [ABSTRACT FROM AUTHOR]

Due to the complex nature of processing units and the variability in raw oil properties, traditional first-principle methods are not always effective in predicting the output of these units without adapting them. Data-driven models have become popular alternatives because they are more adaptable to the variability in processing units, especially when large amounts of data are available. Feature selection is a crucial aspect of data-driven modeling, especially for processing units. It involves identifying and selecting the most important variables influencing the unit's output. The selected variables are then used as inputs to the model, which helps to reduce noise and improve model accuracy. Accordingly, this article presents a hybrid method that combines feature selection with data-driven modeling to create an accurate model for predicting the output of a Residue Fluid Catalytic Cracking (RFCC) process unit. The Metaheuristic Ant Colony Optimizer (MACO) algorithm was used to extract the best subset of features from the collected data, which were then used with the Artificial Immune Genetic Algorithm with Local Vaccination (AIGA-LV) method to select the optimal features. Finally, the Random Forest (RF) method was used to predict the products of the RFCC process unit. The data were collected from a refinery plant in central Iran for nine months. The proposed model was efficient in feature selection and flexible in handling different scenarios and products. It improved the accuracy to 99.17% at its best and improved the primary model by 3–20%. Therefore, this method could be useful for predicting the output of various industrial processes, especially the RFCC and FCC process units. [ABSTRACT FROM AUTHOR]

Batteries are widely used for energy storage in stand-alone PV systems. However, both PV modules and batteries exhibit nonlinear behavior. Therefore, battery modeling is an essential step toward appropriate battery control and overall PV system management. Empirical models remain reliable for lead-acid batteries, especially the Copetti model, which describes many inner and outer battery phenomena, including temperature dependency. However, the parameters of the Copetti model require further adjustment to increase its ability to accurately represent battery behavior. Recently, metaheuristic algorithms have been employed for parameter identification, especially hybrid algorithms that combine the advantages of two or more algorithms. This paper proposes an enhanced battery model based on the Copetti model. The parameter identification of the enhanced model has been carried out using a novel hybrid PSO-GA algorithm (HPGA). The hybrid algorithm combines GA and PSO in a cascade configuration, with GA as the master algorithm. The HPGA algorithm has been compared with other algorithms, namely GA, PSO, ABC, COA, and a hybrid GWO-COA, to reveal its advantages and disadvantages. The NRMSE is used to evaluate algorithms in terms of tracking speed and efficiency. HPGA shows an improvement in tracking efficiency compared to GA and PSO. The proposed model is validated on several charging-discharging data and exhibits a 15% lower mean error compared to the Copetti model with original parameters. Additionally, the proposed model demonstrates a lower mean error of 0.16% compared to other models in the literature with a 0.36% mean error at least. [ABSTRACT FROM AUTHOR]

High spatial resolution is one of the most important factors in increasing image quality, but it increases the amount of storage memory. On the other hand, in the field of face image compression research, one of the existing challenges is maintaining the image recognition rate. Therefore, it would be very desirable to propose a method that does not reduce the minimum detection rate. This paper examines how to compress face images with high spatial resolution based on meta-heuristic algorithms. In such a way that the images are divided into the same blocks and the task of identifying the important blocks is the responsibility of meta-heuristic algorithms. The fitting function in this condition is to achieve the maximum value of image recognition accuracy. In the simulation and evaluation section, face images of CIE and FEI databases have been investigated as a selective study. The simulation results show the significant effect of the proposed methods using meta-heuristic algorithms in increasing the quality of PSNR and SSIM compared to the detection efficiency. The recognition accuracy of face images shows 1.25% more than the condition without compression for the gray wolf meta-heuristic algorithm. According to the proposed method, the larger the block division value, the better the average PSNR and SSIM. In general, depending upon the application of the problem, there is a trade-off to achieve the highest average PSNR or SSIM using genetic, whale, or gray wolf algorithms. However, the gray wolf algorithm reaches its optimal answer much faster than the genetic and whale algorithms. [ABSTRACT FROM AUTHOR]

For valuable areas of a face image (such as the eyes, nose, and mouth) that contain detailed facial information, a higher bit rate may be assigned. If we can identify areas in an image that are of low importance, we can remove redundant information to an acceptable level. Meta-heuristic algorithms are capable of solving high-dimensional problems in the shortest time by finding the best answer among all possible solutions. In this article, meta-heuristic algorithms based on the curvelet transform are used to compress face images with high spatial resolution. Genetic algorithms, whales, gray wolves, and honey badgers are responsible for identifying these edges and important areas. In order to achieve maximum recognition accuracy, average PSNR and SSIM, the bit string lengths of each block are arranged to achieve the appropriate objective function estimation. As a case study, images from the FEI database are used. The performance of the curvelet transform method in evaluating the average PSNR and SSIM in this research shows significantly better performance when compared to the wavelet transform method when using the same meta-heuristic algorithms for the recognition accuracy values in the same conditions (equal recognition accuracy). As can be seen from the graph, the Whale optimization algorithm (WOA) has achieved the optimal response in most bit rates with a faster processing speed than most other algorithms. Evaluation of the results indicates that the curvelet transform method performs better in terms of extracting and displaying important details in the edges of the face image compared to the wavelet transform method. [ABSTRACT FROM AUTHOR]

In the field of data processing and IoT communication it is possible to develop more robust solutions by combining quantum algorithms with metaheuristics. Said solutions can be applied in the industry and be measured using metrics associated with complexity, efficiency, processing, and accuracy. An extensive bibliographical review is carried out to determine which is the most efficient and effective hybrid algorithm that can be applied to a real experimental case, which aims to improve communication to reduce occupational risks. Criteria, metrics, and experimental results were obtained, in which it is shown that the quantum genetic algorithm is better than the genetic algorithm. A detailed discussion on the objective function, the convergence to the global optimum, and the need to improve the obtained solutions is given. The conclusions raise new aspects that need investigation. [ABSTRACT FROM AUTHOR]

The accuracy in analysis of wind speed is very critical to assess wind potential at any site. Wind power potential has been estimated using statistical distribution methods at numerous places around the world. The main aim of this article is to analyse wind potential and to compare between metaheuristic optimization algorithms and numerical approaches utilising the wind data at various places in India measured from masts and remote sensing technologies. The Weibull distribution fitness test is calculated using real-time wind data from various locations. The optimal Weibull parameters are estimated using numerical methods such as empirical method of Justus, maximum likelihood method, graphical method, modified maximum likelihood method and Wind Atlas Analysis and Application Program (WAsP). Furthermore, to assess Weibull distribution function for different sites (onshore, nearshore and offshore) in India, the social spider optimization is compared to particle swarm optimization and genetic algorithm. To examine the accuracy of various approaches, further goodness-of-fit method is estimated. The mean power density is maximum for offshore, followed by nearshore and onshore site with 452.32 W/m2, 431.53 W/m2, and 283 W/m2, respectively, at 120 m height. WAsP approach outperforms other numerical approaches used in this work. When compared to the genetic algorithm, the social spider optimization and particle swarm optimization were shown to be more efficient. The suggested method is more accurate than the numerical approaches utilised for wind potential assessment, according to the results. [ABSTRACT FROM AUTHOR]

In the family traveling salesman problem (FTSP), there is a set of cities which are divided into a number of clusters called families. The salesman has to find a shortest possible tour visiting a specific number of cities from each of the families without any restriction of visiting one family before starting the visit of another one. In this work, the general concept of the Partial OPtimization Metaheuristic Under Special Intensification Conditions is linked with the exact optimization by a classical solver using a mathematical programming formulation for the FTSP to develop a matheuristic. Moreover, a genetic and a simulated annealing algorithm are used as metaheuristics embedded in the approach. The method is examined on a set of benchmark instances and its performance is favorably compared with a state-of-the-art approach from literature. Moreover, a careful analysis of the specific components of the approach is undertaken to provide insights into the impact of their interplay. [ABSTRACT FROM AUTHOR]

Facility location models involve identifying locations for facilities that provide services to the customers which are also called demand points. The p-median problem is a facility location problem which deals with locating p facilities in such a way that the sumtotal of demand-weighted distances between each demand point and its respective closest facility is minimized. The p-median problem does not take into account the possibility of failure of the facilities, but rather considers that the facilities once located will always be available to serve the customers or demand points. But, in reality, some of the facilities may face unpredicted disruptions, thereby forcing the customers to seek services from other functioning facilities. The reliability p-median problem (RpMP) concerns with locating facilities which minimize the cost while considering the cost of facility failures. In this paper, we have proposed a hyper-heuristic approach with naive Bayes classifier for the RpMP and compared its performance on standard benchmark instances with two best performing approaches for RpMP, viz. a genetic algorithm and a scatter search approach available in the literature. The results show the effectiveness of our approach in terms of the solution quality. [ABSTRACT FROM AUTHOR]

Genetic Algorithm (GA) is a widely used metaheuristic for addressing challenging optimization problems. Selecting suitable settings for GA parameters can lead to a considerable improvement in its performance, but this is often difficult due to the larger number of alternatives available and variable performance depending on the problem solved. Furthermore, consideration of multiple performance criteria in parameter selection adds an additional layer of complexity. Therefore, practitioners often rely on their previous experiences or perform trial-and-error experiments when determining suitable parameter settings. In this study, we define the problem of finding suitable settings for GAs as a bi-objective optimization problem with an aim to find efficient settings that will maximize the approximation quality and minimize the run time of the GA. We conduct an empirical study on a GA that solves Traveling Salesperson Problem (TSP). Two evolutionary algorithms are utilized in a nested manner to address the bi-objective parameter setting problem: a GA to solve the TSP instances and a multi-objective evolutionary algorithm to find the bi-objective efficient settings of the GA. We find efficient settings for each instance through an empirical study with 31 TSP instances and identify settings that perform well regardless of the instance solved. The results provide valuable insights into the behavior of efficient settings, demonstrating that some operators and parameters are robust to changes in problem size, while others require adjustment. [ABSTRACT FROM AUTHOR]

The Internet of Robotic Things (IoRT) is an integration between autonomous robots and the Internet of Things (IoT) based on smart connectivity. It's critical to have intelligent connectivity and excellent communication for IoRT integration with digital platforms in order to maintain real-time engagement based on efficient consumer power in new-generation IoRT apps. The proposed model will be utilized to determine the optimal way of task offloading for IoRT devices for reducing the amount of energy consumed in IoRT environment and achieving the task deadline constraints. The approach is implemented based on fog computing to reduce the communication overhead between edge devices and the cloud. To validate the efficacy of the proposed schema, an extensive statistical simulation was conducted and compared to other related works. The proposed schema is evaluated against the Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Whale Optimization Algorithm (WOA), Artificial Bee Colony (ABC), Ant Lion Optimizer (ALO), Grey Wolf Optimizer (GWO), and Salp Swarm Algorithm to confirm its effectiveness. After 200 iterations, our proposed schema was found to be the most effective in reducing energy, achieving a reduction of 22.85%. This was followed closely by GA and ABC, which achieved reductions of 21.5%. ALO, WOA, PSO, and GWO were found to be less effective, achieving energy reductions of 19.94%, 17.21%, 16.35%, and 11.71%, respectively. The current analytical results prove the effectiveness of the suggested energy consumption optimization strategy. The experimental findings demonstrate that the suggested schema reduces the energy consumption of task requests more effectively than the current technological advances. [ABSTRACT FROM AUTHOR]

This study explores the applicability of the metaheuristic algorithm for calculating the building period. Firefly algorithm (FA) employing the feed-forward (FF) model is applied to an existing period dataset of several wood buildings, whose motions were recorded at ambient conditions. The composition of the considered artificial neural network (ANN) is optimized employing the firefly algorithm, and the fixed weights are determined with the least error for the model. The model's precision is evaluated by comparing the results with the multiple linear regression (MLR) model, the ANN model combined with the genetic algorithm (GA-ANN), particle swarm optimization algorithm (PSO-ANN), and the models existing in building code. The results are also compared with the models presented in the literature for the period estimate required for the seismic design of wood buildings. The paper concludes that the proposed informational model can predict the fundamental period of light-frame wood buildings more accurately than the other available models. [ABSTRACT FROM AUTHOR]

Meta-heuristics have been successfully applied to many complex optimization problems. One of the main reasons for its success is its ability to handle non-convex, nonlinear, multimodal, multi-variable, and multi-objective problems with easy implementation. However, the quality of the response of these algorithms to an optimization problem is highly susceptible to the control parameters, and few works aim to tune them or find tools that can improve the algorithms. The literature is rich in proposals for new algorithms, but not for improving existing ones. This paper presents different strategies for tuning and accelerating meta-heuristics using the first hybrid algorithm in the literature. The Lichtenberg algorithm is inspired by lightning and Lichtenberg figures and has been increasingly successfully applied to various optimization problems. However, a study of its best parameters has never been presented until now. After a discussion of the best tuning tools, its tuning parameters are performed using response surface methodology. Then, 14 versions are studied through 10 test functions using chaos theory and Lévy flights scenarios. After 13,500 simulations, the chaotic Lichtenberg algorithm equipped with the piecewise function and tuned parameters proved the best version with only 16% similarity to the original algorithm. Then, it was compared to the genetic algorithm, particle swarm optimization, gray wolf optimizer, salp swarm optimization, whale optimization algorithm, and dragonfly algorithm. The proposed algorithm had both the best average accuracy, lower computational cost, and the smallest standard deviation. [ABSTRACT FROM AUTHOR]

Nowadays time series clustering is of great importance in manufacturing industries. Meanwhile, it is considerably challenging to achieve explainable solution as well as significant performance due to computation complexity and variable diversity. To efficaciously handle the difficulty, this paper presents a novel metaheuristic-based time series clustering method which can improve the effectiveness and logicality of existing clustering approaches. The proposed method collects candidate cluster references from hierarchical and partitional clustering through shape-based distance measure as well as dynamic time warping (DTW) on manufacturing time series data. By applying metaheuristics highlighting estimation of distribution algorithms (EDA), such as extended compact genetic algorithm (ECGA), on the collected candidate clusters, advanced cluster centroid combinations with minimal distances can be achieved. ECGA employs the least complicated and the most closely related probabilistic model structure regarding population space during generation cycle. This feature strengthens the comprehension of clustering results in how such optimal solutions were achieved. The proposed method was tested on real-world time series data, open to the public, from manufacturing industry, and showed noticeable performances compared to well-established methods. Accordingly, this paper demonstrates that obtaining both comprehensible result as well as prominent performance is feasible by employing metaheuristic techniques to time series data clustering methods. [ABSTRACT FROM AUTHOR]

Linear-B cell epitopes (LBCE) play a vital role in vaccine design; thus, efficiently detecting them from protein sequences is of primary importance. These epitopes consist of amino acids arranged in continuous or discontinuous patterns. Vaccines employ attenuated viruses and purified antigens. LBCE stimulate humoral immunity in the body, where B and T cells target circulating infections. To predict LBCE, the underlying protein sequences undergo a process of feature extraction, feature selection, and classification. Various system models have been proposed for this purpose, but their classification accuracy is only moderate. In order to enhance the accuracy of LBCE classification, this paper presents a novel 2-step metaheuristic variant-feature selection method that combines a linear support vector classifier (LSVC) with a Modified Genetic Algorithm (MGA). The feature selection model employs mono-peptide, dipeptide, and tripeptide features, focusing on the most diverse ones. These selected features are fed into a machine learning (ML)-based parallel ensemble classifier. The ensemble classifier combines correctly classified instances from various classifiers, including k-Nearest Neighbor (kNN), random forest (RF), logistic regression (LR), and support vector machine (SVM). The ensemble classifier came up with an impressively high accuracy of 99.3% as a result of its work. This accuracy is superior to the most recent models that are considered to be state-of-the-art for linear B-cell classification. As a direct consequence of this, the entire system model can now be utilised effectively in real-time clinical settings. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to develop and test three meta-heuristic algorithms to solve large size multi-objective supply chain network design problems. The algorithms are based on tabu search, genetic algorithm, and simulated annealing to find near-optimal global solutions. The three algorithms are designed, coded, and tested, and their parameters are fine tuned. The exact ε-constraint algorithm embedded in the General Algebraic Modeling System is used to validate the results of the three algorithms. The algorithms are compared using a typical multi-objective supply chain model utilizing several performance measures. The measures include the mean ideal distance, diversification metric, and percent of domination, inverted generational distance, and computation time. The results show that the tabu search algorithm outperformed the other two algorithms in terms of the percent of domination and computation time. On the other hand, the simulated annealing solutions are the best in terms of their diversity. The work in this paper is expected to help managers to solve large-scale supply chain problems that arise in oil and gas, petrochemical, and food supply chains. [ABSTRACT FROM AUTHOR]

In this article, a solution is proposed through a population-based metaheuristic for the Two-level Hub Location Routing Problem with Directed Tours (THLRP-DT). Hubs are facilities used to handle and dispatch resources on a given network. The goal of the THLRP-DT is to locate a set of hubs on a network and to route resources from sources to destinations, where the hubs are connected by means of an oriented cycle, and the spokes form clusters. Each cluster is composed of a unique hub, including none or some spoke nodes, connected in an oriented cycle structure. This problem appears in transportation logistics, where the flow of demands can be aggregated, resulting in economies of scale, and the orientations of arcs model a one way flow direction, which speeds up the distribution. We propose a Biased Random-Key Genetic Algorithm (BRKGA) metaheuristic, where the parameters have been calibrated using a machine learning package, which makes use of a machine learning mechanism. The results obtained using the BRKGA metaheuristic are of high quality compared to the ones found in the literature, improving solutions for instances with unknown optimal values. [ABSTRACT FROM AUTHOR]

This paper investigates a wireless blockchain network with mobile edge computing in which Internet of Things (IoT) devices can behave as blockchain users (BUs). This blockchain network's ultimate goal is to increase the overall profits of all BUs. Because not all BUs join in the mining process, using traditional swarm and evolution algorithms to solve this problem results in a high level of redundancy in the search space. To solve this problem, a modified chaotic Henry single gas solubility optimization algorithm, called CHSGSO, has been proposed. In CHSGSO, the allocation of resources to BUs who decide to engage in mining as an individual is encoded. This results in a different size for each individual in the entire population, which leads to the elimination of unnecessary search space regions. Because the individual size equals the number of participating BUs, we devise an adaptive strategy to fine-tune each individual size. In addition, a chaotic map was incorporated into the original Henry gas solubility optimization to improve resource allocation and accelerate the convergence rate. Extensive experiments on a set of instances were carried out to validate the superiority of the proposed CHSGSO. Its efficiency is demonstrated by comparing it to four well-known meta-heuristic algorithms. [ABSTRACT FROM AUTHOR]