Explore the vast range of titles available.

Metaheuristic optimization techniques have successfully been used to solve the Optimal Power Flow (OPF) problem, addressing the shortcomings of mathematical optimization techniques. Two of the most popular metaheuristics are the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). The literature surrounding GA and PSO OPF is vast and not adequately organized. This work filled this gap by reviewing the most prominent works and analyzing the different traits of GA OPF works along seven axes, and of PSO OPF along four axes. Subsequently, cross-comparison between GA and PSO OPF works was undertaken, using the reported results of the reviewed works that use the IEEE 30-bus network to assess the performance and accuracy of each method. Where possible, the practices used in GA and PSO OPF were compared with literature suggestions from other domains. The cross-comparison aimed to act as a first step towards the standardization of GA and PSO OPF, as it can be used to draw preliminary conclusions regarding the tuning of hyper-parameters of GA and PSO OPF. The analysis of the cross-comparison results indicated that works using both GA and PSO OPF offer remarkable accuracy (with GA OPF having a slight edge) and that PSO OPF involves less computational burden.

For the past two decades, most of the people from developing countries are suffering from heart disease. Diagnosing these diseases at earlier stages helps patients reduce the risk of death and also in reducing the cost of treatment. The objective of adaptive genetic algorithm with fuzzy logic (AGAFL) model is to predict heart disease which will help medical practitioners in diagnosing heart disease at early stages. The model consists of the rough sets based heart disease feature selection module and the fuzzy rule based classification module. The generated rules from fuzzy classifiers are optimized by applying the adaptive genetic algorithm. First, important features which effect heart disease are selected by rough set theory. The second step predicts the heart disease using the hybrid AGAFL classifier. The experimentation is performed on the publicly available UCI heart disease datasets. Thorough experimental analysis shows that our approach has outperformed current existing methods.

The main focus of this paper is on the family of evolutionary algorithms and their real-life applications. We present the following algorithms: genetic algorithms, genetic programming, differential evolution, evolution strategies, and evolutionary programming. Each technique is presented in the pseudo-code form, which can be used for its easy implementation in any programming language. We present the main properties of each algorithm described in this paper. We also show many state-of-the-art practical applications and modifications of the early evolutionary methods. The open research issues are indicated for the family of evolutionary algorithms.

In this paper, the analysis of recent advances in genetic algorithms is discussed. The genetic algorithms of great interest in research community are selected for analysis. This review will help the new and demanding researchers to provide the wider vision of genetic algorithms. The well-known algorithms and their implementation are presented with their pros and cons. The genetic operators and their usages are discussed with the aim of facilitating new researchers. The different research domains involved in genetic algorithms are covered. The future research directions in the area of genetic operators, fitness function and hybrid algorithms are discussed. This structured review will be helpful for research and graduate teaching.

Optimizing the single objective flow shop scheduling problem requires determining the best sequence of operations across several machines in a manufacturing environment to achieve a given goal, such as total completion time or makespan. The complex nature of the search space, as well as the interdependence of jobs and machines, makes this problem extremely challenging. Researchers have investigated numerous algorithms and optimization techniques, including genetic algorithms, to tackle this challenge and increase manufacturing efficiency efficiently. The genetic algorithm is one of the widely used optimization schemes, which relies on the principle of evolution and works by improving each offspring generation using natural selection. However, genetic algorithms have many limitations, mainly on the offspring generation. The article provides a novel solution that modifies the existing genetic algorithm. The modification considers including a vaccination function that targets random genes in the offspring genotype to produce much better offspring and eventually improves the results. The work primarily designs an efficient schedule for job handling on different machines and the subsequent use of optimal resources. The modified algorithm was tested on the benchmark function to validate its performance. The results of the traditional and modified algorithms have been compared and discussed with the CEC 2019 benchmark functions. Essential metrics, such as time complexity, convergence speed, mean, and standard deviation, are used to evaluate the effectiveness and efficiency of these algorithms. The proposed self-healed genetic algorithm outperformed the traditional genetic algorithm. These findings highlight the promise of the self-healing genetic algorithm as an effective, rapidly converging, and accurate method for optimizing various problems, making it an attractive option for a wide range of real-world applications.

Background: With the development of smart grids, accurate electric load forecasting has become increasingly important as it can help power companies in better load scheduling and reduce excessive electricity production. However, developing and selecting accurate time series models is a challenging task as this requires training several different models for selecting the best amongst them along with substantial feature engineering to derive informative features and finding optimal time lags, a commonly used input features for time series models. Methods: Our approach uses machine learning and a long short-term memory (LSTM)-based neural network with various configurations to construct forecasting models for short to medium term aggregate load forecasting. The research solves above mentioned problems by training several linear and non-linear machine learning algorithms and picking the best as baseline, choosing best features using wrapper and embedded feature selection methods and finally using genetic algorithm (GA) to find optimal time lags and number of layers for LSTM model predictive performance optimization. Results: Using France metropolitan’s electricity consumption data as a case study, obtained results show that LSTM based model has shown high accuracy then machine learning model that is optimized with hyperparameter tuning. Using the best features, optimal lags, layers and training various LSTM configurations further improved forecasting accuracy. Conclusions: A LSTM model using only optimally selected time lagged features captured all the characteristics of complex time series and showed decreased Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) for medium to long range forecasting for a wider metropolitan area.

Developing a three‐dimensional (3D) lithofacies model from boreholes is critical for providing a coherent understanding of complex subsurface geology, which is essential for groundwater studies. This study aims to introduce a new geostatistical method—interval kriging—to efficiently conduct 3D borehole‐based lithological modeling with sand/non‐sand binary indicators. Interval kriging is a best linear unbiased estimator for irregular interval supports. Interval kriging considers 3D anisotropies between two orthogonal components—a horizontal plane and a vertical axis. A new 3D interval semivariogram is developed. To cope with the nonconvexity of estimation variance, the minimization of estimation variance is regulated with an additional regularization term. The minimization problem is solved by a global‐local genetic algorithm embedded with quadratic programming and Brent's method to obtain kriging weights and kriging length. Four numerical and real‐world case studies demonstrate that interval kriging is more computationally efficient than 3D kriging because the covariance matrix is largely reduced without sacrificing borehole data. Moreover, interval kriging produces more realistic geologic characteristics than 2.5D kriging, while conditional to spatial borehole data. Compared to the multiple‐point statistics (MPS) algorithm—SNESIM, interval kriging can reproduce the geological architecture and spatial connectivity of channel‐type features, meanwhile producing tabular‐type features with better connectivity. Because the regularization term constrains kriged value toward 0 or 1, interval kriging produces more certainty in sand/non‐sand classification than 2.5D kriging, 3D kriging, and SNESIM. In conclusion, interval kriging is an effective and efficient 3D geostatistical algorithm that can capture the 3D structural complexity while significantly reducing computational time. Plain Language Summary Three‐dimensional (3D) computer models of sand and clay layers, using borehole data, help understand geology to support groundwater studies. This study introduces a new statistical method, interval kriging, to efficiently create 3D models of rock types based on borehole data. Interval kriging uses rock types and rock thickness information of boreholes to provide reasonable guesses on rock types and rock thicknesses at specified locations. Interval kriging can account for differences in directionality between horizontal and vertical dimensions. A new mathematical formula for the differences in directionality is developed. Also, a specialized computer code is developed to estimate rock types and rock thicknesses. The findings from four numerical and real‐world case studies show that interval kriging is faster than 3D kriging and produces more realistic geological features than 2.5D kriging. Additionally, interval kriging represents channel‐type of geological patterns and generates tabular‐type patterns presenting better connectivity than the multiple‐point statistics (MPS) algorithm, SNESIM. Furthermore, the probability fields generated by interval kriging provide more certainty compared to 2.5D kriging, 3D kriging, and the MPS algorithm. Interval kriging offers a significant advantage for studying complex geological structures because the method can efficiently reproduce realistic geological structures based on boreholes. Key Points An improved 3D kriging method is presented for irregular interval supports to efficiently perform complex lithofacies modeling A new nested 3D irregular interval semivariogram is derived for modeling 3D anisotropies A best linear unbiased estimator is from minimizing regularized estimation variance using a global‐local embedded genetic algorithm

Due to the rapid growth in IT technology, digital data have increased availability, creating novel security threats that need immediate attention. An intrusion detection system (IDS) is the most promising solution for preventing malicious intrusions and tracing suspicious network behavioral patterns. Machine learning (ML) methods are widely used in IDS. Due to a limited training dataset, an ML-based IDS generates a higher false detection ratio and encounters data imbalance issues. To deal with the data-imbalance issue, this research develops an efficient hybrid network-based IDS model (HNIDS), which is utilized using the enhanced genetic algorithm and particle swarm optimization(EGA-PSO) and improved random forest (IRF) methods. In the initial phase, the proposed HNIDS utilizes hybrid EGA-PSO methods to enhance the minor data samples and thus produce a balanced data set to learn the sample attributes of small samples more accurately. In the proposed HNIDS, a PSO method improves the vector. GA is enhanced by adding a multi-objective function, which selects the best features and achieves improved fitness outcomes to explore the essential features and helps minimize dimensions, enhance the true positive rate (TPR), and lower the false positive rate (FPR). In the next phase, an IRF eliminates the less significant attributes, incorporates a list of decision trees across each iterative process, supervises the classifier’s performance, and prevents overfitting issues. The performance of the proposed method and existing ML methods are tested using the benchmark datasets NSL-KDD. The experimental findings demonstrated that the proposed HNIDS method achieves an accuracy of 98.979% on BCC and 88.149% on MCC for the NSL-KDD dataset, which is far better than the other ML methods i.e., SVM, RF, LR, NB, LDA, and CART.

Flower pollination algorithm (FPA) is a computational intelligence metaheuristic that takes its metaphor from flowers proliferation role in plants. This paper provides a comprehensive review of all issues related to FPA: biological inspiration, fundamentals, previous studies and comparisons, implementation, variants, hybrids, and applications. Besides, it makes a comparison between FPA and six different metaheuristics such as genetic algorithm, cuckoo search, grasshopper optimization algorithm, and others on solving a constrained engineering optimization problem. The experimental results are statistically analyzed with non-parametric Friedman test which indicates that FPA is superior more than other competitors in solving the given problem.

In real manufacturing environments, the number of automatic guided vehicles (AGV) is limited. Therefore, the scheduling problem that considers a limited number of AGVs is much nearer to real production and very important. In this paper, we studied the flexible job shop scheduling problem with a limited number of AGVs (FJSP-AGV) and propose an improved genetic algorithm (IGA) to minimize makespan. Compared with the classical genetic algorithm, a population diversity check method was specifically designed in IGA. To evaluate the effectiveness and efficiency of IGA, it was compared with the state-of-the-art algorithms for solving five sets of benchmark instances. Experimental results show that the proposed IGA outperforms the state-of-the-art algorithms. More importantly, the current best solutions of 34 benchmark instances of four data sets were updated.