Kalyanmoy Deb
ABSTRACT
Simulated binary crossover (SBX) is a real-parameter recombinationoperator which is commonly used in the evolutionary algorithm (EA) literature. The operatorinvolves a parameter which dictates the spread of offspring solutionsvis-a-vis that of the parent solutions. In all applications of SBX sofar, researchers have kept a fixed value throughout a simulation run. In this paper, we suggest a self-adaptive procedure of updating theparameter so as to allow a smooth navigation over the functionlandscape with iteration. Some basic principles of classicaloptimization literature are utilized for this purpose. The resultingEAs are found to produce remarkable and much better results comparedto the original operator having a fixed value of the parameter. Studieson both single and multiple objective optimization problems are madewith success.
- H.-G. Beyer and K. Deb. On the desired behavior of self-adaptive evolutionary algorithms. In Parallel Problem Solving from Nature VI (PPSN-VI), pages 59--68, 2000.Google Scholar
- K. Deb and R. B. Agrawal. Simulated binary crossover for continuous search space. Complex Systems, 9(2):115--148, 1995.Google Scholar
- K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan. A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182--197, 2002. Google ScholarDigital Library
- K. Deb, A. Anand, and D. Joshi. A computationally efficient evolutionary algorithm for real-parameter optimization. Evolutionary Computation Journal, 10(4):371--395, 2002. Google ScholarDigital Library
- K. Deb and H.-G. Beyer. Self-adaptation in real-parameter genetic algorithms with simulated binary crossover. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), pages 172--179, 1999.Google Scholar
- K. Deb and A. Kumar. Real-coded genetic algorithms with simulated binary crossover: Studies on multi-modal and multi-objective problems. Complex Systems, 9(6):431--454, 1995.Google Scholar
- L. J. Eshelman and J. D. Schaffer. Real-coded genetic algorithms and interval-schemata. In Foundations of Genetic Algorithms 2 (FOGA-2), pages 187--202, 1993.Google Scholar
- D. E. Goldberg, K. Deb, and J. H. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6(4):333--362, 1992.Google Scholar
- T. Higuchi, S. Tsutsui, and M. Yamamura. Theoretical analysis of simplex crossover for real-coded genetic algorithms. In Parallel Problem Solving from Nature (PPSN-VI), pages 365--374, 2000.Google Scholar
- J. A. Nelder and R. Mead. A simplex method for function minimization. Computer Journal, 7:308--313, 1965.Google ScholarCross Ref
- I. Ono and S. Kobayashi. A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover. In Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA-7), pages 246--253, 1997.Google Scholar
- K. V. Price, R. Storn, and J. Lampinen. Differential Evolution: A Practical Approach to Global Optimization. Springer-Verlag, Berlin, 2005. Google ScholarDigital Library
- I. Rechenberg. Evolutionsstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolution. Stuttgart: Frommann-Holzboog Verlag, 1973.Google Scholar
Index Terms
- Self-adaptive simulated binary crossover for real-parameter optimization
Recommendations
A computationally efficient evolutionary algorithm for real-parameter optimization
Due to increasing interest in solving real-world optimization problems using evolutionary algorithms (EAs), researchers have recently developed a number of real-parameter genetic algorithms (GAs). In these studies, the main research effort is spent on ...
Self-Adaptive Genetic Algorithms with Simulated Binary Crossover
Self-adaptation is an essential feature of natural evolution. However, in the context of function optimization, self-adaptation features of evolutionary search algorithms have been explored mainly with evolution strategy (ES) and evolutionary ...
Self-adaptation in real-parameter genetic algorithms with simulated binary crossover
GECCO'99: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation - Volume 1In the context of function optimization, self-adaptation features of evolutionary search algorithms have been explored only with evolution strategy (ES) and evolutionary programming (EP). In this paper, we demonstrate the self-adaptive feature of real-...
Comments