genetic algorithm research paper 2020

An official website of the United States government

The .gov means it’s official. Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

The site is secure. The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

• Publications
• Account settings

Preview improvements coming to the PMC website in October 2024. Learn More or Try it out now .

• Advanced Search
• Journal List
• Springer Nature - PMC COVID-19 Collection

A review on genetic algorithm: past, present, and future

Sourabh katoch.

Computer Science and Engineering Department, National Institute of Technology, Hamirpur, India

Sumit Singh Chauhan

Vijay kumar.

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.

Introduction

In the recent years, metaheuristic algorithms are used to solve real-life complex problems arising from different fields such as economics, engineering, politics, management, and engineering [ 113 ]. Intensification and diversification are the key elements of metaheuristic algorithm. The proper balance between these elements are required to solve the real-life problem in an effective manner. Most of metaheuristic algorithms are inspired from biological evolution process, swarm behavior, and physics’ law [ 17 ]. These algorithms are broadly classified into two categories namely single solution and population based metaheuristic algorithm (Fig.  1 ). Single-solution based metaheuristic algorithms utilize single candidate solution and improve this solution by using local search. However, the solution obtained from single-solution based metaheuristics may stuck in local optima [ 112 ]. The well-known single-solution based metaheuristics are simulated annealing, tabu search (TS), microcanonical annealing (MA), and guided local search (GLS). Population-based metaheuristics utilizes multiple candidate solutions during the search process. These metaheuristics maintain the diversity in population and avoid the solutions are being stuck in local optima. Some of well-known population-based metaheuristic algorithms are genetic algorithm (GA) [ 135 ], particle swarm optimization (PSO) [ 101 ], ant colony optimization (ACO) [ 47 ], spotted hyena optimizer (SHO) [ 41 ], emperor penguin optimizer (EPO) [ 42 ], and seagull optimization (SOA) [ 43 ].

Classification of metaheuristic Algorithms

Among the metaheuristic algorithms, Genetic algorithm (GA) is a well-known algorithm, which is inspired from biological evolution process [ 136 ]. GA mimics the Darwinian theory of survival of fittest in nature. GA was proposed by J.H. Holland in 1992. The basic elements of GA are chromosome representation, fitness selection, and biological-inspired operators. Holland also introduced a novel element namely, Inversion that is generally used in implementations of GA [ 77 ]. Typically, the chromosomes take the binary string format. In chromosomes, each locus (specific position on chromosome) has two possible alleles (variant forms of genes) - 0 and 1. Chromosomes are considered as points in the solution space. These are processed using genetic operators by iteratively replacing its population. The fitness function is used to assign a value for all the chromosomes in the population [ 136 ]. The biological-inspired operators are selection, mutation, and crossover. In selection, the chromosomes are selected on the basis of its fitness value for further processing. In crossover operator, a random locus is chosen and it changes the subsequences between chromosomes to create off-springs. In mutation, some bits of the chromosomes will be randomly flipped on the basis of probability [ 77 , 135 , 136 ]. The further development of GA based on operators, representation, and fitness has diminished. Therefore, these elements of GA are focused in this paper.

The main contribution of this paper are as follows:

• The general framework of GA and hybrid GA are elaborated with mathematical formulation.
• The various types of genetic operators are discussed with their pros and cons.
• The variants of GA with their pros and cons are discussed.
• The applicability of GA in multimedia fields is discussed.

The main aim of this paper is two folds. First, it presents the variants of GA and their applicability in various fields. Second, it broadens the area of possible users in various fields. The various types of crossover, mutation, selection, and encoding techniques are discussed. The single-objective, multi-objective, parallel, and hybrid GAs are deliberated with their advantages and disadvantages. The multimedia applications of GAs are elaborated.

The remainder of this paper is organized as follows: Section 2 presents the methodology used to carry out the research. The classical genetic algorithm and genetic operators are discussed in Section 3 . The variants of genetic algorithm with pros and cons are presented in Section 4 . Section 5 describes the applications of genetic algorithm. Section 6 presents the challenges and future research directions. The concluding remarks are drawn in Section 7 .

Research methodology

PRISMA’s guidelines were used to conduct the review of GA [ 138 ]. A detailed search has been done on Google scholar and PubMed for identification of research papers related to GA. The important research works found during the manual search were also added in this paper. During search, some keywords such as “Genetic Algorithm” or “Application of GA” or “operators of GA” or “representation of GA” or “variants of GA” were used. The selection and rejection of explored research papers are based on the principles, which is mentioned in Table ​ Table1 1 .

Selection criterion for shortlisted research papers

Total 27,64,792 research papers were explored on Google Scholar, PubMed and manual search. The research work related to genetic algorithm for multimedia applications were also included. During the screening of research papers, all the duplicate papers and papers published before 2007 were discarded. 4340 research papers were selected based on 2007 and duplicate entries. Thereafter, 4050 research papers were eliminated based on titles. 220 research papers were eliminated after reading of abstract. 70 research papers were left after third round of screening. 40 more research papers were discarded after full paper reading and facts found in the papers. After the fourth round of screening, final 30 research papers are selected for review.

Based on the relevance and quality of research, 30 papers were selected for evaluation. The relevance of research is decided through some criteria, which is mentioned in Table ​ Table1. 1 . The selected research papers comprise of genetic algorithm for multimedia applications, advancement of their genetic operators, and hybridization of genetic algorithm with other well-established metaheuristic algorithms. The pros and cons of genetic operators are shown in preceding section.

In this section, the basic structure of GA and its genetic operators are discussed with pros and cons.

Classical GA

Genetic algorithm (GA) is an optimization algorithm that is inspired from the natural selection. It is a population based search algorithm, which utilizes the concept of survival of fittest [ 135 ]. The new populations are produced by iterative use of genetic operators on individuals present in the population. The chromosome representation, selection, crossover, mutation, and fitness function computation are the key elements of GA. The procedure of GA is as follows. A population ( Y ) of n chromosomes are initialized randomly. The fitness of each chromosome in Y is computed. Two chromosomes say C1 and C2 are selected from the population Y according to the fitness value. The single-point crossover operator with crossover probability (C p ) is applied on C1 and C2 to produce an offspring say O . Thereafter, uniform mutation operator is applied on produced offspring ( O ) with mutation probability (M p ) to generate O′ . The new offspring O′ is placed in new population. The selection, crossover, and mutation operations will be repeated on current population until the new population is complete. The mathematical analysis of GA is as follows [ 126 ]:

GA dynamically change the search process through the probabilities of crossover and mutation and reached to optimal solution. GA can modify the encoded genes. GA can evaluate multiple individuals and produce multiple optimal solutions. Hence, GA has better global search capability. The offspring produced from crossover of parent chromosomes is probable to abolish the admirable genetic schemas parent chromosomes and crossover formula is defined as [ 126 ]:

where g is the number of generations, and G is the total number of evolutionary generation set by population. It is observed from Eq.( 1 ) that R is dynamically changed and increase with increase in number of evolutionary generation. In initial stage of GA, the similarity between individuals is very low. The value of R should be low to ensure that the new population will not destroy the excellent genetic schema of individuals. At the end of evolution, the similarity between individuals is very high as well as the value of R should be high.

According to Schema theorem, the original schema has to be replaced with modified schema. To maintain the diversity in population, the new schema keep the initial population during the early stage of evolution. At the end of evolution, the appropriate schema will be produced to prevent any distortion of excellent genetic schema [ 65 , 75 ]. Algorithm 1 shows the pseudocode of classical genetic algorithm.

Algorithm 1: Classical Genetic Algorithm (GA)

Genetic operators

GAs used a variety of operators during the search process. These operators are encoding schemes, crossover, mutation, and selection. Figure ​ Figure2 2 depicts the operators used in GAs.

Operators used in GA

Encoding schemes

For most of the computational problems, the encoding scheme (i.e., to convert in particular form) plays an important role. The given information has to be encoded in a particular bit string [ 121 , 183 ]. The encoding schemes are differentiated according to the problem domain. The well-known encoding schemes are binary, octal, hexadecimal, permutation, value-based, and tree.

Binary encoding is the commonly used encoding scheme. Each gene or chromosome is represented as a string of 1 or 0 [ 187 ]. In binary encoding, each bit represents the characteristics of the solution. It provides faster implementation of crossover and mutation operators. However, it requires extra effort to convert into binary form and accuracy of algorithm depends upon the binary conversion. The bit stream is changed according the problem. Binary encoding scheme is not appropriate for some engineering design problems due to epistasis and natural representation.

In octal encoding scheme, the gene or chromosome is represented in the form of octal numbers (0–7). In hexadecimal encoding scheme, the gene or chromosome is represented in the form of hexadecimal numbers (0–9, A-F) [ 111 , 125 , 187 ]. The permutation encoding scheme is generally used in ordering problems. In this encoding scheme, the gene or chromosome is represented by the string of numbers that represents the position in a sequence. In value encoding scheme, the gene or chromosome is represented using string of some values. These values can be real, integer number, or character [ 57 ]. This encoding scheme can be helpful in solving the problems in which more complicated values are used. As binary encoding may fail in such problems. It is mainly used in neural networks for finding the optimal weights.

In tree encoding, the gene or chromosome is represented by a tree of functions or commands. These functions and commands can be related to any programming language. This is very much similar to the representation of repression in tree format [ 88 ]. This type of encoding is generally used in evolving programs or expressions. Table ​ Table2 2 shows the comparison of different encoding schemes of GA.

Comparison of different encoding schemes

Selection techniques

Selection is an important step in genetic algorithms that determines whether the particular string will participate in the reproduction process or not. The selection step is sometimes also known as the reproduction operator [ 57 , 88 ]. The convergence rate of GA depends upon the selection pressure. The well-known selection techniques are roulette wheel, rank, tournament, boltzmann, and stochastic universal sampling.

Roulette wheel selection maps all the possible strings onto a wheel with a portion of the wheel allocated to them according to their fitness value. This wheel is then rotated randomly to select specific solutions that will participate in formation of the next generation [ 88 ]. However, it suffers from many problems such as errors introduced by its stochastic nature. De Jong and Brindle modified the roulette wheel selection method to remove errors by introducing the concept of determinism in selection procedure. Rank selection is the modified form of Roulette wheel selection. It utilizes the ranks instead of fitness value. Ranks are given to them according to their fitness value so that each individual gets a chance of getting selected according to their ranks. Rank selection method reduces the chances of prematurely converging the solution to a local minima [ 88 ].

Tournament selection technique was first proposed by Brindle in 1983. The individuals are selected according to their fitness values from a stochastic roulette wheel in pairs. After selection, the individuals with higher fitness value are added to the pool of next generation [ 88 ]. In this method of selection, each individual is compared with all n-1 other individuals if it reaches the final population of solutions [ 88 ]. Stochastic universal sampling (SUS) is an extension to the existing roulette wheel selection method. It uses a random starting point in the list of individuals from a generation and selects the new individual at evenly spaced intervals [ 3 ]. It gives equal chance to all the individuals in getting selected for participating in crossover for the next generation. Although in case of Travelling Salesman Problem, SUS performs well but as the problem size increases, the traditional Roulette wheel selection performs relatively well [ 180 ].

Boltzmann selection is based on entropy and sampling methods, which are used in Monte Carlo Simulation. It helps in solving the problem of premature convergence [ 118 ]. The probability is very high for selecting the best string, while it executes in very less time. However, there is a possibility of information loss. It can be managed through elitism [ 175 ]. Elitism selection was proposed by K. D. Jong (1975) for improving the performance of Roulette wheel selection. It ensures the elitist individual in a generation is always propagated to the next generation. If the individual having the highest fitness value is not present in the next generation after normal selection procedure, then the elitist one is also included in the next generation automatically [ 88 ]. The comparison of above-mentioned selection techniques are depicted in Table ​ Table3 3 .

Comparison of different selection techniques

Crossover operators

Crossover operators are used to generate the offspring by combining the genetic information of two or more parents. The well-known crossover operators are single-point, two-point, k-point, uniform, partially matched, order, precedence preserving crossover, shuffle, reduced surrogate and cycle.

In a single point crossover, a random crossover point is selected. The genetic information of two parents which is beyond that point will be swapped with each other [ 190 ]. Figure ​ Figure3 3 shows the genetic information after swapping. It replaced the tail array bits of both the parents to get the new offspring.

Swapping genetic information after a crossover point

In a two point and k-point crossover, two or more random crossover points are selected and the genetic information of parents will be swapped as per the segments that have been created [ 190 ]. Figure ​ Figure4 4 shows the swapping of genetic information between crossover points. The middle segment of the parents is replaced to generate the new offspring.

Swapping genetic information between crossover points

In a uniform crossover, parent cannot be decomposed into segments. The parent can be treated as each gene separately. We randomly decide whether we need to swap the gene with the same location of another chromosome [ 190 ]. Figure ​ Figure5 5 depicts the swapping of individuals under uniform crossover operation.

Swapping individual genes

Partially matched crossover (PMX) is the most frequently used crossover operator. It is an operator that performs better than most of the other crossover operators. The partially matched (mapped) crossover was proposed by D. Goldberg and R. Lingle [ 66 ]. Two parents are choose for mating. One parent donates some part of genetic material and the corresponding part of other parent participates in the child. Once this process is completed, the left out alleles are copied from the second parent [ 83 ]. Figure ​ Figure6 6 depicts the example of PMX.

Partially matched crossover (PMX) [ 117 ]

Order crossover (OX) was proposed by Davis in 1985. OX copies one (or more) parts of parent to the offspring from the selected cut-points and fills the remaining space with values other than the ones included in the copied section. The variants of OX are proposed by different researchers for different type of problems. OX is useful for ordering problems [ 166 ]. However, it is found that OX is less efficient in case of Travelling Salesman Problem [ 140 ]. Precedence preserving crossover (PPX) preserves the ordering of individual solutions as present in the parent of offspring before the application of crossover. The offspring is initialized to a string of random 1’s and 0’s that decides whether the individuals from both parents are to be selected or not. In [ 169 ], authors proposed a modified version of PPX for multi-objective scheduling problems.

Shuffle crossover was proposed by Eshelman et al. [ 20 ] to reduce the bias introduced by other crossover techniques. It shuffles the values of an individual solution before the crossover and unshuffles them after crossover operation is performed so that the crossover point does not introduce any bias in crossover. However, the utilization of this crossover is very limited in the recent years. Reduced surrogate crossover (RCX) reduces the unnecessary crossovers if the parents have the same gene sequence for solution representations [ 20 , 139 ]. RCX is based on the assumption that GA produces better individuals if the parents are sufficiently diverse in their genetic composition. However, RCX cannot produce better individuals for those parents that have same composition. Cycle crossover was proposed by Oliver [ 140 ]. It attempts to generate an offspring using parents where each element occupies the position by referring to the position of their parents [ 140 ]. In the first cycle, it takes some elements from the first parent. In the second cycle, it takes the remaining elements from the second parent as shown in Fig.  7 .

Cycle Crossover (CX) [ 140 ]

Table ​ Table4 4 shows the comparison of crossover techniques. It is observed from Table ​ Table4 4 that single and k-point crossover techniques are easy to implement. Uniform crossover is suitable for large subsets. Order and cycle crossovers provide better exploration than the other crossover techniques. Partially matched crossover provides better exploration. The performance of partially matched crossover is better than the other crossover techniques. Reduced surrogate and cycle crossovers suffer from premature convergence.

Comparison of different crossover techniques

Mutation operators

Mutation is an operator that maintains the genetic diversity from one population to the next population. The well-known mutation operators are displacement, simple inversion, and scramble mutation. Displacement mutation (DM) operator displaces a substring of a given individual solution within itself. The place is randomly chosen from the given substring for displacement such that the resulting solution is valid as well as a random displacement mutation. There are variants of DM are exchange mutation and insertion mutation. In Exchange mutation and insertion mutation operators, a part of an individual solution is either exchanged with another part or inserted in another location, respectively [ 88 ].

The simple inversion mutation operator (SIM) reverses the substring between any two specified locations in an individual solution. SIM is an inversion operator that reverses the randomly selected string and places it at a random location [ 88 ]. The scramble mutation (SM) operator places the elements in a specified range of the individual solution in a random order and checks whether the fitness value of the recently generated solution is improved or not [ 88 ]. Table ​ Table5 5 shows the comparison of different mutation techniques.

Comparison of different mutation operators

Table ​ Table6 6 shows the best combination of encoding scheme, mutation, and crossover techniques. It is observed from Table ​ Table6 6 that uniform and single-point crossovers can be used with most of encoding and mutation operators. Partially matched crossover is used with inversion mutation and permutation encoding scheme provides the optimal solution.

Best combination of various operators under optimal Environment

Variants of GA

Various variants of GA’s have been proposed by researchers. The variants of GA are broadly classified into five main categories namely, real and binary coded, multiobjective, parallel, chaotic, and hybrid GAs. The pros and cons of these algorithms with their application has been discussed in the preceding subsections.

Real and binary coded GAs

Based on the representation of chromosomes, GAs are categorized in two classes, namely binary and real coded GAs.

Binary coded GAs

The binary representation was used to encode GA and known as binary GA. The genetic operators were also modified to carry out the search process. Payne and Glen [ 153 ] developed a binary GA to identify the similarity among molecules. They used binary representation for position of molecule and their conformations. However, this method has high computational complexity. Longyan et al. [ 203 ] investigated three different method for wind farm design using binary GA (BGA). Their method produced better fitness value and farm efficiency. Shukla et al. [ 185 ] utilized BGA for feature subset selection. They used mutual information maximization concept for selecting the significant features. BGAs suffer from Hamming cliffs, uneven schema, and difficulty in achieving precision [ 116 , 199 ].

Real-coded GAs

Real-coded GAs (RGAs) have been widely used in various real-life applications. The representation of chromosomes is closely associated with real-life problems. The main advantages of RGAs are robust, efficient, and accurate. However, RGAs suffer from premature convergence. Researchers are working on RGAs to improve their performance. Most of RGAs are developed by modifying the crossover, mutation and selection operators.

The searching capability of crossover operators are not satisfactory for continuous search space. The developments in crossover operators have been done to enhance their performance in real environment. Wright [ 210 ] presented a heuristics crossover that was applied on parents to produce off-spring. Michalewicz [ 135 ] proposed arithmetical crossover operators for RGAs. Deb and Agrawal [ 34 ] developed a real-coded crossover operator, which is based on characteristics of single-point crossover in BGA. The developed crossover operator named as simulated binary crossover (SBX). SBX is able to overcome the Hamming cliff, precision, and fixed mapping problem. The performance of SBX is not satisfactory in two-variable blocked function. Eshelman et al. [ 53 ] utilized the schemata concept to design the blend crossover for RGAs. The unimodal normal distribution crossover operator (UNDX) was developed by Ono et al. [ 144 ]. They used ellipsoidal probability distribution to generate the offspring. Kita et al. [ 106 ] presented a multi-parent UNDX (MP-UNDX), which is the extension of [ 144 ]. However, the performance of RGA with MP-UNDX is much similar to UNDX. Deep and Thakur [ 39 ] presented a Laplace crossover for RGAs, which is based on Laplacian distribution. Chuang et al. [ 27 ] developed a direction based crossover to further explore the all possible search directions. However, the search directions are limited. The heuristic normal distribution crossover operator was developed by Wang et al. [ 207 ]. It generates the cross-generated offspring for better search operation. However, the better individuals are not considered in this approach. Subbaraj et al. [ 192 ] proposed Taguchi self-adaptive RCGA. They used Taguchi method and simulated binary crossover to exploit the capable offspring.

Mutation operators generate diversity in the population. The two main challenges have to tackle during the application of mutation. First, the probability of mutation operator that was applied on population. Second, the outlier produced in chromosome after mutation process. Michalewicz [ 135 ] presented uniform and non-uniform mutation operators for RGAs. Michalewicz and Schoenauer [ 136 ] developed a special case of uniform mutation. They developed boundary mutation. Deep and Thakur [ 38 ] presented a novel mutation operator based on power law and named as power mutation. Das and Pratihar [ 30 ] presented direction-based exponential mutation operator. They used direction information of variables. Tang and Tseng [ 196 ] presented a novel mutation operator for enhancing the performance of RCGA. Their approach was fast and reliable. However, it stuck in local optima for some applications. Deb et al. [ 35 ] developed polynomial mutation that was used in RCGA. It provides better exploration. However, the convergence speed is slow and stuck in local optima. Lucasius et al. [ 129 ] proposed a real-coded genetic algorithm (RCGA). It is simple and easy to implement. However, it suffers from local optima problem. Wang et al. [ 205 ] developed multi-offspring GA and investigated their performance over single point crossover. Wang et al. [ 206 ] stated the theoretical basis of multi-offspring GA. The performance of this method is better than non-multi-offspring GA. Pattanaik et al. [ 152 ] presented an improvement in the RCGA. Their method has better convergence speed and quality of solution. Wang et al. [ 208 ] proposed multi-offspring RCGA with direction based crossover for solving constrained problems.

Table ​ Table7 7 shows the mathematical formulation of genetic operators in RGAs.

Mathematical formulation of genetic operators in RGAs

Multiobjective GAs

Multiobjective GA (MOGA) is the modified version of simple GA. MOGA differ from GA in terms of fitness function assignment. The remaining steps are similar to GA. The main motive of multiobjective GA is to generate the optimal Pareto Front in the objective space in such a way that no further enhancement in any fitness function without disturbing the other fitness functions [ 123 ]. Convergence, diversity, and coverage are main goal of multiobjective GAs. The multiobjective GAs are broadly categorized into two categories namely, Pareto-based, and decomposition-based multiobjective GAs [ 52 ]. These techniques are discussed in the preceding subsections.

Pareto-based multi-objective GA

The concept of Pareto dominance was introduced in multiobjective GAs. Fonseca and Fleming [ 56 ] developed first multiobjective GA (MOGA). The niche and decision maker concepts were proposed to tackle the multimodal problems. However, MOGA suffers from parameter tuning problem and degree of selection pressure. Horn et al. [ 80 ] proposed a niched Pareto genetic algorithm (NPGA) that utilized the concept of tournament selection and Pareto dominance. Srinivas and Deb [ 191 ] developed a non-dominated sorting genetic algorithm (NSGA). However, it suffers from lack of elitism, need of sharing parameter, and high computation complexity. To alleviate these problems, Deb et al. [ 36 ] developed a fast elitist non-dominated sorting genetic algorithm (NSGA-II). The performance of NSGA-II may be deteriorated for many objective problems. NSGA-II was unable to maintain the diversity in Pareto-front. To alleviate this problem, Luo et al. [ 130 ] introduced a dynamic crowding distance in NSGA-II. Coello and Pulido [ 28 ] developed a multiobjective micro GA. They used an archive for storing the non-dominated solutions. The performance of Pareto-based approaches may be deteriorated in many objective problems [ 52 ].

Decomposition-based multiobjective GA

Decomposition-based MOGAs decompose the given problem into multiple subproblems. These subproblems are solved simultaneously and exchange the solutions among neighboring subproblems [ 52 ]. Ishibuchi and Murata [ 84 ] developed a multiobjective genetic local search (MOGLS). In MOGLS, the random weights were used to select the parents and local search for their offspring. They used generation replacement and roulette wheel selection method. Jaszkiewicz [ 86 ] modified the MOGLS by utilizing different selection mechanisms for parents. Murata and Gen [ 141 ] proposed a cellular genetic algorithm for multiobjective optimization (C-MOGA) that was an extension of MOGA. They added cellular structure in MOGA. In C-MOGA, the selection operator was performed on the neighboring of each cell. C-MOGA was further extended by introducing an immigration procedure and known as CI-MOGA. Alves and Almeida [ 11 ] developed a multiobjective Tchebycheffs-based genetic algorithm (MOTGA) that ensures convergence and diversity. Tchebycheff scalar function was used to generate non-dominated solution set. Patel et al. [ 151 ] proposed a decomposition based MOGA (D-MOGA). They integrated opposition based learning in D-MOGA for weight vector generation. D-MOGA is able to maintain the balance between diversity of solutions and exploration of search space.

Parallel GAs

The motivation behind the parallel GAs is to improve the computational time and quality of solutions through distributed individuals. Parallel GAs are categorized into three broad categories such as master-slave parallel GAs, fine grained parallel GAs, and multi-population coarse grained parallel Gas [ 70 ]. In master-slave parallel GA, the computation of fitness functions is distributed over the several processors. In fine grained GA, parallel computers are used to solve the real-life problems. The genetic operators are bounded to their neighborhood. However, the interaction is allowed among the individuals. In coarse grained GA, the exchange of individuals among sub-populations is performed. The control parameters are also transferred during migration. The main challenges in parallel GAs are to maximize memory bandwidth and arrange threads for utilizing the power of GPUs [ 23 ]. Table ​ Table8 8 shows the comparative analysis of parallel GAs in terms of hardware and software. The well-known parallel GAs are studied in the preceding subsections.

Analysis of parallel GAs in terms of hardware and software

Master slave parallel GA

The large number of processors are utilized in master-slave parallel GA (MS-PGA) as compared to other approaches. The computation of fitness functions may be increased by increasing the number of processors. Hong et al. [ 79 ] used MS-PGA for solving data mining problems. Fuzzy rules are used with parallel GA. The evaluation of fitness function was performed on slave machines. However, it suffers from high computational time. Sahingzo [ 174 ] implemented MS-PGA for UAV path finding problem. The genetic operators were executed on processors. They used multicore CPU with four cores. Selection and fitness evaluation was done on slave machines. MS-PGA was applied on traffic assignment problem in [ 127 ]. They used thirty processors to solve this problem at National University of Singapore. Yang et al. [ 213 ] developed a web-based parallel GA. They implemented the master slave version of NSGA-II in distributed environment. However, the system is complex in nature.

Fine grained parallel GA

In last few decades, researchers are working on migration policies of fine grained parallel GA (FG-PGA). Porta et al. [ 161 ] utilized clock-time for migration frequency, which is independent of generations. They used non-uniform structure and static configuration. The best solution was selected for migration and worst solution was replaced with migrant solution. Kurdi [ 115 ] used adaptive migration frequency. The migration procedure starts until there is no change in the obtained solutions after ten successive generations. The non-uniform and dynamic structure was used. In [ 209 ], local best solutions were synchronized and formed a global best solutions. The global best solutions were transferred to all processors for father execution. The migration frequency depends upon the number of generation. They used uniform structure with fixed configuration. Zhang et al. [ 220 ] used parallel GA to solve the set cover problem of wireless networks. They used divide-and-conquer strategy to decompose the population into sub-populations. Thereafter, the genetic operators were applied on local solutions and Kuhn-Munkres was used to merge the local solutions.

Coarse grained parallel GA

Pinel et al. [ 158 ] proposed a GraphCell. The population was initialized with random values and one solution was initialized with Min-min heuristic technique. 448 processors were used to implement the proposed approach. However, coarse grained parallel GAs are less used due to complex in nature. The hybrid parallel GAs are widely used in various applications. Shayeghi et al. [ 182 ] proposed a pool-based Birmingham cluster GA. Master node was responsible for managing global population. Slave node selected the solutions from global population and executed it. 240 processors are used for computation. Roberge et al. [ 170 ] used hybrid approach to optimize switching angle of inverters. They used four different strategies for fitness function computation. Nowadays, GPU, cloud, and grid are most popular hardware for parallel GAs [ 198 ].

Chaotic GAs

The main drawback of GAs is premature convergence. The chaotic systems are incorporated into GAs to alleviate this problem. The diversity of chaos genetic algorithm removes premature convergence. Crossover and mutation operators can be replaced with chaotic maps. Tiong et al. [ 197 ] integrated the chaotic maps into GA for further improvement in accuracy. They used six different chaotic maps. The performance of Logistic, Henon and Ikeda chaotic GA performed better than the classical GA. However, these techniques suffer from high computational complexity. Ebrahimzadeh and Jampour [ 48 ] used Lorenz chaotic for genetic operators of GA to eliminate the local optima problem. However, the proposed approach was unable to find relationship between entropy and chaotic map. Javidi and Hosseinpourfard [ 87 ] utilized two chaotic maps namely logistic map and tent map for generating chaotic values instead of random selection of initial population. The proposed chaotic GA performs better than the GA. However, this method suffers from high computational complexity. Fuertes et al. [ 60 ] integrated the entropy into chaotic GA. The control parameters are modified through chaotic maps. They investigated the relationship between entropy and performance optimization.

Chaotic systems have also used in multiobjective and hybrid GAs. Abo-Elnaga and Nasr [ 5 ] integrated chaotic system into modified GA for solving Bi-level programming problems. Chaotic helps the proposed algorithm to alleviate local optima and enhance the convergence. Tahir et al. [ 193 ] presented a binary chaotic GA for feature selection in healthcare. The chaotic maps were used to initialize the population and modified reproduction operators were applied on population. Xu et al. [ 115 ] proposed a chaotic hybrid immune GA for spectrum allocation. The proposed approach utilizes the advantages of both chaotic and immune operator. However, this method suffers from parameter initialization problem.

Genetic Algorithms can be easily hybridized with other optimization methods for improving their performance such as image denoising methods, chemical reaction optimization, and many more. The main advantages of hybridized GA with other methods are better solution quality, better efficiency, guarantee of feasible solutions, and optimized control parameters [ 51 ]. It is observed from literature that the sampling capability of GAs is greatly affected from population size. To resolve this problem, local search algorithms such as memetic algorithm, Baldwinian, Lamarckian, and local search have been integrated with GAs. This integration provides proper balance between intensification and diversification. Another problem in GA is parameter setting. Finding appropriate control parameters is a tedious task. The other metaheuristic techniques can be used with GA to resolve this problem. Hybrid GAs have been used to solve the issues mentioned in the preceding subsections [ 29 , 137 , 186 ].

Enhance search capability

GAs have been integrated with local search algorithms to reduce the genetic drift. The explicit refinement operator was introduced in local search for producing better solutions. El-Mihoub et al. [ 54 ] established the effect of probability of local search on the population size of GA. Espinoza et al. [ 50 ] investigated the effect of local search for reducing the population size of GA. Different search algorithms have been integrated with GAs for solving real-life applications.

Generate feasible solutions

In complex and high-dimensional problems, the genetic operators of GA generate infeasible solutions. PMX crossover generates the infeasible solutions for order-based problems. The distance preserving crossover operator was developed to generate feasible solutions for travelling salesman problem [ 58 ]. The gene pooling operator instead of crossover was used to generate feasible solution for data clustering [ 19 ]. Konak and Smith [ 108 ] integrated a cut-saturation algorithm with GA for designing the communication networks. They used uniform crossover to produce feasible solutions.

Replacement of genetic operators

There is a possibility to replace the genetic operators which are mentioned in Section 3.2 with other search techniques. Leng [ 122 ] developed a guided GA that utilizes the penalties from guided local search. These penalties were used in fitness function to improve the performance of GA. Headar and Fukushima [ 74 ] used simplex crossover instead of standard crossover. The standard mutation operator was replaced with simulated annealing in [ 195 ]. The basic concepts of quantum computing are used to improve the performance of GAs. The heuristic crossover and hill-climbing operators can be integrated into GA for solving three-matching problem.

Optimize control parameters

The control parameters of GA play a crucial role in maintaining the balance between intensification and diversification. Fuzzy logic has an ability to estimate the appropriate control parameters of GA [ 167 ]. Beside this, GA can be used to optimize the control parameters of other techniques. GAs have been used to optimize the learning rate, weights, and topology of neutral networks [ 21 ]. GAs can be used to estimate the optimal value of fuzzy membership in controller. It was also used to optimize the control parameters of ACO, PSO, and other metaheuristic techniques [ 156 ]. The comparative analysis of well-known GAs are mentioned in Table ​ Table9 9 .

Comparative study of GA’s variants in terms of pros and cons

Applications

Genetic Algorithms have been applied in various NP-hard problems with high accuracy rates. There are a few application areas in which GAs have been successfully applied.

Operation management

GA is an efficient metaheuristic for solving operation management (OM) problems such as facility layout problem (FLP), supply network design, scheduling, forecasting, and inventory control.

Facility layout

Datta et al. [ 32 ] utilized GA for solving single row facility layout problem (SRFLP). For SRFLP, the modified crossover and mutation operators of GA produce valid solutions. They applied GA to large sized problems that consists of 60–80 instances. However, it suffers from parameter dependency problem. Sadrzadeh [ 173 ] proposed GA for multi-line FLP have multi products. The facilities were clustered using mutation and heuristic operators. The total cost obtained from the proposed GA was decreased by 7.2% as compared to the other algorithms. Wu et al. [ 211 ] implemented hierarchical GA to find out the layout of cellular manufacturing system. However, the performance of GA is greatly affected from the genetic operators. Aiello et al. [ 7 ] proposed MOGA for FLP. They used MOGA on the layout of twenty different departments. Palomo-Romero et al. [ 148 ] proposed an island model GA to solve the FLP. The proposed technique maintains the population diversity and generates better solutions than the existing techniques. However, this technique suffers from improper migration strategy that can be utilized for improving the population. GA and its variants has been successfully applied on FLP [ 103 , 119 , 133 , 201 ].

GA shows the superior performance for solving the scheduling problems such as job-shop scheduling (JSS), integrated process planning and scheduling (IPPS), etc. [ 119 ]. To improve the performance in the above-mentioned areas of scheduling, researchers developed various genetic representation [ 12 , 159 , 215 ], genetic operators, and hybridized GA with other methods [ 2 , 67 , 147 , 219 ].

Inventory control

Besides the scheduling, inventory control plays an important role in OM. Backordering and lost sales are two main approaches for inventory control [ 119 ]. Hiassat et al. [ 76 ] utilized the location-inventory model to find out the number and location of warehouses. Various design constraints have been added in the objective functions of GA and its variants for solving inventory control problem [].

Forecasting and network design

Forecasting is an important component for OM. Researchers are working on forecasting of financial trading, logistics demand, and tourist arrivals. GA has been hybridized with support vector regression, fuzzy set, and neural network (NN) to improve their forecasting capability [ 22 , 78 , 89 , 178 , 214 ]. Supply network design greatly affect the operations planning and scheduling. Most of the research articles are focused on capacity constraints of facilities [ 45 , 184 ]. Multi-product multi-period problems increases the complexity of supply networks. To resolve the above-mentioned problem, GA has been hybridized with other techniques [ 6 , 45 , 55 , 188 , 189 ]. Multi-objective GAs are also used to optimize the cost, profit, carbon emissions, etc. [ 184 , 189 ].

GAs have been applied in various fields of multimedia. Some of well-known multimedia fields are encryption, image processing, video processing, medical imaging, and gaming.

Information security

Due to development in multimedia applications, images, videos and audios are transferred from one place to another over Internet. It has been found in literature that the images are more error prone during the transmission. Therefore, image protection techniques such as encryption, watermarking and cryptography are required. The classical image encryption techniques require the input parameters for encryption. The wrong selection of input parameters will generate inadequate encryption results. GA and its variants have been used to select the appropriate control parameters. Kaur and Kumar [ 96 ] developed a multi-objective genetic algorithm to optimize the control parameters of chaotic map. The secret key was generated using beta chaotic map. The generated key was use to encrypt the image. Parallel GAs were also used to encrypt the image [ 97 ].

Image processing

The main image processing tasks are preprocessing, segmentation, object detection, denoising, and recognition. Image segmentation is an important step to solve the image processing problems. Decomposing/partitioning an image requires high computational time. To resolve this problem, GA is used due to their better search capability [ 26 , 102 ]. Enhancement is a technique to improve the quality and contrast of an image. The better image quality is required to analyze the given image. GAs have been used to enhance natural contrast and magnify image [ 40 , 64 , 99 ]. Some researchers are working on hybridization of rough set with adaptive genetic algorithm to merge the noise and color attributes. GAs have been used to remove the noise from the given image. GA can be hybridized with fuzzy logic to denoise the noisy image. GA based restoration technique can be used to remove haze, fog and smog from the given image [ 8 , 110 , 146 , 200 ]. Object detection and recognition is a challenging issue in real-world problem. Gaussian mixture model provides better performance during detection and recognition process. The control parameters are optimized through GA [ 93 ].

Video processing

Video segmentation has been widely used in pattern recognition, and computer vision. There are some critical issues that are associated with video segmentation. These are distinguishing object from the background and determine accurate boundaries. GA can be used to resolve these issues [ 9 , 105 ]. GAs have been implemented for gesture recognition successfully by Chao el al. [ 81 ] used GA for gesture recognition. They applied GAs and found an accuracy of 95% in robot vision. Kaluri and Reddy [ 91 ] proposed an adaptive genetic algorithm based method along with fuzzy classifiers for sign gesture recognition. They reported an improved recognition rate of 85% as compared to the existing method that provides 79% accuracy. Beside the gesture recognition, face recognition play an important role in criminal identification, unmanned vehicles, surveillance, and robots. GA is able to tackle the occlusion, orientations, expressions, pose, and lighting condition [ 69 , 95 , 109 ].

Medical imaging

Genetic algorithms have been applied in medical imaging such as edge detection in MRI and pulmonary nodules detection in CT scan images [ 100 , 179 ]. In [ 120 ], authors used a template matching technique with GA for detecting nodules in CT images. Kavitha and Chellamuthu [ 179 ] used GA based region growing method for detecting the brain tumor. GAs have been applied on medical prediction problems captured from pathological subjects. Sari and Tuna [ 176 ] used GA used to solve issues arises in biomechanics. It is used to predict pathologies during examination. Ghosh and Bhattachrya [ 62 ] implemented sequential GA with cellular automata for modelling the coronavirus disease 19 (COVID-19) data. GAs can be applied in parallel mode to find rules in biological datasets [ 31 ]. The authors proposed a parallel GA that runs by dividing the process into small sub-generations and evaluating the fitness of each individual solution in parallel. Genetic algorithms are used in medicine and other related fields. Koh et al. [ 61 ] proposed a genetic algorithm based method for evaluation of adverse effects of a given drug.

Precision agriculture

GAs have been applied on various problems that are related to precision agriculture. The main issues are crop yield, weed detection, and improvement in farming equipment. Pachepsky and Acock [ 145 ] implemented GA to analyze the water capacity in soil using remote sensing images. The crop yield can be predicted through the capacity of water present in soil. The weed identification was done through GA in [ 142 ]. They used aerial image for classification of plants. In [ 124 ], color image segmentation was used to discriminate the weed and plant. Peerlink et al. [ 154 ] determined the appropriate rate of fertilizer for various portions of agriculture field. They GA for determining the nitrogen in wheat field. The energy requirements in water irrigation systems can be optimized by viewing it as a multi-objective optimization problem. The amount of irrigation required and thus power requirements change continuously in a SMART farm. Therefore, GA can be applied in irrigation systems to reduce the power requirements [ 33 ].

GAs have been successfully used in games such as gomoku. In [ 202 ], the authors shown that the GA based approach finds the solution having the highest fitness than the normal tree based methods. However, in real-time strategy based games, GA based solutions become less practical to implement [ 82 ]. GAs have been implemented for path planning problems considering the environment constraints as well as avoiding the obstacles to reach the given destination. Burchardt and Salomon [ 18 ] described an implementation for path planning for soccer games. GA can encode the path planning problems via the coordinate points of a two-dimensional playing field, hence resulting in a variable length solution. The fitness function in path planning considers length of path as well as the collision avoiding terms for soccer players.

Wireless networking

Due to adaptive, scalable, and easy implementation of GA, it has been used to solve the various issues of wireless networking. The main issues of wireless networking are routing, quality of service, load balancing, localization, bandwidth allocation and channel assignment [ 128 , 134 ]. GA has been hybridized with other metaheuristics for solving the routing problems. Hybrid GA not only producing the efficient routes among pair of nodes, but also used for load balancing [ 24 , 212 ].

Load balancing

Nowadays, multimedia applications require Quality-of-Service (QoS) demand for delay and bandwidth. Various researchers are working on GAs for QoS based solutions.GA produces optimal solutions for complex networks [ 49 ]. Roy et al. [ 172 ] proposed a multi-objective GA for multicast QoS routing problem. GA was used with ACO and other search algorithms for finding optimal routes with desired QoS metrics. Load balancing is another issue in wireless networks. Scully and Brown [ 177 ] used MicroGAs and MacroGAs to distribute the load among various components of networks. He et al. [ 73 ] implemented GA to determine the balance load in wireless sensor networks. Cheng et al. [ 25 ] utilized distributed GA with multi-population scheme for load balancing. They used load balancing metric as a fitness function in GA.

Localization

The process of determining the location of wireless nodes is called as localization. It plays an important role in disaster management and military services. Yun et al. [ 216 ] used GA with fuzzy logic to find out the weights, which are assigned according to the signal strength. Zhang et al. [ 218 ] hybridized GA with simulated annealing (SA) to determine the position of wireless nodes. SA is used as local search to eliminate the premature convergence.

Bandwidth and channel allocation

The appropriate bandwidth allocation is a complex task. GAs and its variants have been developed to solve the bandwidth allocation problem [ 92 , 94 , 107 ]. GAs were used to investigate the allocation of bandwidth with QoS constraints. The fitness function of GAs may consists of resource utilization, bandwidth distribution, and computation time [ 168 ]. The channel allocation is an important issue in wireless networks. The main objective of channel allocation is to simultaneously optimize the number of channels and reuse of allocated frequency. Friend et al. [ 59 ] used distributed island GA to resolve the channel allocation problem in cognitive radio networks. Zhenhua et al. [ 221 ] implemented a modified immune GA for channel assignment. They used different encoding scheme and immune operators. Pinagapany and Kulkarni [ 157 ] developed a parallel GA to solve both static and dynamic channel allocation problem. They used decimal encoding scheme. Table ​ Table10 10 summarizes the applications of GA and its variants.

Applications of GA

Challenges and future possibilities

In this section, the main challenges faced during the implementation of GAs are discussed followed by the possible research directions.

Despite the several advantages, there are some challenges that need to be resolved for future advancements and further evolution of genetic algorithms. Some major challenges are given below:

Selection of initial population

Initial population is always considered as an important factor for the performance of genetic algorithms. The size of population also affects the quality of solution [ 160 ]. The researchers argue that if a large population is considered, then the algorithm takes more computation time. However, the small population may lead to poor solution [ 155 ]. Therefore, finding the appropriate population size is always a challenging issue. Harik and Lobo [ 71 ] investigated the population using self-adaption method. They used two approaches such as (1) use of self-adaption prior to execution of algorithm, in which the size of population remains the same and (2) in which the self-adaption used during the algorithm execution where the population size is affected by fitness function.

Premature convergence

Premature convergence is a common issue for GA. It can lead to the loss of alleles that makes it difficult to identify a gene [ 15 ]. Premature convergence states that the result will be suboptimal if the optimization problem coincides too early. To avoid this issue, some researchers suggested that the diversity should be used. The selection pressure should be used to increase the diversity. Selection pressure is a degree which favors the better individuals in the initial population of GA’s. If selection pressure (SP1) is greater than some selection pressure (SP2), then population using SP1 should be larger than the population using SP2. The higher selection pressure can decrease the population diversity that may lead to premature convergence [ 71 ].

Convergence property has to be handled properly so that the algorithm finds global optimal solution instead of local optimal solution (see Fig. ​ Fig.8). 8 ). If the optimal solution lies in the vicinity of an infeasible solution, then the global nature of GA can be combined with local nature of other algorithms such as Tabu search and local search. The global nature of genetic algorithms and local nature of Tabu search provide the proper balance between intensification and diversification.

Local and global optima [ 149 ]

Selection of efficient fitness functions

Fitness function is the driving force, which plays an important role in selecting the fittest individual in every iteration of an algorithm. If the number of iterations are small, then a costly fitness function can be adjusted. The number of iterations increases may increase the computational cost. The selection of fitness function depends upon the computational cost as well as their suitability. In [ 46 ], the authors used Davies-Bouldin index for classification of documents.

Degree of mutation and crossover

Crossover and mutation operators are the integral part of GAs. If the mutation is not considered during evolution, then there will be no new information available for evolution. If crossover is not considered during evolution, then the algorithm can result in local optima. The degree of these operators greatly affect the performance of GAs [ 72 ]. The proper balance between these operators are required to ensure the global optima. The probabilistic nature cannot determine the exact degree for an effective and optimal solution.

Selection of encoding schemes

GAs require a particular encoding scheme for a specific problem. There is no general methodology for deciding whether the particular encoding scheme is suitable for any type of real-life problem. If there are two different problems, then two different encoding schemes are required. Ronald [ 171 ] suggested that the encoding schemes should be designed to overwhelm the redundant forms. The genetic operators should be implemented in a manner that they are not biased towards the redundant forms.

Future research directions

GAs have been applied in different fields by modifying the basic structure of GA. The optimality of a solution obtained from GA can be made better by overcoming the current challenges. Some future possibilities for GA are as follows:

• There should be some way to choose the appropriate degree of crossover and mutation operators. For example Self-Organizing GA adapt the crossover and mutation operators according to the given problem. It can save computation time that make it faster.
• Future work can also be considered for reducing premature convergence problem. Some researchers are working in this direction. However, it is suggested that new methods of crossover and mutation techniques are required to tackle the premature convergence problem.
• Genetic algorithms mimic the natural evolution process. There can be a possible scope for simulating the natural evolution process such as the responses of human immune system and the mutations in viruses.
• In real-life problems, the mapping from genotype to phenotype is complex. In this situation, the problem has no obvious building blocks or building blocks are not adjacent groups of genes. Hence, there is a possibility to develop novel encoding schemes to different problems that does not exhibit same degree of difficulty.

Conclusions

This paper presents the structured and explained view of genetic algorithms. GA and its variants have been discussed with application. Application specific genetic operators are discussed. Some genetic operators are designed for representation. However, they are not applicable to research domains. The role of genetic operators such as crossover, mutation, and selection in alleviating the premature convergence is studied extensively. The applicability of GA and its variants in various research domain has been discussed. Multimedia and wireless network applications were the main attention of this paper. The challenges and issues mentioned in this paper will help the practitioners to carry out their research. There are many advantages of using GAs in other research domains and metaheuristic algorithms.

The intention of this paper is not only provide the source of recent research in GAs, but also provide the information about each component of GA. It will encourage the researchers to understand the fundamentals of GA and use the knowledge in their research problems.

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

arXiv's Accessibility Forum starts next month!

Help | Advanced Search

Computer Science > Neural and Evolutionary Computing

Title: genetic algorithm enhanced by deep reinforcement learning in parent selection mechanism and mutation : minimizing makespan in permutation flow shop scheduling problems.

Abstract: This paper introduces a reinforcement learning (RL) approach to address the challenges associated with configuring and optimizing genetic algorithms (GAs) for solving difficult combinatorial or non-linear problems. The proposed RL+GA method was specifically tested on the flow shop scheduling problem (FSP). The hybrid algorithm incorporates neural networks (NN) and uses the off-policy method Q-learning or the on-policy method Sarsa(0) to control two key genetic algorithm (GA) operators: parent selection mechanism and mutation. At each generation, the RL agent's action is determining the selection method, the probability of the parent selection and the probability of the offspring mutation. This allows the RL agent to dynamically adjust the selection and mutation based on its learned policy. The results of the study highlight the effectiveness of the RL+GA approach in improving the performance of the primitive GA. They also demonstrate its ability to learn and adapt from population diversity and solution improvements over time. This adaptability leads to improved scheduling solutions compared to static parameter configurations while maintaining population diversity throughout the evolutionary process.

Submission history

Access paper:.

• Other Formats

References & Citations

• Google Scholar
• Semantic Scholar

BibTeX formatted citation

Bibliographic and Citation Tools

Code, data and media associated with this article, recommenders and search tools.

• Institution

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here .

Loading metrics

Open Access

Peer-reviewed

Research Article

An improved genetic algorithm and its application in neural network adversarial attack

Contributed equally to this work with: Dingming Yang, Zeyu Yu, Hongqiang Yuan

Roles Conceptualization, Data curation, Formal analysis, Methodology, Software, Validation, Writing – original draft, Writing – review & editing

Affiliation School of Computer Science, Yangtze University, Jingzhou, China

Roles Funding acquisition, Supervision, Validation, Writing – review & editing

Affiliation School of Electronic & Information, Yangtze University, Jingzhou, China

Roles Funding acquisition, Resources, Writing – review & editing

Affiliation School of Urban Construction, Yangtze University, Jingzhou, China

Roles Conceptualization, Project administration, Resources, Supervision, Writing – review & editing

* E-mail: [email protected]

• Dingming Yang, 
• Zeyu Yu, 
• Hongqiang Yuan, 
• Yanrong Cui

• Published: May 5, 2022
• https://doi.org/10.1371/journal.pone.0267970
• Reader Comments

The choice of crossover and mutation strategies plays a crucial role in the searchability, convergence efficiency and precision of genetic algorithms. In this paper, a novel improved genetic algorithm is proposed by improving the crossover and mutation operation of the simple genetic algorithm, and it is verified by 15 test functions. The qualitative results show that, compared with three other mainstream swarm intelligence optimization algorithms, the algorithm can not only improve the global search ability, convergence efficiency and precision, but also increase the success rate of convergence to the optimal value under the same experimental conditions. The quantitative results show that the algorithm performs superiorly in 13 of the 15 tested functions. The Wilcoxon rank-sum test was used for statistical evaluation, showing the significant advantage of the algorithm at 95% confidence intervals. Finally, the algorithm is applied to neural network adversarial attacks. The applied results show that the method does not need the structure and parameter information inside the neural network model, and it can obtain the adversarial samples with high confidence in a brief time just by the classification and confidence information output from the neural network.

Citation: Yang D, Yu Z, Yuan H, Cui Y (2022) An improved genetic algorithm and its application in neural network adversarial attack. PLoS ONE 17(5): e0267970. https://doi.org/10.1371/journal.pone.0267970

Editor: Mohd Nadhir Ab Wahab, Universiti Sains Malaysia, MALAYSIA

Received: November 24, 2021; Accepted: April 19, 2022; Published: May 5, 2022

Copyright: © 2022 Yang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

Data Availability: All relevant data are within the paper and its Supporting information files.

Funding: D.Y., Z.Y., H.Y. and Y.C.; This work was supported by the Major Technology Innovation of Hubei Province [2019AAA011]. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

Competing interests: The authors have declared that no competing interests exist.

1 Introduction

In real life, optimization problems such as shortest path, path planning, task scheduling, parameter tuning, etc. are becoming more and more complex and have complex features such as nonlinear, multi-constrained, high-dimensional, and discontinuous [ 1 ]. Although a series of artificial intelligence algorithms represented by deep learning can solve some optimization problems, they lack mathematical interpretability due to the existence of a large number of nonlinear functions and parameters inside their models, so they are difficult to be widely used in the field of information security. Traditional optimization algorithms and artificial intelligence algorithms can hardly solve complex optimization problems with high dimensionality and nonlinearity in the field of information security.

Therefore, it is necessary to find an effective optimization algorithm to solve such problems. In this background, various swarm intelligence optimization algorithms have been proposed one after another, such as Particle Swarm Optimization(PSO) [ 2 , 3 ], Grey Wolf Optimizer(GWO) [ 4 ], etc. Subsequently, a variety of improved optimization algorithms also have been proposed one after another. For example, the improved genetic algorithm for cloud environment task scheduling [ 5 ], the improved genetic algorithm for flexible job shop scheduling [ 6 ], the improved genetic algorithm for green fresh food logistics [ 7 ], etc.

However, these improved optimization algorithms are improved for domain-specific optimization problems and do not improve the accuracy, convergence efficiency and generalization of the algorithms themselves. In this paper, the crossover operator and mutation operator of the genetic algorithm are improved to improve the convergence efficiency and precision of the algorithm without affecting the effectiveness of the improved genetic algorithm on most optimization problems. The effectiveness of the improved genetic algorithm is also verified through many comparison experiments and applications in the field of neural network adversarial attacks.

• By improving the single-point crossover link of SGA, the fitness function is used as an evaluation index for selecting children after crossover, thus reducing the number of iterations and accelerating the convergence speed.
• By improving the basic bitwise mutation of the SGA, traversing each gene of the offspring and performing selective mutation on them, setting different mutation rates for two parts of a chromosome, thus improving the global search in the stable case of local optimum.
• The improved genetic algorithm is applied to the field of neural network adversarial attack, which increases the speed of adversarial sample generation and improves the robustness of the neural network model.

2 Related works

2.1 genetic algorithm.

Genetic Algorithm is a series of simulation evolutionary algorithms proposed by Holland et al. [ 8 ], and later summarized by DeJong, Goldberg and others. The general flowchart of the Genetic Algorithm is shown in Fig 1 . The Genetic Algorithm first encodes the problem, then calculates the fitness, then selects the parent and the mother by roulette, and finally generates the children with high fitness by crossover and mutation, and finally generates the individuals with high fitness after many iterations, which is the satisfied solution or optimal solution of the problem. Simple Genetic Algorithm (SGA) uses single-point crossover and simple mutation to embody information exchange between individuals and local search, and does not rely on gradient information, so SGA can find the global optimal solution.

• PPT PowerPoint slide
• PNG larger image
• TIFF original image

https://doi.org/10.1371/journal.pone.0267970.g001

2.2 Other meta-heuristic algorithms

The meta-heuristic algorithm is problem-independent, does not exploit the specificity of the problem, and is a general solution. In general, it is not greedy, can explore more search space, and tends to obtain the global optimum. To be more specific, meta-heuristic have one of the most important ideas: a dynamic balance mechanism between diversification and intensification.

The PSO [ 2 , 3 ] algorithm is a swarm intelligence-based global stochastic search algorithm inspired by the results of artificial life research and by simulating the migration and flocking behavior of bird flocks during foraging, and its basic idea is inspired by the results of research on modeling and simulation of birds flock behavior. The GWO algorithm is a swarm intelligence optimization algorithm proposed by Mirjalili et al. [ 4 ]. The algorithm is inspired by the grey wolf prey hunting activity and developed as an optimization search algorithm, which has strong convergence performance, few parameters, and easy implementation. The Marine Predator Algorithm (MPA) [ 9 ] is mainly inspired by foraging strategies widely found in marine predators, namely Lévy and Brownian motion, and optimal encounter rate strategies in biological interactions between predators and prey. The Artificial Gorilla Troops Optimizer (GTO) [ 10 ] was inspired by the gorilla group life behavior. The GTO is characterized by fast search speed and high solution accuracy. The African Vulture Optimization Algorithm(AVOA) [ 11 ] was inspired by the foraging and navigation behavior of African vultures. this algorithm is fast and has high solution accuracy which is widely used in single-objective optimization. The Remora Optimization Algorithm (ROA) [ 12 ] first proposed an intelligent optimization algorithm inspired by the biological habits of the neutrals in nature, which has good solution accuracy and high engineering practical value in both function seeking to solve extreme values and typical engineering optimization problems.

2.3 Neural network adversarial attack

Szegedy et al. [ 13 ] first demonstrated that a highly accurate deep neural network can be misled to make a misclassification by adding a slight perturbation to an image that is imperceptible to the human eye, and also found that the robustness of deep neural networks can be improved by adversarial training. Such phenomena are far-reaching and have attracted many researchers in the area of adversarial attacks and deep learning security. Akhtar and Mian [ 14 ] surveyed 12 attack methods and 15 defense methods for neural networks adversarial attacks. The main attack methods are finding the minimum loss function additive term [ 13 ], increasing the loss function of the classifier [ 15 ], the method of limiting the l_0 norm [ 16 ], changing only one pixel value [ 17 ], etc.

Nguyen et al. [ 18 ] continued to explore the question of “what differences remain between computer and human vision” based on Szegedy et al. [ 13 ]. They used the Evolutionary Algorithm to generate high-confidence adversarial images by iterating over direct-encoded images and CPPN (Compositional Pattern-Producing Network) encoded images, respectively. They obtained high-confidence adversarial samples (fooling images) using the Evolutionary Algorithm on a LeNet model pre-trained on the MNIST dataset [ 19 ] and an AlexNet model pre-trained on the ILSVRC 2012 ImageNet dataset [ 20 , 21 ], respectively.

Neural network adversarial attacks are divided into black-box attacks and white-box attacks. Black-box attacks do not require the internal structure and parameters of the neural network, and the adversarial samples can be generated with optimization algorithms as long as the output classification and confidence information is known. The study of neural network adversarial attacks not only helps to understand the working principle of neural networks but also increases the robustness of neural networks by training with adversarial samples.

3 Approaches

This section improves the single-point crossover and simple mutation of SGA. The fitness function is used as the evaluation index of the crossover link, and the crossover points of the whole chromosome are traversed to improve the efficiency of the search for the best. A selective mutation is performed for each gene of the children’s chromosome, and the mutation rate of the latter half of the chromosome is set to twice that of the first half to improve the global search under the stable situation of local optimum.

3.1 Improved crossover operation

As shown in algorithm 1 is the Python pseudocode for the improved crossover algorithm. The single-point crossover of SGA is to generate a random number within the parental chromosome length range, and then intercept the first half of the father’s chromosome and the second half of the mother’s chromosome to cross-breed the children according to the generated random number. In this paper, the algorithm is improved by trying to cross genes within the parental chromosome length range one by one, calculating the fitness, and picking out the highest fitness children individuals. Experimental data show that such an improvement can reduce the number of iterations and speed up the convergence of fitness.

Algorithm 1 Crossover with fitness as evaluation.

Input : Father’s gene, mother’s gene, fitness function;

Output : Child’s gene;

1: function CROSSOVER( father , mother , fitness )

2:   best _ fitness = float . MIN _ VALUE ;

3:   best _ child = np . zeros ( father . size );

4:   for i = 0 → father . size do

5:    current _ child = np . zeros ( father . size );

6:    current _ child = np . append ( father [0: i ], mother [ i :]);

7:    current _ fitness = fitness ( current _ child );

8:    if current _ fitness > best _ fitness then

9:     best _ fitness = current _ fitness ;

10:     best _ child = current _ child . copy ();

11:    end if

12:   end for

13:   return best _ child

14: end function

3.2 Improved mutation operation

As shown in algorithm 2 is the pseudocode of the improved mutation algorithm. The simple mutation of SGA sets a relatively large mutation rate, and mutates any one gene of the incoming children’s chromosome when the generated random number is smaller than the mutation rate. In this paper, we improve the algorithm by setting a small mutation rate and then selectively mutating each gene of the incoming children’s chromosome. That is, when the generated random number is smaller than the mutation rate, the gene is mutated, and when the traversed gene position is larger than half of the chromosome length, the mutation rate is set to twice the original one (the second half of the gene has relatively less influence on the result). This ensures that the first half of the gene and the second half of the gene have an equal chance of mutation respectively, and can mutate at the same time. When the gene length is 784, the mutation rate of the whole chromosome is 1 − (1 − 0.025) 392 × (1 − 0.05) 392 , which greatly improves the species diversity and at the same time ensures the stability of the species (in the stable situation of the local optimum improves the global search ability), and experimental data show that it can improve the search capability.

Algorithm 2 Mutate child with alter each gene if rand number less than mutate rate.

Input : Child’s gene;

Output : Mutated child’s gene;

1: function MUTATE( child )

2:   mutate _ rate = 0.025;

3:   for i = 0 → child . size do

4:    if i > child . size //2 then

5:     mutate _ rate = 0.05;

6:    end if

7:    if random . random () < mutate _ rate then

8:     child [ i ] = ! child [ i ];//child[i] equals 0 or 1

9:    end if

10:   end for

11:   return child

12: end function

4 Numerical experiments and analysis

4.1 test functions.

In order to evaluate the optimization performance of the proposed improved genetic algorithm, 15 representative test functions from AVOA paper of Abdollahzadeh et al. [ 11 ] and Wikipedia [ 22 ] are selected in this paper. Since the proposed improved genetic algorithm is mainly used for the neural network adversarial attack problem, and the neural network has multi-dimensional parameters, the dimensions of the test functions will be tested on 30, 50, and 100, respectively. The details of the formula, dimensions, range, and minimum of the 15 test functions are shown in Tables 1 – 3 , where Table 1 are multi-dimensional test functions with unimodal, Table 2 are multi-dimensional test functions with multi-modal, and Table 3 for fixed-dimensional test functions.

https://doi.org/10.1371/journal.pone.0267970.t001

https://doi.org/10.1371/journal.pone.0267970.t002

https://doi.org/10.1371/journal.pone.0267970.t003

4.2 Experimental environment

The hardware environment of the experiment includes 8G of RAM, i7–4700MQ CPU; the software environment includes Windows 10 system, and the version of Python is 3.8.8. In order to compare the optimization performance of IGA, SGA (Simple Genetic Algorithm), PSO (Particle Swarm Optimization) and GWO (Grey Wolf Optimizer) are selected as the experimental objects for comparison experiments in this paper.

(a) Mutation rate. (b) Population size. (c) Max iteration.

https://doi.org/10.1371/journal.pone.0267970.g002

https://doi.org/10.1371/journal.pone.0267970.t004

4.3 Experimental results and analysis

4.3.1 qualitative result analysis..

(a) Parameter space. (b) Population distribution. (c) Best record. (d) Convergence curve.

https://doi.org/10.1371/journal.pone.0267970.g003

https://doi.org/10.1371/journal.pone.0267970.g004

https://doi.org/10.1371/journal.pone.0267970.g005

https://doi.org/10.1371/journal.pone.0267970.g006

4.3.2 Quantitative result analysis.

In order to make a quantitative comparison with the other three mainstream optimization algorithms, the four optimization algorithms are performed independently for 10 experiments on F1-F11 test functions in dimensions 30, 50, and 100, respectively. The purpose of performing the high-dimensional function test is to test the convergence superiority of IGA on the high-dimensional space for application in the field of neural network adversarial attack. Tables 5 – 7 are the test results of the test functions F1-F11 in 30, 50, and 100 dimensions, respectively. Table 8 shows the results of the four optimization algorithms tested on the test functions F12-F15. The best result, worst result, mean, median, standard deviation, and P-value are compared for 10 experiments. Where P-value is the result of the Wilcoxon rank-sum statistical test and P-value below 5% is significant.

https://doi.org/10.1371/journal.pone.0267970.t005

https://doi.org/10.1371/journal.pone.0267970.t006

https://doi.org/10.1371/journal.pone.0267970.t007

https://doi.org/10.1371/journal.pone.0267970.t008

In Table 5 , IGA achieves significantly superior performance in 9 test functions, PSO is better in F3, and SGA is slightly better in F8. In Tables 6 and 7 , IGA achieves significantly superior performance in 10 test functions, PSO performs better in F3. It can be seen that the performance loss of IGA with increasing dimensionality is not as large as the other three optimization algorithms. In Table 8 , IGA achieves significantly superior performance in 3 test functions, and PSO performs slightly better in F14.

In general, IGA has better iteration efficiency, global search capability, and convergence success rate than the other three optimization algorithms.

5 Application in neural network adversarial attack

5.1 mnst dataset.

The MNST dataset (Mixed National Institute of Standards and Technology database) [ 19 ] is one of the most well-known datasets in the field of machine learning and is used in applications from simple experiments to published paper research. It consists of handwritten digital images from 0–9. The MNIST image data is a single-channel grayscale map of 28 × 28 pixels, with each pixel taking values between 0 and 255, with 60,000 samples in the training set and 10,000 samples in the test set. The general usage of the MNIST dataset is to learn with the training set first and then use the learned model to measure how well the test set can be correctly classified [ 23 ].

5.2 Implementation

As shown in Fig 7(a) , the Deep Convolutional Neural Network (DCNN) pre-trained on the MNST dataset [ 19 ] is used as the experimental object in this paper, and the accuracy of the model is 99.35% with a Loss value of 0.9632. As shown in Fig 7(b) , the model of network adversarial attack is shown. The number of populations of a specific size (set to 100 in this paper) is first generated and then input to the neural network to obtain the confidence of the specified labels. To reduce the computational expense, the input is reduced to a binary image of 28 × 28 and the randomly generated binary image is iterated using the IGA proposed in this paper. Among the 100 individuals, the fathers and mothers with relatively high confidence are selected by roulette selection, and then the children are generated by using the improved crossover link in this paper, and the children from a new population by improving the mutation link until the specified number of iterations. Finally, the individual with the highest confidence is picked from the 100 individuals, which is the binary image with the highest confidence after passing through the neural network.

(a) The structure of DCNN for experiment. (b) The model of network adversarial attack.

https://doi.org/10.1371/journal.pone.0267970.g007

As shown in Fig 8 , the confidence after 99 iterations of DCNN is 99.98% for sample “2”. Sample “6” and sample “4” have the slowest convergence speed, and the confidence of sample “6” is 78.84% after 99 iterations, and the confidence of sample “4” is 78.84% after 99 iterations.

https://doi.org/10.1371/journal.pone.0267970.g008

The statistics of the experimental results are shown in Fig 9 . The binary image of sample “1” generated after 999 iterations has confidence of 99.94% after passing DCNN, which is much higher than the confidence of sample “1” in the MNIST test set in the DCNN control group. In the statistics of the results after initializing the population with the MNIST test set, because the overall confidence of the population initialized with the test set is higher, the increase in confidence during iteration is smaller. The confidence of the sample selected from the MNIST test set is 99.56%, and after 10 iterations the confidence of the sample is 99.80%, and the number “1” becomes vertical; after 89 iterations the confidence is 99.98%, and the number “1” has a tendency to “decompose” gradually.

https://doi.org/10.1371/journal.pone.0267970.g009

As shown in Fig 10 , the reason for this situation is probably that the confidence as a function of the image input is a multi-peak function, and the interval in which the test set images are distributed is not the highest peak of the confidence function. This causes the initial population of the test set to “stray” from some pixels in the images generated by the IGA.

https://doi.org/10.1371/journal.pone.0267970.g010

6 Conclusion

The comparison and simulation experiments show that the improved method proposed in this paper is effective and greatly improves the convergence efficiency, global search capability and convergence success rate. Applying IGA to the field of neural network adversarial attacks can also quickly obtain adversarial samples with high confidence, which is meaningful for the improvement of the robustness and security of neural network models.

In this paper, although the genetic algorithm has been improved to enhance the performance of the genetic algorithm, it is based on the genetic algorithm, so it cannot be completely separated from the general framework of the genetic algorithm, and the problem that the genetic algorithm is relatively slow in a single iteration cannot be solved. We hope to explore a new nature-inspired optimization algorithm in our future work. In addition, the reason why the neural network model has so many adversarial samples, we believe that it is a design flaw in the architecture of the neural network model. In future work, we will also try to explore a completely new way of the infrastructure of neural networks so as to compress the space of adversarial samples.

With the wide application of artificial intelligence and deep learning in the field of computer vision, face recognition has outstanding performance in access control systems and payment systems, which require a fast response to the input face image, but this has instead become a drawback to be hacked. For face recognition systems without in vivo detection, using the method in this paper only requires output labels and confidence information can obtain high confidence images quickly. In summary, neural networks have many pitfalls due to their uninterpretability and still need to be considered carefully for use in important areas.

Supporting information

https://doi.org/10.1371/journal.pone.0267970.s001

• View Article
• Google Scholar
• 2. Eberhart R. and Kennedy J. (1995). A new optimizer using particle swarm theory. In MHS’95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science , pages 39–43. Ieee.
• 3. Kennedy J. and Eberhart R. (1995). Particle swarm optimization. In Proceedings of ICNN’95-international conference on neural networks , volume 4, pages 1942–1948. IEEE.
• 8. Holland J. H. et al. (1975). Adaptation in natural and artificial systems.
• 13. Szegedy C., Zaremba W., Sutskever I., Bruna J., Erhan D., Goodfellow I., et al. (2013). Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199 .
• 15. Kurakin A., Goodfellow I., Bengio S., et al. (2016). Adversarial examples in the physical world.
• 16. Papernot N., McDaniel P., Jha S., Fredrikson M., Celik Z. B., and Swami A. (2016). The limitations of deep learning in adversarial settings. In 2016 IEEE European symposium on security and privacy (EuroS&P) , pages 372–387. IEEE.
• 18. Nguyen A., Yosinski J., and Clune J. (2015). Deep neural networks are easily fooled: High confidence predictions for unrecognizable images. In Proceedings of the IEEE conference on computer vision and pattern recognition , pages 427–436.
• 19. LeCun Y. (1998). The mnist database of handwritten digits. http://yann.lecun.com/exdb/mnist/ .
• 20. Deng J., Dong W., Socher R., Li L.-J., Li K., and Fei-Fei L. (2009). Imagenet: A large-scale hierarchical image database. In 2009 IEEE conference on computer vision and pattern recognition , pages 248–255. Ieee.
• 22. Wikipedia (2021). Test functions for optimization. Website. https://en.wikipedia.org/wiki/Test_functions_for_optimization .
• 23. Yasue S. (2018). Deep Learning from Scratch . “Beijing: Posts and Telecom Press”.

A review on genetic algorithm: past, present, and future

New citation alert added.

This alert has been successfully added and will be sent to:

You will be notified whenever a record that you have chosen has been cited.

To manage your alert preferences, click on the button below.

New Citation Alert!

Please log in to your account

Information & Contributors

Bibliometrics & citations, view options.

• Miao Y Jia L Yu H (2024) Firefly Algorithm Order Batching Problem Based on Local Search Optimization Proceedings of the 2024 5th International Conference on Computing, Networks and Internet of Things 10.1145/3670105.3670214 (626-630) Online publication date: 24-May-2024 https://dl.acm.org/doi/10.1145/3670105.3670214
• Souza P Ferreto T Calheiros R (2024) Maintenance Operations on Cloud, Edge, and IoT Environments: Taxonomy, Survey, and Research Challenges ACM Computing Surveys 10.1145/3659097 56 :10 (1-38) Online publication date: 22-Jun-2024 https://dl.acm.org/doi/10.1145/3659097
• Novo A Lobon F Garcia de Marina H Romero S Barranco F (2024) Neuromorphic Perception and Navigation for Mobile Robots: A Review ACM Computing Surveys 10.1145/3656469 56 :10 (1-37) Online publication date: 14-May-2024 https://dl.acm.org/doi/10.1145/3656469
• Show More Cited By

Index Terms

Computing methodologies

Artificial intelligence

Control methods

Search methodologies

Heuristic function construction

Theory of computation

Design and analysis of algorithms

Algorithm design techniques

Recommendations

Evolution of appropriate crossover and mutation operators in a genetic process.

Traditional genetic algorithms use only one crossover and one mutation operator to generate the next generation. The chosen crossover and mutation operators are critical to the success of genetic algorithms. Different crossover or mutation operators, ...

On the applicability of diploid genetic algorithms in dynamic environments

Diploid genetic algorithms (DGAs) promise robustness as against simple genetic algorithms which only work towards optimization. Moreover, these algorithms outperform others in dynamic environments. The work examines the theoretical aspect of the concept ...

Genetic operators design using division algorithm in the integer solution space

Genetic algorithm (GA) is a well known algorithm applied to a wide variety of optimization problems [4]. It combines selection, crossover, and mutation operators in order to find the best solution to a problem. The standard GA operates on chromosomes ...

Information

Published in.

Kluwer Academic Publishers

United States

Publication History

Author tags.

• Optimization
• Metaheuristic
• Genetic algorithm
• Research-article

Contributors

Other metrics, bibliometrics, article metrics.

• 254 Total Citations View Citations
• 0 Total Downloads
• Downloads (Last 12 months) 0
• Downloads (Last 6 weeks) 0
• Zhan C Gupta H Hillery M (2024) Optimizing Initial State of Detector Sensors in Quantum Sensor Networks ACM Transactions on Quantum Computing 10.1145/3655028 5 :2 (1-25) Online publication date: 30-Mar-2024 https://dl.acm.org/doi/10.1145/3655028
• Poulakis Y Doulkeridis C Kyriazis D (2024) A Survey on AutoML Methods and Systems for Clustering ACM Transactions on Knowledge Discovery from Data 10.1145/3643564 18 :5 (1-30) Online publication date: 26-Jan-2024 https://dl.acm.org/doi/10.1145/3643564
• Le D Tran A Pham T Huynh T (2024) A Survey of Model Compression and Its Feedback Mechanism in Federated Learning Proceedings of the 5th ACM Workshop on Intelligent Cross-Data Analysis and Retrieval 10.1145/3643488.3660293 (37-42) Online publication date: 10-Jun-2024 https://dl.acm.org/doi/10.1145/3643488.3660293
• Jiang L Belitz C Bosch N (2024) Synthetic Dataset Generation for Fairer Unfairness Research Proceedings of the 14th Learning Analytics and Knowledge Conference 10.1145/3636555.3636868 (200-209) Online publication date: 18-Mar-2024 https://dl.acm.org/doi/10.1145/3636555.3636868
• Liu J Chen J Wu J Wu Z Fang J Zheng Z (2024) Fishing for Fraudsters: Uncovering Ethereum Phishing Gangs With Blockchain Data IEEE Transactions on Information Forensics and Security 10.1109/TIFS.2024.3359000 19 (3038-3050) Online publication date: 1-Jan-2024 https://dl.acm.org/doi/10.1109/TIFS.2024.3359000
• Yao Y He J Li T Wang Y Lan X Li Y (2024) An Automatic XSS Attack Vector Generation Method Based on the Improved Dueling DDQN Algorithm IEEE Transactions on Dependable and Secure Computing 10.1109/TDSC.2023.3319352 21 :4 (2852-2868) Online publication date: 1-Jul-2024 https://dl.acm.org/doi/10.1109/TDSC.2023.3319352
• Hao L Shi G (2024) Finding the longest delay paths for the array-form multipliers using a genetic algorithm Integration, the VLSI Journal 10.1016/j.vlsi.2024.102148 96 :C Online publication date: 1-May-2024 https://dl.acm.org/doi/10.1016/j.vlsi.2024.102148

View options

Login options.

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Share this publication link.

Copying failed.

Share on social media

Affiliations, export citations.

• Please download or close your previous search result export first before starting a new bulk export. Preview is not available. By clicking download, a status dialog will open to start the export process. The process may take a few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress. Download
• Download citation
• Copy citation

We are preparing your search results for download ...

We will inform you here when the file is ready.

Your file of search results citations is now ready.

Your search export query has expired. Please try again.

Genetic algorithm: Theory, literature review, and application in image reconstruction

Research output : Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Genetic Algorithm (GA) is one of the most well-regarded evolutionary algorithms in the history. This algorithm mimics Darwinian theory of survival of the fittest in nature. This chapter presents the most fundamental concepts, operators, and mathematical models of this algorithm. The most popular improvements in the main component of this algorithm (selection, crossover, and mutation) are given too. The chapter also investigates the application of this technique in the field of image processing. In fact, the GA algorithm is employed to reconstruct a binary image from a completely random image.

Publication series

Access to Document

• 10.1007/978-3-030-12127-3_5

Other files and links

• Link to publication in Scopus

Fingerprint

• Genetic Algorithm Keyphrases 100%
• Genetic Algorithm Theory Keyphrases 100%
• Image Reconstruction Keyphrases 100%
• Reconstruction Biochemistry, Genetics and Molecular Biology 100%
• Popular Keyphrases 50%
• Evolutionary Algorithms Keyphrases 50%
• Random Image Keyphrases 50%
• Darwinian Theory Keyphrases 50%

T1 - Genetic algorithm

T2 - Theory, literature review, and application in image reconstruction

AU - Mirjalili, Seyedali

AU - Song Dong, Jin

AU - Sadiq, Ali Safa

AU - Faris, Hossam

PY - 2020/1/1

Y1 - 2020/1/1

N2 - Genetic Algorithm (GA) is one of the most well-regarded evolutionary algorithms in the history. This algorithm mimics Darwinian theory of survival of the fittest in nature. This chapter presents the most fundamental concepts, operators, and mathematical models of this algorithm. The most popular improvements in the main component of this algorithm (selection, crossover, and mutation) are given too. The chapter also investigates the application of this technique in the field of image processing. In fact, the GA algorithm is employed to reconstruct a binary image from a completely random image.

AB - Genetic Algorithm (GA) is one of the most well-regarded evolutionary algorithms in the history. This algorithm mimics Darwinian theory of survival of the fittest in nature. This chapter presents the most fundamental concepts, operators, and mathematical models of this algorithm. The most popular improvements in the main component of this algorithm (selection, crossover, and mutation) are given too. The chapter also investigates the application of this technique in the field of image processing. In fact, the GA algorithm is employed to reconstruct a binary image from a completely random image.

UR - http://www.scopus.com/inward/record.url?scp=85061340811&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-12127-3_5

DO - 10.1007/978-3-030-12127-3_5

M3 - Chapter

AN - SCOPUS:85061340811

T3 - Studies in Computational Intelligence

BT - Studies in Computational Intelligence

PB - Springer Verlag

An official website of the United States government

The .gov means it’s official. Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

The site is secure. The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

• Publications
• Account settings
• My Bibliography
• Collections
• Citation manager

Save citation to file

Email citation, add to collections.

• Create a new collection
• Add to an existing collection

Add to My Bibliography

Your saved search, create a file for external citation management software, your rss feed.

• Search in PubMed
• Search in NLM Catalog
• Add to Search

A review on genetic algorithm: past, present, and future

Affiliation.

• 1 Computer Science and Engineering Department, National Institute of Technology, Hamirpur, India.
• PMID: 33162782
• PMCID: PMC7599983
• DOI: 10.1007/s11042-020-10139-6

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.

Keywords: Crossover; Evolution; Genetic algorithm; Metaheuristic; Mutation; Optimization; Selection.

© Springer Science+Business Media, LLC, part of Springer Nature 2020.

PubMed Disclaimer

Classification of metaheuristic Algorithms

Operators used in GA

Swapping genetic information after a…

Swapping genetic information after a crossover point

Swapping genetic information between crossover…

Swapping genetic information between crossover points

Swapping individual genes

Partially matched crossover (PMX) [117]

Cycle Crossover (CX) [140]

Local and global optima [149]

Similar articles

• Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem. Contreras-Bolton C, Parada V. Contreras-Bolton C, et al. PLoS One. 2015 Sep 14;10(9):e0137724. doi: 10.1371/journal.pone.0137724. eCollection 2015. PLoS One. 2015. PMID: 26367182 Free PMC article.
• Differential evolution with ranking-based mutation operators. Gong W, Cai Z. Gong W, et al. IEEE Trans Cybern. 2013 Dec;43(6):2066-81. doi: 10.1109/TCYB.2013.2239988. IEEE Trans Cybern. 2013. PMID: 23757516
• Genetic algorithm for dyad pattern finding in DNA sequences. Zare-Mirakabad F, Ahrabian H, Sadeghi M, Hashemifar S, Nowzari-Dalini A, Goliaei B. Zare-Mirakabad F, et al. Genes Genet Syst. 2009 Feb;84(1):81-93. doi: 10.1266/ggs.84.81. Genes Genet Syst. 2009. PMID: 19420804
• A Comprehensive Review of Bat Inspired Algorithm: Variants, Applications, and Hybridization. Shehab M, Abu-Hashem MA, Shambour MKY, Alsalibi AI, Alomari OA, Gupta JND, Alsoud AR, Abuhaija B, Abualigah L. Shehab M, et al. Arch Comput Methods Eng. 2023;30(2):765-797. doi: 10.1007/s11831-022-09817-5. Epub 2022 Sep 21. Arch Comput Methods Eng. 2023. PMID: 36157973 Free PMC article. Review.
• Dragonfly Algorithm and Its Applications in Applied Science Survey. Rahman CM, Rashid TA. Rahman CM, et al. Comput Intell Neurosci. 2019 Dec 6;2019:9293617. doi: 10.1155/2019/9293617. eCollection 2019. Comput Intell Neurosci. 2019. PMID: 31885533 Free PMC article. Review.
• GA-GBLUP: leveraging the genetic algorithm to improve the predictability of genomic selection. Xu Y, Zhang Y, Cui Y, Zhou K, Yu G, Yang W, Wang X, Li F, Guan X, Zhang X, Yang Z, Xu S, Xu C. Xu Y, et al. Brief Bioinform. 2024 Jul 25;25(5):bbae385. doi: 10.1093/bib/bbae385. Brief Bioinform. 2024. PMID: 39101500 Free PMC article.
• Uncertainty quantification in neural-network based pain intensity estimation. Ozek B, Lu Z, Radhakrishnan S, Kamarthi S. Ozek B, et al. PLoS One. 2024 Aug 1;19(8):e0307970. doi: 10.1371/journal.pone.0307970. eCollection 2024. PLoS One. 2024. PMID: 39088473 Free PMC article.
• Prediction of Geometric Characteristics of Laser Cladding Layer Based on Least Squares Support Vector Regression and Crested Porcupine Optimization. Li X, Xu J, Wang J, Lu Y, Han J, Guo B, Xie T. Li X, et al. Micromachines (Basel). 2024 Jul 16;15(7):919. doi: 10.3390/mi15070919. Micromachines (Basel). 2024. PMID: 39064430 Free PMC article.
• An optimized method for mulberry silkworm, Bombyx mori (Bombycidae:Lepidoptera) sex classification using TLBPSGA-RFEXGBoost. Thomas S, Thomas J. Thomas S, et al. Biol Open. 2024 Jul 15;13(7):bio060468. doi: 10.1242/bio.060468. Epub 2024 Jul 18. Biol Open. 2024. PMID: 38885006 Free PMC article.
• ChatMOF: an artificial intelligence system for predicting and generating metal-organic frameworks using large language models. Kang Y, Kim J. Kang Y, et al. Nat Commun. 2024 Jun 3;15(1):4705. doi: 10.1038/s41467-024-48998-4. Nat Commun. 2024. PMID: 38830856 Free PMC article.
• Abbasi M, Rafiee M, Khosravi MR, Jolfaei A, Menon VG, Koushyar JM (2020) An efficient parallel genetic algorithm solution for vehicle routing problem in cloud implementation of the intelligent transportation systems. Journal of cloud Computing 9(6)
• Abdelghany A, Abdelghany K, Azadian F. Airline flight schedule planning under competition. Comput Oper Res. 2017;87:20–39.
• Abdulal W, Ramachandram S. Reliability-aware genetic scheduling algorithm in grid environment. Katra, Jammu: International Conference on Communication Systems and Network Technologies; 2011. pp. 673–677.
• Abdullah J. Multiobjectives ga-based QoS routing protocol for mobile ad hoc network. Int J Grid Distrib Comput. 2010;3(4):57–68.
• Abo-Elnaga Y, Nasr S. Modified evolutionary algorithm and chaotic search for Bilevel programming problems. Symmetry. 2020;12:767.

Related information

Linkout - more resources, full text sources.

• Europe PubMed Central
• PubMed Central

Other Literature Sources

• The Lens - Patent Citations

Miscellaneous

• NCI CPTAC Assay Portal
• Citation Manager

NCBI Literature Resources

MeSH PMC Bookshelf Disclaimer

The PubMed wordmark and PubMed logo are registered trademarks of the U.S. Department of Health and Human Services (HHS). Unauthorized use of these marks is strictly prohibited.

Genetic Algorithm: Review and Application

4 Pages Posted: 3 Mar 2020

Manoj Kumar

Dr. mohammad husain.

Azad Institute of Engineering and Technology; Islamic University of Madinah, KSA

Naveen Upreti

International Institute for Special Education

Deepti Gupta

Date Written: December 1, 2010

Genetic algorithms are considered as a search process used in computing to find exact or a approximate solution for optimization and search problems. There are also termed as global search heuristics. These techniques are inspired by evolutionary biology such as inheritance mutation, selection and cross over. These algorithms provide a technique for program to automatically improve their parameters. This paper is an introduction of genetic algorithm approach including various applications and described the integration of genetic algorithm with object oriented programming approaches.

Keywords: Genetic Algorithm, Chromosome, Evolutionary Algorithm, Selection, Mutation

Suggested Citation: Suggested Citation

Manoj Kumar (Contact Author)

Iise ( email ).

Kalyanpur Lucknow, 226022 India 9956010822 (Phone)

Mohammad Husain

Azad institute of engineering and technology ( email ).

Lucknow India

Islamic University of Madinah, KSA ( email )

Prince Naif Ibn Abdulaziz Road Al Jamiah Medina Saudi Arabia

International Institute for Special Education ( email )

Kalyanpur Lucknow, 226022 India

Do you have a job opening that you would like to promote on SSRN?

Paper statistics, related ejournals, computation theory ejournal.

Subscribe to this fee journal for more curated articles on this topic

Electrical Engineering eJournal

Biomaterials ejournal.

Information

• Author Services

Initiatives

You are accessing a machine-readable page. In order to be human-readable, please install an RSS reader.

All articles published by MDPI are made immediately available worldwide under an open access license. No special permission is required to reuse all or part of the article published by MDPI, including figures and tables. For articles published under an open access Creative Common CC BY license, any part of the article may be reused without permission provided that the original article is clearly cited. For more information, please refer to https://www.mdpi.com/openaccess .

Feature papers represent the most advanced research with significant potential for high impact in the field. A Feature Paper should be a substantial original Article that involves several techniques or approaches, provides an outlook for future research directions and describes possible research applications.

Feature papers are submitted upon individual invitation or recommendation by the scientific editors and must receive positive feedback from the reviewers.

Editor’s Choice articles are based on recommendations by the scientific editors of MDPI journals from around the world. Editors select a small number of articles recently published in the journal that they believe will be particularly interesting to readers, or important in the respective research area. The aim is to provide a snapshot of some of the most exciting work published in the various research areas of the journal.

Original Submission Date Received: .

• Active Journals
• Find a Journal
• Proceedings Series
• For Authors
• For Reviewers
• For Editors
• For Librarians
• For Publishers
• For Societies
• For Conference Organizers
• Open Access Policy
• Institutional Open Access Program
• Special Issues Guidelines
• Editorial Process
• Research and Publication Ethics
• Article Processing Charges
• Testimonials
• Preprints.org
• SciProfiles
• Encyclopedia

Article Menu

• Subscribe SciFeed
• Recommended Articles
• Google Scholar
• on Google Scholar
• Table of Contents

Find support for a specific problem in the support section of our website.

Please let us know what you think of our products and services.

Visit our dedicated information section to learn more about MDPI.

JSmol Viewer

Indoor infrared sensor layout optimization for elderly monitoring based on fused genetic gray wolf optimization (fggwo) algorithm, 1. introduction, 2. fggwo algorithm for indoor infrared sensor layout, 2.1. fggwo algorithm, 2.1.1. weighting matrix, 2.1.2. sparse weight matrices, 2.1.3. fggwo combination algorithm, genetic algorithm part, gray wolf optimization algorithm section, fggwo combined algorithm, processing of weight matrices, 3. experimental and discussion, 3.1. experimental conditions, 3.2. data acquisition, 3.3. infrared sensor layout, 3.4. analysis of results, 3.5. comprehensive comparative analysis, 4. conclusions, author contributions, institutional review board statement, informed consent statement, data availability statement, conflicts of interest.

• U.N.ESCAP. Asia-Pacific Report on Population Ageing 2022: Trends, Policies and Good Practices Regarding Older Persons and Population Ageing. 2022. Available online: https://repository.unescap.org/handle/20.500.12870/4963 (accessed on 30 April 2024).
• Bloom, D.E.; Luca, D.L. The global demography of aging: Facts, explanations, future. In Handbook of the Economics of Population Aging ; North-Holland: Amsterdam, The Netherlands, 2016; Volume 1, pp. 3–56. [ Google Scholar ]
• Padeiro, M.; Santana, P.; Grant, M. Global aging and health determinants in a changing world. In Aging ; Academic Press: Cambridge, MA, USA, 2023; pp. 3–30. [ Google Scholar ]
• Kivimäki, T.; Stolt, M.; Charalambous, A.; Suhonen, R. Safety of older people at home: An integrative literature review. Int. J. Older People Nurs. 2020 , 15 , e12285. [ Google Scholar ]
• Cantone, A.A.; Esposito, M.; Perillo, F.P.; Romano, M.; Sebillo, M.; Vitiello, G. Enhancing Elderly Health Monitoring: Achieving Autonomous and Secure Living through the Integration of Artificial Intelligence, Autonomous Robots, and Sensors. Electronics 2023 , 12 , 3918. [ Google Scholar ] [ CrossRef ]
• Majumder, S.; Aghayi, E.; Noferesti, M.; Memarzadeh-Tehran, H.; Mondal, T.; Pang, Z.; Deen, M.J. Smart Homes for Elderly Healthcare—Recent Advances and Research Challenges. Sensors 2017 , 17 , 2496. [ Google Scholar ] [ CrossRef ]
• Diraco, G.; Leone, A.; Siciliano, P. A Radar-Based Smart Sensor for Unobtrusive Elderly Monitoring in Ambient Assisted Living Applications. Biosensors 2017 , 7 , 55. [ Google Scholar ] [ CrossRef ]
• Kekade, S.; Hseieh, C.H.; Islam, M.M.; Atique, S.; Khalfan, A.M.; Li, Y.C.; Abdul, S.S. The usefulness and actual use of wearable devices among the elderly population. Comput. Meth. Programs Biomed. 2018 , 153 , 137–159. [ Google Scholar ]
• Ahmed, S.; Irfan, S.; Kiran, N.; Masood, N.; Anjum, N.; Ramzan, N. Remote Health Monitoring Systems for Elderly People: A Survey. Sensors 2023 , 23 , 7095. [ Google Scholar ] [ CrossRef ] [ PubMed ]
• Uddin, M.Z.; Khaksar, W.; Torresen, J. Ambient sensors for elderly care and independent living: A survey. Sensors 2018 , 18 , 2027. [ Google Scholar ] [ CrossRef ] [ PubMed ]
• Wang, Y.; Chen, Y.; Yao, Y.; Ou, J. Advancements in Optimal Sensor Placement for Enhanced Structural Health Monitoring: Current Insights and Future Prospects. Buildings 2023 , 13 , 3129. [ Google Scholar ] [ CrossRef ]
• Hassani, S.; Dackermann, U. A systematic review of advanced sensor technologies for non-destructive testing and structural health monitoring. Sensors 2023 , 23 , 2204. [ Google Scholar ] [ CrossRef ]
• Hassani, S.; Dackermann, U. A Systematic Review of Optimization Algorithms for Structural Health Monitoring and Optimal Sensor Placement. Sensors 2023 , 23 , 3293. [ Google Scholar ] [ CrossRef ] [ PubMed ]
• Bidar, O.; Anderson, S.R.; Qin, N. Sensor placement for data assimilation of turbulence models using eigenspace perturbations. Phys. Fluids 2024 , 36 , 015144. [ Google Scholar ]
• Seaman, K.; Ludlow, K.; Wabe, N.; Dodds, L.; Siette, J.; Nguyen, A.; Jorgensen, M.; Lord, S.R.; Close, J.C.; O’Toole, L.; et al. The use of predictive fall models for older adults receiving aged care, using routinely collected electronic health record data: A systematic review. BMC Geriatr. 2022 , 22 , 210. [ Google Scholar ]
• Anitha, G.; Priya, S.B. Vision Based Real Time Monitoring System for Elderly Fall Event Detection Using Deep Learning. Comput. Syst. Sci. Eng. 2022 , 42 , 88–103. [ Google Scholar ] [ CrossRef ]
• Vitayasak, S.; Pongcharoen, P.; Hicks, C. A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm. Int. J. Prod. Econ. 2017 , 190 , 146–157. [ Google Scholar ]
• Song, D.; Yan, J.; Zeng, H.; Deng, X.; Yang, J.; Qu, X.; Rizk-Allah, R.M.; Snášel, V.; Joo, Y.H. Topological Optimization of an Offshore-Wind-Farm Power Collection System Based on a Hybrid Optimization Methodology. J. Mar. Sci. Eng. 2023 , 11 , 279. [ Google Scholar ] [ CrossRef ]
• Wu, Y.; Hao, Y.; Yong, L.; Rong, X. A clustering routing algorithm based on wolf pack algorithm for heterogeneous wireless sensor networks. Comput. Netw. 2020 , 167 , 106994. [ Google Scholar ]
• Kumar, S.; Kumar, H.; Kumar, G.; Singh, S.P.; Bijalwan, A.; Diwakar, M. A methodical exploration of imaging modalities from dataset to detection through machine learning paradigms in prominent lung disease diagnosis: A review. BMC Med. Imag. 2024 , 24 , 30. [ Google Scholar ]
• Xu, Z.; Guo, Y.; Saleh, J.H. Multi-objective optimization for sensor placement: An integrated combinatorial approach with reduced order model and Gaussian process. Measurement 2022 , 187 , 110370. [ Google Scholar ]
• Paris, R.; Beneddine, S.; Dandois, J. Robust flow control and optimal sensor placement using deep reinforcement learning. J. Fluid Mech. 2021 , 913 , A25. [ Google Scholar ]
• Aivaliotis-Apostolopoulos, P.; Loukidis, D. Swarming genetic algorithm: A nested fully coupled hybrid of genetic algorithm and particle swarm optimization. PLoS ONE 2022 , 17 , e0275094. [ Google Scholar ]
• Wei, L.; Xv, S.; Li, B. Short-term wind power prediction using an improved grey wolf optimization algorithm with back-propagation neural network. Clean Energy 2022 , 6 , 288–296. [ Google Scholar ]
• Zhang, R.; Mak, S.; Dunson, D. Gaussian process subspace prediction for model reduction. SIAM J. Sci. Comput 2022 , 44 , A1428–A1449. [ Google Scholar ]
• Vouros, G.A. Explainable deep reinforcement learning: State of the art and challenges. ACM Comput. Surv 2022 , 55 , 1–39. [ Google Scholar ]
• Newaz, N.T.; Hanada, E. The Methods of Fall Detection: A Literature Review. Sensors 2023 , 23 , 5212. [ Google Scholar ] [ CrossRef ]
• Chen, M.; Wang, H.; Yu, L.; Yeung, E.H.K.; Luo, J.; Tsui, K.-L.; Zhao, Y. A Systematic Review of Wearable Sensor-Based Technologies for Fall Risk Assessment in Older Adults. Sensors 2022 , 22 , 6752. [ Google Scholar ] [ CrossRef ]
• Bezold, J.; Krell-Roesch, J.; Eckert, T.; Jekauc, D.; Woll, A. Sensor-based fall risk assessment in older adults with or without cognitive impairment: A systematic review. Eur. Rev. Aging Phys. Act. 2021 , 18 , 1–14. [ Google Scholar ]
• Alabdulkreem, E.; Alduhayyem, M.; Al-Hagery, M.A.; Motwakel, A.; Hamza, M.A.; Marzouk, R. Artificial Rabbit Optimizer with deep learning for fall detection of disabled people in the IoT Environment. AIMS Math. 2024 , 9 , 15486–15504. [ Google Scholar ]
• Krishnamurthi, R.; Kumar, A.; Gopinathan, D.; Nayyar, A.; Qureshi, B. An Overview of IoT Sensor Data Processing, Fusion, and Analysis Techniques. Sensors 2020 , 20 , 6076. [ Google Scholar ] [ CrossRef ]
• Howcroft, J.; Kofman, J.; Lemaire, E.D. Review of fall risk assessment in geriatric populations using inertial sensors. J. NeuroEng. Rehabil. 2013 , 10 , 91. [ Google Scholar ]
• Larik, R.M.; Mustafa, M.W.; Aman, M.N.; Jumani, T.A.; Sajid, S.; Panjwani, M.K. An Improved Algorithm for Optimal Load Shedding in Power Systems. Energies 2018 , 11 , 1808. [ Google Scholar ] [ CrossRef ]
• Yang, D.; Yu, Z.; Yuan, H.; Cui, Y. An improved genetic algorithm and its application in neural network adversarial attack. PLoS ONE 2022 , 17 , e0267970. [ Google Scholar ]
• Sánchez-Ibáñez, J.R.; Pérez-del-Pulgar, C.J.; García-Cerezo, A. Path Planning for Autonomous Mobile Robots: A Review. Sensors 2021 , 21 , 7898. [ Google Scholar ] [ CrossRef ]
• Liu, H.; Lang, B. Machine Learning and Deep Learning Methods for Intrusion Detection Systems: A Survey. Appl. Sci. 2019 , 9 , 4396. [ Google Scholar ] [ CrossRef ]
• Jalal, A.; Kamal, S.; Kim, D. A Depth Video Sensor-Based Life-Logging Human Activity Recognition System for Elderly Care in Smart Indoor Environments. Sensors 2014 , 14 , 11735–11759. [ Google Scholar ] [ CrossRef ] [ PubMed ]
• Bajaj, A.; Sangwan, O.P. A systematic literature review of test case prioritization using genetic algorithms. IEEE Access 2019 , 7 , 126355–126375. [ Google Scholar ]
• Li, Y.; Lin, X.; Liu, J. An improved gray wolf optimization algorithm to solve engineering problems. Sustainability 2021 , 13 , 3208. [ Google Scholar ] [ CrossRef ]
• Lim, S.M.; Sultan, A.B.M.; Sulaiman, M.N.; Mustapha, A.; Leong, K.Y. Crossover and mutation operators of genetic algorithms. Int. J. Mach. Learn. Comput. 2017 , 7 , 9–12. [ Google Scholar ]
• Ozsoydan, F.B. Effects of dominant wolves in grey wolf optimization algorithm. Appl. Soft. Comput. 2019 , 83 , 105658. [ Google Scholar ]
• Teng, Z.; Lv, J.; Guo, L. An improved hybrid grey wolf optimization algorithm. Soft Comput. 2019 , 23 , 6617–6631. [ Google Scholar ]
• Akram, A.; Zafar, K.; Mian, A.N.; Baig, A.R.; Almakki, R.; AlSuwaidan, L.; Khan, S. On Layout Optimization of Wireless Sensor Network Using Meta-Heuristic Approach. Comput. Syst. Sci. Eng. 2023 , 46 , 3685–3701. [ Google Scholar ]
• Zhao, Z.; Chen, K.; Liu, Y.; Bao, H. A Large-Scale Sensor Layout Optimization Algorithm for Improving the Accuracy of Inverse Finite Element Method. Sensors 2023 , 23 , 8176. [ Google Scholar ] [ CrossRef ] [ PubMed ]

Click here to enlarge figure

Share and Cite

Chen, S.; Chen, Y.; Feng, M. Indoor Infrared Sensor Layout Optimization for Elderly Monitoring Based on Fused Genetic Gray Wolf Optimization (FGGWO) Algorithm. Sensors 2024 , 24 , 5393. https://doi.org/10.3390/s24165393

Chen S, Chen Y, Feng M. Indoor Infrared Sensor Layout Optimization for Elderly Monitoring Based on Fused Genetic Gray Wolf Optimization (FGGWO) Algorithm. Sensors . 2024; 24(16):5393. https://doi.org/10.3390/s24165393

Chen, Shuwang, Yajiang Chen, and Meng Feng. 2024. "Indoor Infrared Sensor Layout Optimization for Elderly Monitoring Based on Fused Genetic Gray Wolf Optimization (FGGWO) Algorithm" Sensors 24, no. 16: 5393. https://doi.org/10.3390/s24165393

Article Metrics

Article access statistics, further information, mdpi initiatives, follow mdpi.

Subscribe to receive issue release notifications and newsletters from MDPI journals

GENETIC ALGORITHM IEEE PAPERS AND PROJECTS-2020

A genetic algorithm is a search heuristic that is inspired by Charles Darwin’s theory of natural evolution. This algorithm reflects the process of natural selection where the fittest individuals are selected for reproduction in order to produce offspring of the next generation.

FREE IEEE PAPER AND PROJECTS

Ieee projects 2022, seminar reports, free ieee projects ieee papers.

IEEE Account

• Change Username/Password
• Update Address

Purchase Details

• Payment Options
• Order History
• View Purchased Documents

Profile Information

• Communications Preferences
• Profession and Education
• Technical Interests
• US & Canada: +1 800 678 4333
• Worldwide: +1 732 981 0060
• Contact & Support
• About IEEE Xplore
• Accessibility
• Terms of Use
• Nondiscrimination Policy
• Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. © Copyright 2024 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

An Improved Genetic Algorithm for Vehicle Routing Problem with Time Window Requirements

• Conference paper
• First Online: 21 August 2024
• Cite this conference paper

• Ben Niu 9 ,
• Wenze Li 9 &
• Wenjie Yi 9  

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14789))

Included in the following conference series:

• International Conference on Swarm Intelligence

37 Accesses

This paper introduces a method for optimizing vehicle delivery routes using an enhanced genetic algorithm to improve delivery efficiency and meet time window constraints in vehicle routing problems. Delivery problems often face challenges such as variations in delivery times due to real-world disturbances and the adverse effects of early or late deliveries. To effectively mitigate these challenges, we propose a tolerance mechanism to aid the genetic algorithm in dynamically selecting routes in a timely manner, thereby enhancing its exploration capability in complex delivery environments. Through extensive experimentation across different scenarios, the algorithm performance is comprehensively evaluated and analyzed. Experimental results demonstrate that the improved genetic algorithm exhibits superior path optimization capabilities under time window constraints, thereby significantly enhancing delivery efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save.

• Get 10 units per month
• Download Article/Chapter or eBook
• 1 Unit = 1 Article or 1 Chapter
• Cancel anytime
• Available as PDF
• Read on any device
• Instant download
• Own it forever
• Available as EPUB and PDF
• Compact, lightweight edition
• Dispatched in 3 to 5 business days
• Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Bida, Z., Qiang, Y., Hairui, Z., Lin, Z.: Optimization of charging battery-swap station location of electric vehicles with an improved genetic algorithm-based model. Comput. Model. Eng. Sci. 134 (2), 1177–1194 (2023)

Google Scholar  

Huan, Z., Junhui, Z., Lihua, Y., Ziyang, Z.: Mobile edge computing servers deployment with improved genetic algorithm in cellular internet of things. China Commun. 20 (9), 215–226 (2023)

Article   Google Scholar  

Galkowski, K., Kim, Y.H.: The research of timing-optimal trajectory planning based on improved genetic algorithms. Adv. Mechatron. Control Eng. II, PTS 1–3 (433–435), 562–565 (2013)

Xiao, Y., Zhang, Y., Kaku, I.: Electric vehicle routing problem: a systematic review and a new comprehensive model with nonlinear energy recharging and consumption. Renew. Sustain. Energy Rev. 14 (16), 5131 (2021)

Pasha, J., Dulebenets, M.A., Kavoosi, M.: An optimization model and solution algorithms for the vehicle routing problem with a “Factory-in-a-Box”. IEEE Access 8 , 134743–134763 (2020)

Cao, B., Zhang, W., Wang, X.: A memetic algorithm based on two_Arch2 for multi-depot heterogeneous-vehicle capacitated arc routing problem. Swarm Evol. Comput. 63 , 100864 (2021)

Martins, L.D., Tordecilla, R.D., Castaneda, J., Juan, A.A.: Electric vehicle routing, arc routing, and team orienteering problems in sustainable transportation. Energies 14 (16), 14165131 (2021)

Mor, A., Speranza, M.G.: Vehicle routing problems over time: a survey. 4OR-Q. J. Oper. Res. 18 (2), 129–149 (2022)

Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. J. Oper. Res. 35 (2), 254–265 (1987)

Article   MathSciNet   Google Scholar  

Solomon Benchmark dataset (2008). https://www.sintef.no/projectweb/top/vrptw/solomonbenchmark/

Shadrach, F.D., Kandasamy, G., Raghunathan, A.: Classification of leaf diseases using modified genetic algorithm and normalized sum square deviation. Dyna-bilbao 97 (3), 263–266 (2023)

Ribeiro, M.R., Maciel, D.C.: Bayesian network structural learning using adaptive genetic algorithm with varying population size. Mach. Learn. Knowl. Extr. 5 (4), 1877–1887 (2023)

Vanneschi, L., Henriques, R., Castelli, M.: Multi-objective genetic algorithm with variable neighbourhood search for the electoral redistricting problem. Swarm Evol. Comput. 40 (36), 37–51 (2017)

Ewees, A., Al-Qaness, M.A., Abualigah, L.: Boosting arithmetic optimization algorithm with genetic algorithm operators for feature selection: case study on cox proportional hazards model. Mathematics 9 (18), 918321 (2021)

Jain, M., Saihjpal, V., Singh, N., Singh, S.B.: An overview of variants and advancements of PSO algorithm. Appl. Sci. Basel 12 (17), 8392 (2022)

Download references

Acknowledgement

This work is supported by Shenzhen Higher Education Support Plan (Project No. 20231120174835002) and National Natural Science Foundation of China (Project No.72334004).

Author information

Authors and affiliations.

College of Management, Shenzhen University, Shenzhen, 518060, China

Ben Niu, Wenze Li & Wenjie Yi

You can also search for this author in PubMed   Google Scholar

Corresponding author

Correspondence to Wenjie Yi .

Editor information

Editors and affiliations.

Peking University, Beijing, China

Southern University of Science and Technology, Shenzhen, China

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper.

Niu, B., Li, W., Yi, W. (2024). An Improved Genetic Algorithm for Vehicle Routing Problem with Time Window Requirements. In: Tan, Y., Shi, Y. (eds) Advances in Swarm Intelligence. ICSI 2024. Lecture Notes in Computer Science, vol 14789. Springer, Singapore. https://doi.org/10.1007/978-981-97-7184-4_2

Download citation

DOI : https://doi.org/10.1007/978-981-97-7184-4_2

Published : 21 August 2024

Publisher Name : Springer, Singapore

Print ISBN : 978-981-97-7183-7

Online ISBN : 978-981-97-7184-4

eBook Packages : Computer Science Computer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

• Publish with us

Policies and ethics

• Find a journal
• Track your research