## Genetic Algorithm in Search and Optimization: The Technique and Applications (1997)

Venue: | Proc. of Int. Workshop on Soft Computing and Intelligent Systems |

Citations: | 5 - 0 self |

### BibTeX

@INPROCEEDINGS{Deb97geneticalgorithm,

author = {Kalyanmoy Deb},

title = {Genetic Algorithm in Search and Optimization: The Technique and Applications},

booktitle = {Proc. of Int. Workshop on Soft Computing and Intelligent Systems},

year = {1997},

pages = {58--87}

}

### OpenURL

### Abstract

A genetic algorithm (GA) is a search and optimization method developed by mimicking the evolutionary principles and chromosomal processing in natural genetics. A GA begins its search with a random set of solutions usually coded in binary string structures. Every solution is assigned a fitness which is directly related to the objective function of the search and optimization problem. Thereafter, the population of solutions is modified to a new population by applying three operators similar to natural genetic operators---reproduction, crossover, and mutation. A GA works iteratively by successively applying these three operators in each generation till a termination criterion is satisfied. Over the past one decade, GAs have been successfully applied to a wide variety of problems, because of their simplicity, global perspective, and inherent parallel processing. In this paper, we outline the working principle of a GA by describing these three operators and by outlining an intuitive sketch ...

### Citations

7342 | J.H.: Genetic Algorithms and - Goldberg, Holland - 1988 |

1809 | Genetic algorithms in search, optimization, and machine learning - Goldberg |

1167 | Handbook of Genetic Algorithms
- Davis
- 1991
(Show Context)
Citation Context ... one is the global optimal solution (still at (3,2)): Minimize f 2 (x 1 ; x 2 ) = (x 2 1 + x 2 \Gamma 11) 2 + (x 1 + x 2 2 \Gamma 7) 2 + 0:1[(x 1 \Gamma 3) 2 + (x 2 \Gamma 2) 2 ] \Gamma6sx 1 ; x 2s6: =-=(8)-=- A contour plot of the above function is shown in Figure 3. Figure 3: A contour plot of the multimodal function f 2 with four minima This problem is more difficult to solve than the previous function,... |

1053 | The Selfish Gene - Dawkins - 2006 |

859 | an analysis of the behavior of a class of genetic adaptive systems - Dejong - 1975 |

815 | Adaptive in Natural and Artificial Systems. Ann Arbor - Holland - 1975 |

526 | Uniform crossover in genetic algorithm - Syswerda - 1989 |

493 | Genetic algorithms with sharing for multimodal function optimization - Goldberg, Richardson - 1987 |

444 | Genetic algorithms for multiobjective Optimization: Formulation, discussion and generalization - Fonseca, Fleming - 1993 |

415 |
The blind watchmaker
- Dawkins
- 1986
(Show Context)
Citation Context ...to add an extra value (in the case of minimization problems) in the objective function, if a constraint is violated: Penalized Objective = f(x) +R 0 @ J X j=1 hg j (x)i 2 + K X k=1 [sh k (x)] 2 1 A ; =-=(10)-=- where hffi is the bracket operator and it is equal to ff is ff is negative and is equal to zero, otherwise. Notice that the inequality constraintssg j and equality constraintssh k are normalized. Rep... |

398 | Handbook of Evolutionary Computation
- Back, Fogel, et al.
- 1997
(Show Context)
Citation Context ...e upper bound solution x max i is represented by the solution (11: : :1). Any other substring s i decodes to a solution x i as follows: x i = x min i + x max i \Gamma x min i 2 ` i \Gamma 1 DV(s i ); =-=(1)-=- where DV(s i ) is the decoded value 1 of the substring s i . The length of a substring is usually decided by the precision needed in a variable. For example, if three decimal places of accuracy is ne... |

264 | An investigation of niche and species formation in genetic function optimization - Deb, Goldberg - 1989 |

261 | Neuro-Fuzzy and Soft Computing: a Computational Approach to Learning and - Jang, Sun, et al. - 1997 |

240 | Genetic algorithms, noise and the sizing of populations - Goldberg, Deb, et al. - 1992 |

225 | Schoenauer," Evolutionary Algorithms for Constrained Parameter Optimization Problems". Evolutionary computation 4(1)132,(1996 - Michalewicz |

211 | Designing neural networks using genetic algorithms - Miller, Todd, et al. - 1989 |

210 | B.L.: The gambler’s ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation 7 - Harik, Cantú-Paz, et al. - 1999 |

186 | Genetic Algorithms &Engineering design - Gen, Cheng - 1997 |

173 | Convergence analysis of canonical genetic algorithm - Rudolph - 1994 |

170 | A study of control parameters affecting online performance of genetic algorithms for function optimisation - Schaffer, Caruana, et al. - 1989 |

138 | Real-coded genetic algorithms and interval-schemata,” in Foundations of Genetic Algorithms-2 - Eshelman, Schaffer - 1993 |

126 | Simulated Binary Crossover for Continuous Search Space - Deb, Agrawal - 1995 |

122 | Nonstationary function optimization using genetic algorithms with dominance and diploidy - Goldberg, Smith - 1987 |

111 | Multiobjetive optimization using the niched pareto genetic algorithm - Horn, Nafpliotis - 1993 |

91 | Engineering Optimization Methods and Applications - Reklaitis, Ravindran, et al. - 1983 |

90 | K.: Multi-objective function optimization using nondominated sorting genetic algorithms - Srinivas, Deb - 1994 |

86 | Using genetic algorithms in engineering design optimization with nonlinear constraints - Powell, Skolnick - 1993 |

81 | D.: Toward a better understanding of mixing in genetic algorithms - Goldberg, Deb, et al. - 1993 |

81 | Design of an Adaptive Fuzzy Logic Controller using a Genetic Algorithms - Karr - 1991 |

78 | Real-coded Genetic Algorithms, Virtual Alphabets - Goldberg - 1991 |

77 | Micro-Genetic Algorithms for Stationary and Non-Stationary Function Optimization - Krishnakumar - 1989 |

76 | Punctuated equilibria in genetic search - Vose, E |

74 | Optimization For Engineering Design: Algorithms And Examples - Deb - 1995 |

70 | Optimization by simulated annealing - Kirpatrick, Gelatt, et al. - 1983 |

66 | Real-coded genetic algorithms with simulated binary crossover: Studies on multi-modal and multi-objective problems - Deb, Kumar - 1995 |

63 | Genetic Algorithms in Multi-Modal Function Optimization - Deb - 1989 |

62 |
The Behavior of Adaptive Systems Which Employ Genetic and Correlation Algorithms
- Bagley
- 1967
(Show Context)
Citation Context ...total number of alternatives in the variable must be (x max i \Gammax min i )=0:001, which can be set equal to 2 ` i and ` i can be computed as follows: ` i = log 2 ` x max i \Gamma x min i ffl i ' : =-=(2)-=- Here, the parameter ffl i is the desired precision in the i-th variable. The total string length of a N-variable solution is then ` = P N i=1 ` i . Representing a solution in a string of bits (0 or 1... |

56 | Computer-Aided Gas Pipeline Operation using Genetic Algorithm and Rule Learning - Goldberg - 1989 |

55 | An Executable Model of a Simple Genetic Algorithm. Foundations of Genetic Algorithms -2 - Whitley - 1993 |

35 |
Genetic algorithms as function optimizers. Doctoral dissertation
- Bethke
- 1981
(Show Context)
Citation Context ...ue so that solutions with smaller objective function value get larger fitness. Usually, the following transformation function is used for minimization problems: Fitness = 1 1 + f(x 1 ; : : : ; xN ) : =-=(3)-=- There are a number of advantages of using a string representation to code variables. First, this allows a shielding between the working of GA and the actual problem. What GA processes is `-bit string... |

35 | An analysis of multi point crossover - Spears, Jong - 1991 |

33 | Generalising the notion of schema in genetic algorithms - Vose - 1991 |

29 | Discrete Optimization of structure using Genetic Algorithm - Rajeev, Krishnamurthy - 1992 |

21 |
D.J.: Adaptive Search Using Simulated Evolution. Unpublished doctoral dissertation
- Cavicchio
- 1970
(Show Context)
Citation Context ...on sizing which depended on the nonlinearity in the problem. They did a statistical analysis based on correct schema processing and found the following population sizing equation: NsO(2 k oe 2 d 2 ); =-=(6)-=- where k is the order of nonlinearity, oe 2 is the variance of the problem and d is the difference in fitness values between local and global optimal solutions. This equation suggests that the populat... |

20 | Geometric Programming - Duffin, Peterson, et al. - 1967 |

18 | Optimal Initial Population Size for Binary-Coded Genetic Algorithms - Goldberg - 1985 |

17 | Macroevolutionary dynamics: Species, niches, and adaptive peaks - Eldredge - 1989 |

16 | A comparison of selection schemes used in genetic algorithms - Goldberg, Deb - 1991 |

12 |
Genetic Algorithms in Parametric Design of Aircraft
- Bramlette, Bouchard
(Show Context)
Citation Context ...search algorithm. 4.2 A Simple Simulation To illustrate the working of GA operators, we consider a simple sinusoidal function that is to be maximized (Deb, 1996): Maximize sin(x) Variable bound 0sxs: =-=(4)-=- For the illustration purpose, we use 5-bit binary strings to represent the variable x, so that there are only 2 5 or 32 strings in the search space. We use the linear mapping rule (Equation 1) betwee... |

12 | Genetic Algorithms and Fuzzy Logic Systems - SANCHEZ, SHIBATA, et al. - 1997 |