Evolutionary Techniques Research Articles

Unsupervised learning analysis on the proteomes of Zika virus

Background The Zika virus (ZIKV), which is transmitted by mosquito vectors to nonhuman primates and humans, causes devastating outbreaks in the poorest tropical regions of the world. Molecular epidemiology, supported by clustering phylogenetic gold standard studies using sequence data, has provided valuable information for tracking and controlling the spread of ZIKV. Unsupervised learning (UL), a form of machine learning algorithm, can be applied on the datasets without the need of known information for training. Methods In this work, unsupervised Random Forest (URF), followed by the application of dimensional reduction algorithms such as principal component analysis (PCA), Uniform Manifold Approximation and Projection (UMAP), t-distributed stochastic neighbor embedding (t-SNE), and autoencoders were used to uncover hidden patterns from polymorphic amino acid sites extracted on the proteome ZIKV multi-alignments, without the need of an underlying evolutionary model. Results The four UL algorithms revealed specific host and geographical clustering patterns for ZIKV. Among the four dimensionality reduction (DR) algorithms, the performance was better for UMAP. The four algorithms allowed the identification of imported viruses for specific geographical clusters. The UL dimension coordinates showed a significant correlation with phylogenetic tree branch lengths and significant phylogenetic dependence in Abouheif’s Cmean and Pagel’s Lambda tests (p value < 0.01) that showed comparable performance with the phylogenetic method. This analytical strategy was generalizable to an external large dengue type 2 dataset. Conclusion These UL algorithms could be practical evolutionary analytical techniques to track the dispersal of viral pathogens.

Marine predator’s algorithm-based linear and elliptical antenna array design for 5G communication

The highly efficient linear and elliptical antenna array design presented in this article is intended to synthesize far-field radiation patterns for 5G communication. The objective is to achieve the best possible radiation pattern, which includes a lower side lobe level (SLL) and a narrower half-power beam width (HPBW). A low SLL is crucial to minimize intervention in the entire side lobe region, whereas long-distance communication requires a low HPBW. The marine predator’s algorithm (MPA) is used here to determine the optimal feeding currents to each array element to reduce the SLL and HPBW values. Two linear antenna array (LAA) design examples and the three elliptical antenna array (EAA) design examples are discussed in this article which are achieved using the optimal current excitations to each array element. Two well-established evolutionary optimization techniques, namely the genetic algorithm (GA) and the differential evolution (DE) technique, are also employed for comparison to demonstrate the superiority of the MPA optimization-based technique. The results achieved utilizing the MPA show the improvement of SLL contraction compared to the uniform antenna array and the methods affirmed in the recently published article.

Evolutionary optimization technique to minimize energy consumption for dry turning operation processes

Evolutionary optimization technique to minimize energy consumption for dry turning operation processes

Using Artificial Neural Networks to Solve the Gross–Pitaevskii Equation

The current work proposes the incorporation of an artificial neural network to solve the Gross–Pitaevskii equation (GPE) efficiently, using a few realistic external potentials. With the assistance of neural networks, a model is formed that is capable of solving this equation. The adaptation of the parameters for the constructed model is performed using some evolutionary techniques, such as genetic algorithms and particle swarm optimization. The proposed model is used to solve the GPE for the linear case (γ=0) and the nonlinear case (γ≠0), where γ is the nonlinearity parameter in GPE. The results are close to the reported results regarding the behavior and the amplitudes of the wavefunctions.

Improved Bald Eagle Search Optimization Algorithm for the Inverse Kinematics of Robotic Manipulators.

The inverse kinematics of robotic manipulators involves determining an appropriate joint configuration to achieve a specified end-effector position. This problem is challenging because the inverse kinematics of manipulators are highly nonlinear and complexly coupled. To address this challenge, the bald eagle search optimization algorithm is introduced. This algorithm combines the advantages of evolutionary and swarm techniques, making it more effective at solving nonlinear problems and improving search efficiency. Due to the tendency of the algorithm to fall into local optima, the Lévy flight strategy is introduced to enhance its performance. This strategy adopts a heavy-tailed distribution to generate long-distance jumps, thereby preventing the algorithm from becoming trapped in local optima and enhancing its global search efficiency. The experiments first evaluated the accuracy and robustness of the proposed algorithm based on the inverse kinematics problem of manipulators, achieving a solution accuracy of up to 10-18 m. Subsequently, the proposed algorithm was compared with other algorithms using the CEC2017 test functions. The results showed that the improved algorithm significantly outperformed the original in accuracy, convergence speed, and stability. Specifically, it achieved over 70% improvement in both standard deviation and mean for several test functions, demonstrating the effectiveness of the Lévy flight strategy in enhancing global search capabilities. Furthermore, the practicality of the proposed algorithm was verified through two real engineering optimization problems.

Refining the Eel and Grouper Optimizer with Intelligent Modifications for Global Optimization

Global optimization is used in many practical and scientific problems. For this reason, various computational techniques have been developed. Particularly important are the evolutionary techniques, which simulate natural phenomena with the aim of detecting the global minimum in complex problems. A new evolutionary method is the Eel and Grouper Optimization (EGO) algorithm, inspired by the symbiotic relationship and foraging strategy of eels and groupers in marine ecosystems. In the present work, a series of improvements are proposed that aim both at the efficiency of the algorithm to discover the total minimum of multidimensional functions and at the reduction in the required execution time through the effective reduction in the number of functional evaluations. These modifications include the incorporation of a stochastic termination technique as well as an improvement sampling technique. The proposed modifications are tested on multidimensional functions available from the relevant literature and compared with other evolutionary methods.

Enhancing network robustness with structural prior and evolutionary techniques

Robustness optimization in complex networks is a critical research area due to its implications for the reliability and stability of various systems. However, existing algorithms encounter two key challenges: the lack of integration of prior network knowledge, leading to suboptimal solutions, and high computational costs, which hinder their practical application. To address these challenges, this paper introduces Eff-R-Net, an efficient evolutionary algorithm framework aimed at enhancing the robustness of complex networks through accelerated evolution. Eff-R-Net leverages global and local network information, featuring a novel three-part composite crossover operator. Prior network knowledge is incorporated in mutation and local search operators to expedite the construction of networks with superior robustness. Additionally, a simplified method for calculating robustness enhances efficiency, while adaptive hyper-parameters dynamically adjust operators execution probabilities for optimal evolution. Extensive evaluations on both synthetic (Scale-Free, Erdös-Rényi, and Small-World) and three infrastructure real-world networks demonstrate the superiority of Eff-R-Net. The algorithm improves robustness by 12.8% and reduces computational time by 25.4% compared to state-of-the-art algorithm in real-world network experiments. These findings underscore Eff-R-Net's versatility and potential in enhancing network robustness across different domains.

Particle swarm optimization for performance enhancement of cadmium telluride thin film solar cells by embedded nano-grating structures with a plasmonic metal coating layer

As the demand for energy in world is increasing rapidly and there is pursuit for renewable energy sources which is cheap, easy to generate and requires low maintenance, solar energy is a top contender. The world is in dire need of photovoltaic solar cells that can aid in keeping up with the hiking energy demands. However, thin film solar cells (TFSCs) which are developed for cost effectivity, suffer in performance due to reduced thickness. Therefore, this computational study uses Finite-Difference Time-Domain (FDTD) and delves into the scope of using a 1-D nano-grating structure embedded into absorbing layer of cadmium telluride TFSC to enhance the optoelectronic performance. A unique nano-grating structure with SiO2 at its core and aluminium coating aims to enhance the performance of CdTe TFSC with cost effectivity and ease of fabricability as the main motifs. Additionally, an evolutionary computational technique, Particle Swarm Optimization (PSO), was used to determine the optimal parameters of nano-gratings on CdTe TFSCs, i.e., nano-grating height, angle, duty cycle, aluminium coating thickness and grating substrate thickness. The PSO algorithm resulted in a nano-grating structure that yielded an efficiency increase of 52.86% and increase in short-circuit current density of 25.45% with respect to bare CdTe TFSCs. Subsequently, the performance of the optimal nano-grating structure was also observed to be insensitive to variation of wide range of incidence angle of light, a key feature preferred for versatile application of TFSCs.

Effect of multi-unit and multi-type DG installation using integrated optimization technique in distribution power system planning

With the rise in load demand, improving the voltage profile and reducing line loss is vital to ensure reliable power delivery to the customer. However, increasing power plant generation capacity is limited by environmental and economic factors, requiring a careful assessment of locally optimal options. Distributed Generation (DG) installation into the electricity grid is one of the reliable remedial actions to ensure a smooth power delivery. Installation of DG requires an optimization process to identify the appropriate placement and sizing. Inaccurate sizing and placement of the DG installation may result to over-compensation or under-compensation phenomena. This paper proposes a novel approach termed the Integrated Immune Moth Flame Evolutionary Programming technique (IIMFEP) for optimizing the installation of DG sources in distribution systems. It handles various scenarios, including multi-DG single-type and multi-DG multi-type installations, with the main objective of minimizing power loss in the system. This technique employs a hybrid approach that combines elements of immune algorithms, moth flame optimization, and evolutionary programming to achieve more accurate and efficient results. Two cases were considered in this study termed Case 1 and Case 2. Results in Case 1 discovered that the optimal sizing and placement of four Type III DGs exhibit the lowest power loss worth 2.74 kW (98.78 % reduction) for the 69-Bus RDS, while for the 118-Bus RDS the power loss is 319.89 kW (75.36 % reduction). In Case Study 2, the combination of DG Types I and III provided the highest power loss reduction. With one DG Type I and two DG Type III units installed, power loss was reduced by 97.15 % to 6.41 kW for the 69-Bus RDS and by 62.01 % to 493.21 kW for the 118-Bus RDS. The proposed IIMFEP managed to alleviate the setback experienced in the traditional EP, AIS and MFO which found to be stuck at local optimum. The IIMFEP method is compared to Moth Flame Optimization, Artificial Immune System and Evolutionary Programming and validated using the IEEE 69-Bus and 118-Bus Radial Distribution Systems, resulting in outstanding performance.

Genetic Algorithm-Based Data-Driven Process Selection System for Additive Manufacturing in Industry 4.0.

Additive manufacturing (AM) has impacted the manufacturing of complex three-dimensional objects in multiple materials for a wide array of applications. However, additive manufacturing, as an upcoming field, lacks automated and specific design rules for different AM processes. Moreover, the selection of specific AM processes for different geometries requires expert knowledge, which is difficult to replicate. An automated and data-driven system is needed that can capture the AM expert knowledge base and apply it to 3D-printed parts to avoid manufacturability issues. This research aims to develop a data-driven system for AM process selection within the design for additive manufacturing (DFAM) framework for Industry 4.0. A Genetic and Evolutionary Feature Weighting technique was optimized using 3D CAD data as an input to identify the optimal AM technique based on several requirements and constraints. A two-stage model was developed wherein the stage 1 model displayed average accuracies of 70% and the stage 2 model showed higher average accuracies of up to 97.33% based on quantitative feature labeling and augmentation of the datasets. The steady-state genetic algorithm (SSGA) was determined to be the most effective algorithm after benchmarking against estimation of distribution algorithm (EDA) and particle swarm optimization (PSO) algorithms, respectively. The output of this system leads to the identification of optimal AM processes for manufacturing 3D objects. This paper presents an automated design for an additive manufacturing system that is accurate and can be extended to other 3D-printing processes.

A Two-Stage Robust Optimization for Reliable Logistics Network Design via Evolutionary Computation

This paper presents a novel two-stage robust optimization model for designing a dependable logistics network that integrates evolutionary computation techniques. The proposed model considers both the normal and disrupted states of the logistics network and seeks to reduce the overall network cost and operating time in different disruption situations. The challenge is a multi-objective optimization problem addressed using a hybrid evolutionary method that combines the advantages of the non-dominated sorting genetic algorithm with the large neighborhood search heuristic. Numerical experiments are conducted on various test instances to demonstrate the effectiveness and efficiency of the proposed model and algorithm. The results show that the proposed algorithm can generate robust and reliable logistics network designs resilient to disruptions and uncertainties, leading to significant improvements in logistics performance and cost savings compared to traditional methods.

Evolutionary Optimization for Unmanned Underwater Vehicle Navigation

Unmanned Underwater Vehicles (UUVs) play a vital role in various underwater exploration and surveillance tasks. However, the effective navigation of UUVs in complex underwater environments poses significant challenges due to factors such as limited communication, dynamic currents, and other difficulties. Evolutionary optimization techniques have developed as promising tools for enhancing UUV navigation abilities. This review provides a brief overview of the application of evolutionary optimization algorithms, including genetic algorithms, evolutionary approaches, and particle swarm optimization, in the context of UUV navigation. The fundamental principles of these algorithms and their applications in path planning, path optimization, localization, obstacle avoidance, and mission planning for UUVs are discussed in brief. Through an analysis of existing literature and case studies, the use of evolutionary optimization in improving the navigation efficiency, accuracy, and robustness of UUVs is highlighted. Additionally, current challenges were identified, and future research directions to advance the integration of evolutionary optimization techniques in UUV navigation systems are also discussed. Overall, this aims to provide insights into the potential of evolutionary optimization for addressing the navigation challenges faced by unmanned underwater vehicles and promoting advancements in underwater exploration and surveillance technologies.

Multi-objective optimization design of aerothermal performance for turbine blade squealer tip with inclined suction-side rim

To optimize the inclined rim design, multi-objective optimization was numerically conducted on the suction-side rim of the squealer tip in the GE-E3 rotor blade. The RANS equations, incorporating with the standard k-ω model, were numerically solved. Through the implementation of a Kriging surrogate model coupled with the NSGA-II evolutionary optimization technique, six geometric parameters on the suction-side rim went through iterative optimization. This process yielded three optimized squealer tip geometries on the Pareto front: Structure 1 with minimum total pressure loss, Structure 2 with optimal comprehensive aerothermal performance, and Structure 3 with minimum tip heat load. Comparative analysis revealed that with the inner and external wall inclined toward the cavity and passage respectively, the optimization results in a 3 %–11 % reduction in tip heat load, accompanied by an 8.5 %–10.2 % reduction in aerodynamic loss, facilitated by an attenuated upper passage vortex (UPV) and strengthened tip leakage vortex (TLV). The critical inclined region of the external rim wall, spanning 7 %–80 %, influences the exit total pressure loss distribution. The inclined inner wall upstream of 50 % Cax obstructs coolant jets from exiting the cavity, reducing the heat load on the cavity bottom. However, the inclined external wall from 66 % to 90 % Cax amplifies the impingement of the scraping vortex (SV), increasing local heat transfer. The thermal behavior of Structure 1 is sensitive to changes in tip clearance, whereas Structure 2 and 3 show more robust advantages. As the clearance increased, the aerodynamic losses associated with the TLV rise for all three optimized tips, but losses from the UPV remain similar. This study provides a novel approach for designing efficient squealer tip geometries incorporating an inclined rim.

Evaluating machine learning models in predicting dam inflow and hydroelectric power production in multi-purpose dams (case study: Mahabad Dam, Iran)

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

Evolving Novel Gene Regulatory Networks for Structural Engineering Designs.

Engineering design optimization poses a significant challenge, usually requiring human expertise to discover superior solutions. Although various search techniques have been employed to generate diverse designs, their effectiveness is often limited by problem-specific parameter tuning, making them less generalizable and scalable. This article introduces a framework inspired by evolutionary and developmental (evo-devo) concepts, aiming to automate the evolution of structural engineering designs. In biological systems, evo-devo governs the growth of single-cell organisms into multicellular organisms through the use of gene regulatory networks (GRNs). GRNs are inherently complex and highly nonlinear, and this article explores the use of neural networks and genetic programming as artificial representations of GRNs to emulate such behaviors. To evolve a wide range of Pareto fronts for artificial GRNs, this article introduces a new technique, a real value-encoded neuroevolutionary method termed real-encoded NEAT (RNEAT). The performance of RNEAT is compared with that of two well-known evolutionary search techniques across different 2-D and 3-D problems. The experimental results demonstrate two key findings. First, the proposed framework effectively generates a population of GRNs that can produce diverse structures for both 2-D and 3-D problems. Second, the proposed RNEAT algorithm outperforms its competitors on more than 50% of the problems examined. These results validate the proof of concept underlying the proposed evo-devo-based engineering design evolution.

Optimization Algorithms for Real-Time Image Processing in IoT Networks

This study explores the application of optimization algorithms, with a focus on Particle Swarm Optimization (PSO), to enhance real-time image processing in Internet of Things (IoT) networks. Given the constraints of computational power and energy resources in IoT devices, efficient processing of image data is a critical challenge. The proposed PSO-based framework aims to minimize processing time and energy consumption while maintaining high accuracy in image analysis tasks. Experimental results demonstrate that PSO can reduce processing time by 10% and energy consumption by 15% on average, with a slight improvement in accuracy. Comparisons with traditional and other evolutionary optimization techniques reveal that PSO provides a superior balance between efficiency and performance, making it particularly well-suited for real-time IoT applications. The findings suggest that the integration of advanced optimization algorithms like PSO into IoT systems can significantly enhance their operational efficiency, scalability, and effectiveness, particularly in resource-constrained environments.

Cost-sensitive stacked long short-term memory with an evolutionary framework for minority class detection

‘Minority attack detection’ is a matter of great concern while designing a secure network and safeguarding it against cyber criminals who attempt to breach its defenses, intrude into its systems, and gain unauthorized access to sensitive information. An adequate intrusion detection system is demanded to counter such threats involving class imbalance and high dimensionality in network traffic. In this context, an artificial intelligence-based multiclass framework MCGAL is presented, which leverages the evolutionary technique of genetic algorithm to achieve the finest feature selection and stacked long short-term memory (LSTM) for traffic classification. The proposed approach utilizes cost-sensitive LSTM by assigning greater significance to minority or rarely occurring classes, thereby addressing the challenge of misclassification in the presence of imbalanced data in a real web attack subset of the CSE-CIC-IDS2018 dataset. A comprehensive performance analysis is performed to evaluate our proposed scheme concerning various class metrics using weighted and macro averages, which reveals a classification accuracy of 100 %. An achieved weighted average of 1.00 is then compared with baseline classifiers like decision trees, AdaBoost, and support vector machines utilizing both linear and radial kernels. The results of MCGAL are also assessed with recently reported techniques on the same dataset demonstrating remarkable improvements in all metrics such as precision, recall, and F-score of minority class detection. A pair-wise comparison and Kruskal-Wallis test at a 95 % significance level further illustrate the statistical significance of the proposed scheme for minority class detection.

EOFA: An Extended Version of the Optimal Foraging Algorithm for Global Optimization Problems

The problem of finding the global minimum of a function is applicable to a multitude of real-world problems and, hence, a variety of computational techniques have been developed to efficiently locate it. Among these techniques, evolutionary techniques, which seek, through the imitation of natural processes, to efficiently obtain the global minimum of multidimensional functions, play a central role. An evolutionary technique that has recently been introduced is the Optimal Foraging Algorithm, which is a swarm-based algorithm, and it is notable for its reliability in locating the global minimum. In this work, a series of modifications are proposed that aim to improve the reliability and speed of the above technique, such as a termination technique based on stochastic observations, an innovative sampling method and a technique to improve the generation of offspring. The new method was tested on a series of problems from the relevant literature and a comparative study was conducted against other global optimization techniques with promising results.

Soft computing models for prediction of bentonite plastic concrete strength

Bentonite plastic concrete (BPC) is extensively used in the construction of water-tight structures like cut-off walls in dams, etc., because it offers high plasticity, improved workability, and homogeneity. Also, bentonite is added to concrete mixes for the adsorption of toxic metals. The modified design of BPC, as compared to normal concrete, requires a reliable tool to predict its strength. Thus, this study presents a novel attempt at the application of two innovative evolutionary techniques known as multi-expression programming (MEP) and gene expression programming (GEP) and a boosting-based algorithm known as AdaBoost to predict the 28-day compressive strength ( ) of BPC based on its mixture composition. The MEP and GEP algorithms expressed their outputs in the form of an empirical equation, while AdaBoost failed to do so. The algorithms were trained using a dataset of 246 points gathered from published literature having six important input factors for predicting. The developed models were subject to error evaluation, and the results revealed that all algorithms satisfied the suggested criteria and had a correlation coefficient (R) greater than 0.9 for both the training and testing phases. However, AdaBoost surpassed both MEP and GEP in terms of accuracy and demonstrated a lower testing RMSE of 1.66 compared to 2.02 for MEP and 2.38 for GEP. Similarly, the objective function value for AdaBoost was 0.10 compared to 0.176 for GEP and 0.16 for MEP, which indicated the overall good performance of AdaBoost compared to the two evolutionary techniques. Also, Shapley additive analysis was done on the AdaBoost model to gain further insights into the prediction process, which revealed that cement, coarse aggregate, and fine aggregate are the most important factors in predicting the strength of BPC. Moreover, an interactive graphical user interface (GUI) has been developed to be practically utilized in the civil engineering industry for prediction of BPC strength.

Research on concept drift algorithm based on evolutionary computation

Concept drift (CD) in data streams can significantly impact the performance and stability of data stream classification algorithms, diminishing the generalization capabilities of integrated learning models. This paper addresses CD issues in dichotomous data streams by introducing a novel modeling approach that leverages evolutionary computation techniques. The method entails grouping base learners based on their performance within a sliding window and then evolving the base learning periods using evolutionary techniques. Furthermore, the concept of “gene flow” is introduced to enhance diversity among base learners and improve CD prediction performance. Experimental results on real and artificial datasets demonstrate the superior comprehensive performance of the proposed method. Specifically, the BCDECA algorithm outperforms other similar methods, excelling in accuracy, diversity, convergence rate, and robustness on a range of datasets.