Application Of Evolutionary Algorithms Research Articles

Modelling an Integrated Fuzzy Based Decision Support System for an Anaesthetist during Pre-Operative Clinical Assessment

Pre-operative clinical assessment is a crucial responsibility for every anaesthetist before any major medical procedure. This assessment evaluates a patient’s suitability for anaesthesia and their overall physical condition to endure the stresses of surgery. This is especially vital given recent data linking many surgical deaths to improper anaesthesia administration, with a mortality rate of 20 deaths per 10,000 anaesthetics in developed countries. This paper proposes an integrated fuzzy-based decision support system to assist anaesthetists during pre-operative clinical assessments. The approach combines neural network algorithms to classify and normalize input data, which then feeds into a fuzzy logic system for multi-variable decision-making analysis. To evaluate this decision support system, patient anaesthesia assessment datasheets were sourced from Ibom Multi Specialist Hospital in Akwa Ibom State, along with an online dataset from electronic anaesthesia records (MetaVision, 1MDsoft) of adult patients undergoing surgery at a major academic medical center. The study focused on patients over 18 years old undergoing non-cardiac surgeries, taking into account factors such as urgency and type of anaesthesia. The next step involves a decision-making process that assesses patient suitability for surgical anaesthesia based on established rules and membership functions developed through the fuzzy inference system. The results from this integrated decision support system were found to be reliable and consistent with anaesthetists’ assessments. The system achieved an accuracy of 91.46%, as indicated by a ROC curve comparing sensitivity and specificity, demonstrating its effectiveness in evaluating patients for medical procedures. To enhance the training of future anaesthesiologists, the introduction of artificial intelligence into the curriculum is recommended, along with the application of evolutionary algorithms like genetic algorithms and programming. These strategies aim to significantly enrich the decision-making processes employed by anaesthetists. Keywords: Fuzzy logic, neural network, anaesthesia, artificial intelligence

Solving Multi-Objective Optimal Control Problems Using a Multiresolution Approach

This paper presents an adaptive multiresolution strategy for multi-objective optimal control problems. The optimal control problem is solved using a direct approach, with individualistic grid adaptation facilitated by a local error analysis at element boundaries. Multiple objectives are considered using a dominance-based approach applying both local and global search methods to a collaborative population of unique solutions. These aspects are simultaneously incorporated via a novel application of evolutionary algorithms for adaptive optimal control problems. Together, this avoids the need for a priori specification of the quantity and temporal location of element boundaries and the set of scalarization weights defining the multi-objective descent directions. Solution fidelity can thus increase concurrently with the exploration of the design space, which leads to increased numerical efficiency while propagating and maintaining population diversity. The benefits of the proposed approach over traditional uniform-grid implementations are demonstrated. Results show that the multiresolution approach is capable of striking an effective balance between solution fidelity, population diversity, and computational cost unachievable using uniform grids.

A surrogate-assisted expensive constrained multi-objective global optimization algorithm and application

Expensive multi-objective optimization problems (MOPs) have seen the successful applications of surrogate-assisted evolutionary algorithms (SAEAs). Nevertheless, the majority of SAEAs are developed for costly unconstrained optimization, and costly constrained MOPs (CMOPs) have received less attention. Therefore, this article proposes a surrogate-assisted global optimization algorithm (named CTEA) for solving CMOPs within a very limited number of fitness evaluations. The proposed algorithm combines two selection frameworks, a bi-level selection framework, and an adaptive sampling framework, to enhance optimization performance. Leveraging on a constraint-improving strategy and a Pareto-based three-indicator criterion (convergence, constraint, and diversity indicators) at the different levels, the proposed bi-level selection framework can select more promising solutions. Moreover, an adaptive sampling framework is developed to prioritize objective and constraint functions and select the candidate solutions for real function evaluations according to the priority. Experimental results demonstrate that the proposed CTEA exhibits superior performance when compared with five state-of-the-art algorithms, achieving the best results in 61.9 % out of the 64 test instances. Finally, CTEA is applied to the multidisciplinary design optimization of blended-wing-body underwater gliders, and an impressive solution set is obtained.

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.

A Particle Swarm Optimization-Based Generative Adversarial Network

At present, the combination of general evolutionary algorithms (EAs) and neural networks is limited to optimizing the framework or hyper parameters of neural networks. To further extend applications of EAs on neural networks, we propose a particle swarm optimization (PSO) based generative adversarial network(GAN), named as PGAN in this paper. In the study, PSO is utilized as a generator to generate fake data, while the discriminator is a traditional fully connected neural network. In the confrontation process, when the proposed PSO can generate a better fake image, this will react to the discriminator, so that the discriminator can improve the recognition effect of the image and the better discriminator also accelerates the evolution of the overall model. Through experiments, we explore the new application value of EAs in deep learning, so that the sample data in EAs and the sample data in deep learning are interconnected. The PSO algorithm is improved, so that it truly participates in the confrontation with multi-layer perceptrons.

Application of Multi-objective Evolutionary Algorithms for Multidimensional Sensory Data Prediction and Resource Scheduling in Smart City Design

Multidimensional sensory data prediction and resource scheduling are paramount challenges in the design of smart cities. This paper delves into the utilization of multi-objective evolutionary algorithms to enhance the accuracy and efficiency of target detection through optimized YOLO_v3 network models. By integrating the YOLO_v3 model with the K-means++ algorithm for Anchor_Box generation, the novel approach exhibits superior adaptability and flexibility, particularly in handling variable-sized feature pattern mappings. This adaptability better caters to the detection of targets of diverse sizes, thus elevating the performance and precision of target detection algorithms. To further scrutinize the YOLO-v3 joint algorithm’s performance in urban traffic detection, P-R curves were plotted for various loss types on the NEU-DET dataset. Comparative analysis of these curves highlights the optimized algorithms’ superiority in detecting various types of losses in urban model completeness. Additionally, practical application analysis revealed that the optimized monitoring results outperform the detection time of the original YOLO-v3_means++ network model on FP_GA. Notably, post-processing with C-FENCE can reduce average single-frame image detection time to 2.01 seconds, while convolutional degree-level fusion with the BN layer cuts it down to 2.25 seconds. In summary, the FP_GA-based YOLO-v3_means++ network algorithm offers superior detection capabilities, and the multi-objective evolutionary algorithm’s optimization of the YOLO-v3 model enhances target detection performance and precision.

Research on multi-objective optimisation of product form design based on kansei engineering

It is crucial to understand and meet the multi-dimensional affective image needs of users for product form in a user demand-oriented product development model. Multi-objective evolutionary algorithms based on decomposition will be introduced into the field of kansei engineering to carry out research on product form optimisation design based on multi-objective evolutionary algorithms. A constrained multi-objective discrete optimisation model was established using the kansei engineering prediction model constructed through machine learning techniques as the objective function, and a reference vector guided evolutionary algorithm was used to solve it. The superiority of this method was verified by comparing it with other commonly used solving methods in this field. Combining entropy weight method and TOPSIS, select the optimisation design scheme that best meets the multi-dimensional affective needs of users from the obtained pareto set. Taking the train as an example, the proposed method was explained. The results indicate that the optimisation scheme obtained by this method can achieve the improvement and optimisation of product form in multiple affective dimensions. Meanwhile, a comparative study on the applicability of multi-objective evolutionary algorithms in the form optimisation problem of different affective dimensions is carried out to provide reference and suggestions for subsequent product design research.

Application of evolutionary algorithms to design economic flat slab buildings based on the intended function

Numerous studies revealed optimization techniques' applicability in minimizing the costs of reinforced concrete buildings. However, the existing literature has narrowly focused on optimizing buildings with a single function, such as residential or office buildings, hindering the generalization of the results. This paper aims to bridge the gap between optimization and structural engineering by obtaining the minimum-cost design of flat slab buildings with different intended functions. In this context, the optimal designs of 120 alternatives were obtained, considering various spans (4–8 m), live loads (2–10 kPa), and concrete compressive strength (25–40 MPa). The optimization was executed using the evolutionary algorithm provided in Microsoft Excel’s Solver tool. The optimization model permits the utilization of drop panels to resist punching stresses developed from the slab-column interaction. The objective function is the cost of materials and labor involved in constructing floors and columns. The decision variables are the floor dimensions and column configurations in dimensions and reinforcement. The structural constraints were applied per the Egyptian design code (ECP203-2020). Eventually, guidelines were developed to help the designers choose the economic floor system and quantities of materials based on the building's intended function.

Application of convolutional neural network and evolutionary algorithm to predict the outcome of adverse drug interactions

Application of convolutional neural network and evolutionary algorithm to predict the outcome of adverse drug interactions

EFFECTIVE SET IN GENETIC ALGORITHM FOR BIOINFORMATICS

Evolutionary algorithm research and applications began over 50 years ago. Like other artificial intelligence techniques, evolutionary algorithms will likely see increased use and development due to the increased availability of computation, more robust and available open source software libraries, and the increasing demand for artificial intelligence techniques. As these techniques become more adopted and capable, it is the right time to take a perspective of their ability to integrate into society and the human processes they intend to augment. KEYWORDS: GAs(Genetic Algorithms), Hereditary Calculations.

Evolutionary algorithm application to medium voltage power system restoration

The voltage quality is one of the most important issue in power system. The distribution network has to keep up with the growing consumption and increasing reliability requirements. In many cases supply disturbance is caused by faults on medium voltage distribution networks. Throughout system restoration many switching operation are needed, figuring out the optimal ones is a demanding task. In this paper a genetic algorithm based method is proposed, which can reduce the outage time in those areas where supply can be restored while the repairing is carried out on the failed section

How Recycled Grade is Economical? An Application of MILP and Evolutionary Algorithms in Intermodal Networks Under Uncertain Demand

How Recycled Grade is Economical? An Application of MILP and Evolutionary Algorithms in Intermodal Networks Under Uncertain Demand

New solutions to a multi-objective benchmark problem of induction heating: an application of computational biogeography and evolutionary algorithms

New solutions to a multi-objective benchmark problem of induction heating: an application of computational biogeography and evolutionary algorithms

Application of high-dimensional multi-objective differential evolutionary algorithm based on global ordering to heat supply pipe network resistance identification

The distribution of resistance coefficients of heat supply pipe networks is the key data guiding the hydraulic balance adjustment of heat networks. Since the heat supply pipe network is composed of many pipe segments and the resistance coefficient of each pipe segment is different during heat supply operation, the identification of the resistance coefficient of the heat supply pipe network is an optimization problem with multiple objective functions. In this paper, a high-dimensional multi-objective differential evolutionary algorithm based on global sorting is developed as a method to identify the resistance coefficients of the heat network and the multi-objective algorithm is applied to the resistance identification of the heat network, and the computational process of resistance identification is improved. The fuzzy mathematical method is applied to the process of resistance identification, and a set of optimal solution sets are generated through the identification of each pipe segment and the optimal solutions are selected from the optimal solution sets based on the fuzzy degree of subordination to solve the problem of determining the optimal solutions. The problem of determining the optimal solution is solved. The results show that compared with the single-objective algorithm, the high-dimensional multi-objective differential evolutionary algorithm based on global sorting produces a uniform and concentrated optimal solution set, and the optimal solution accuracy is higher.

A new proximity metric based on optimality conditions for single and multi-objective optimization: Method and validation

With the widespread application of Evolutionary Algorithms (EAs), their performance needs to be evaluated using more than the usual performance metrics. In the EA literature, various metrics assess the convergence ability of these algorithms. However, many of them require prior knowledge of the Pareto-optimal front. Recently, two Karush–Kuhn–Tucker Proximity Metrics (KKTPMs) have been introduced to measure convergence without needing prior knowledge. One relies on the Augmented Achievement Scalarization Function (AASF) method (AASF-KKTPM), and the other on Benson’s method (B-KKTPM). However, both require specific parameters and reference points, making them computationally expensive. In this paper, we introduce a novel version of KKTPM applicable to single-, multi-, and many-objective optimization problems, utilizing the Penalty-based Boundary Intersection (PBI) method (PBI-KKTPM). Additionally, we introduce an approximate approach to reduce the computational burden of solving PBI-KKTPM optimization problems. Through extensive computational experiments across 23 case studies, our proposed metric demonstrates a significant reduction in computational cost, ranging from 20.68% to 60.03% compared to the computational overhead associated with the AASF-KKTPM metric, and from 16.48% to 61.15% compared to the computational overhead associated with the B-KKTPM metric. Noteworthy features of the proposed metric include its independence from knowledge of the true Pareto-optimal front and its applicability as a termination criterion for EAs. Another feature of the proposed metric is its ability to deal with black box problems very efficiently.

A dedicated application of evolutionary algorithms: synchrotron X-ray radiation optimization based on an in-vacuum undulator

Following the rapid growth in accelerator-based light sources research since the mid of 20th century, miscellaneous third generation synchrotron radiation (SR) facilities such as SSRL, APS, ESRF, PETRA-III, and SPring-8 have come into existence. These SR source facilities provide 1020–1025 photons/s/mrad2/mm2/0.1%BW peak brightness within the photon energy range of 10–105 eV. Since different measurement techniques are utilized at X-ray beamlines of SR facilities, many kinds of insertion devices (i.e., undulators and wigglers) and optical components (e.g., high-resolution monochromators, double-crystal monochromators, lenses, mirrors, etc.) are employed for each experimental setup as a matter of course. Under the circumstances, optimization of a synchrotron beamline is a big concern for many scientists to ensure required radiation characteristics (i.e., photon flux, spot size, photon energy, etc.) for dedicated user experiments. In this respect, an in-vacuum hybrid undulator driven by a 6 GeV synchrotron electron beam is optimized using evolutionary algorithms (EA). Finally, it is shown that EA results are well consistent with both the literature and the analytical calculations, resulting in a promising design estimation for beamline scientists.

Application of soft computing and evolutionary algorithms to estimate hydropower potential in multi-purpose reservoirs

Hydropower is a clean and efficient technology for producing renewable energy. Assessment and forecasting of hydropower production are important for strategic decision-making. This study aimed to use machine learning models, including adaptive neuro-fuzzy inference system (ANFIS), gene expression programming, random forest (RF), and least square support vector regression (LSSVR), for predicting hydroelectric energy production. A total of eight input scenarios was defined with a combination of various observed variables, including evaporation, precipitation, inflow, and outflow to the reservoir, to predict the hydroelectric energy produced during the experimental period. The Mahabad reservoir near Lake Urmia in the northwest of Iran was selected as a study object. The results showed that a combination of hydroelectric energy produced in the previous month, evaporation, and outflow from the dam resulted in the highest prediction performance using the RF model. A scenario that included all input variables except the precipitation outperformed other scenarios using the LSSVR model. Among the models, LSSVR exerted the highest prediction performance for which RMSE, MAPE, and NSE were 442.7 (MWH), 328.3 (MWH), and 0.85, respectively. The results showed that Harris hawks optimization (HHO) (RMSE = 0.2 WMH, MAPE = 10 WMH, NSE = 0.90) was better than particle swarm optimization (PSO) (RMSE = 0.2 WMH, MAPE = 10 WMH, NSE = 0.90) in optimizing ANFIS during the prediction. The results of Taylor’s diagram indicated that the ANFIS-HHO model had the highest accuracy. The findings of this study showed that machine learning models can be used as an essential tool for decision-making in sustainable hydropower production.

A review of practice of using evolutionary algorithms for neural network synthesis and training

The object of this research is the application of evolutionary algorithms for the synthesis and training of neural networks. The paper aims to select and review the existing experience on using evolutionary algorithms as competitive methods to conventional approaches in neural network training and creation, and to evaluate such existing solutions for further development of this field. The essence of the obtained results lies in the successful application of genetic algorithms in conjunction with neural networks to optimize parameters, architecture, and weight coefficients of the networks. The genetic algorithms allowed improving the performance and accuracy of neural networks, especially in cases where backpropagation algorithms faced difficulties in finding optimal solutions. These results can be attributed to the fact that genetic algorithms are efficient methods for global optimization in parameter space. They help avoid local minima and discover more reliable and stable solutions. The obtained findings can be practically utilized to enhance the performance and quality of neural networks in various classification and prediction tasks. The use of genetic algorithms enables the selection of optimal weight coefficients, network connections, and identification of significant features from the dataset. However, they come with the limitation of additional time costs for evaluating the entire population according to the selection criteria. It is worth noting that the application of genetic algorithms is not a universal method for all tasks, and the algorithm parameters should be individually tuned for each specific problem. Further research could focus on refining the combination methods of genetic algorithms and neural networks, as well as exploring their application in new domains and tasks.

Modeling emergence of Wolbachia toxin-antidote protein functions with an evolutionary algorithm.

Evolutionary algorithms (EAs) simulate Darwinian evolution and adeptly mimic natural evolution. Most EA applications in biology encode high levels of abstraction in top-down population ecology models. In contrast, our research merges protein alignment algorithms from bioinformatics into codon based EAs that simulate molecular protein string evolution from the bottom up. We apply our EA to reconcile a problem in the field of Wolbachia induced cytoplasmic incompatibility (CI). Wolbachia is a microbial endosymbiont that lives inside insect cells. CI is conditional insect sterility that operates as a toxin antidote (TA) system. Although, CI exhibits complex phenotypes not fully explained under a single discrete model. We instantiate in-silico genes that control CI, CI factors (cifs), as strings within the EA chromosome. We monitor the evolution of their enzymatic activity, binding, and cellular localization by applying selective pressure on their primary amino acid strings. Our model helps rationalize why two distinct mechanisms of CI induction might coexist in nature. We find that nuclear localization signals (NLS) and Type IV secretion system signals (T4SS) are of low complexity and evolve fast, whereas binding interactions have intermediate complexity, and enzymatic activity is the most complex. Our model predicts that as ancestral TA systems evolve into eukaryotic CI systems, the placement of NLS or T4SS signals can stochastically vary, imparting effects that might impact CI induction mechanics. Our model highlights how preconditions and sequence length can bias evolution of cifs toward one mechanism or another.

Learning Adaptive Differential Evolution by Natural Evolution Strategies

Adaptive parameter control is critical in the design and application of evolutionary algorithm (EA), so does in differential evolution. In the past decade, many adaptive evolutionary algorithms have been proposed, in which online information collected until current generation during the evolutionary search procedure is used to determine the algorithmic parameters for the next generation. Recent studies often assume that the algorithmic parameters follow some distributions, while the distributions' parameters (called hyper-parameters) are updated by the collected information. Performances of these adaptive EAs depend highly on the hyper-parameters. Notice that the experiences obtained from optimizing some related problems could provide useful guidelines on how to adaptively control the distributions' parameters. However, few existing studies sufficiently used such experiences. To fill the gap, we propose a general framework for adaptive parameter control by modeling its evolution procedure as a Markov decision process. In the framework, a neural network is employed to act as the controller. The natural evolution strategies is applied to train the neural network. The proposed framework is applied on two well-known differential evolutions (DEs), namely JADE and LSHADE. By incorporating the learned controller, two DEs, named JADE/AC and LSHADE/AC, are formed. Experimental results on the CEC 2018 benchmark suite show that in general JADE/AC and LSHADE/AC perform significantly better than their counterparts. Moreover, in comparison with some well-known EAs including three suggested best DEs in a review paper (including LSHADE, cDE and CoBiDE), the championship algorithm in the CEC 2018 competitions, a recently-developed learnable DE and recently proposed DEs, our study shows that LSHADE/AC performs the best amongst them without sacrificing much computation time.