Yang Chen
ABSTRACT
This paper investigates how genetic algorithms (GAs) can be improved to solve large-scale and complex problems more efficiently. First of all, we review premature convergence, one of the challenges confronted with when applying GAs to real-world problems. Next, some of the methods now available to prevent premature convergence and their intrinsic defects are discussed. A qualitative analysis is then done on the cause of premature convergence that is the loss of building blocks hosted in less-fit individuals during the course of evolution. Thus, we propose a new improver - GAs with Reserve Selection (GARS), where a reserved area is set up to save potential building blocks and a selection mechanism based on individual uniqueness is employed to activate the potentials. Finally, case studies are done in a few standard problems well known in the literature, where the experimental results demonstrate the effectiveness and robustness of GARS in suppressing premature convergence, and also an enhancement is found in global optimization capacity.
- J. Andre, P. Siarry, and T. Dognon. An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization. Advances in Engineering Software, 32:49--60, 2001. Google Scholar
Digital Library
- H. G. Cobb and J. J. Grefenstette. Genetic algorithms for tracking changing environments. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 523--530, San Mateo, CA, 1993. Morgan Kaufmann. Google ScholarDigital Library
- L. Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, 1991.Google Scholar
- K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182--197, April 2002. Google ScholarDigital Library
- K. A. De Jong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Doctoral thesis, Department of Computer and Communication Sciences, University of Michigan, Ann Arbor, 1975. Google ScholarDigital Library
- D. B. Fogel. An introduction to simulated evolutionary optimization. IEEE Transactions on Neural Networks, 5(1):3--14, January 1994.Google ScholarDigital Library
- D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley Longman, 1989. Google ScholarDigital Library
- J. J. Grefenstette. Genetic algorithms for changing environments. In R. Manner and B. Manderick, editors, Parallel Problem Solving from Nature 2, pages 137--144, Amsterdam, North Holland, 1992.Google Scholar
- J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, 1975. Google ScholarDigital Library
- J. Ma and et al. The great mutation used to improve the searching quality of GA. Control Theory and Applications, 15(3):404--407, 1998. In Chinese.Google Scholar
- Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin Heidelberg New York, 1996. Google ScholarDigital Library
- NIAS DNA Bank SRS database. Website http://srs.dna.affrc.go.jp/srs8/.Google Scholar
- G. Reinelt. TSPLIB -- a traveling salesman problem library. ORSA J. Comput., 3:376--384, 1991.Google ScholarCross Ref
- M. Srinivas and L. M. Patnaik. Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics, 24(4):656--667, April 1994.Google ScholarCross Ref
- L. Wang and T. Jiang. On the complexity of multiple sequence alignment. Journal of Computational Biology, 1(4):337--348, 1994.Google ScholarCross Ref
Index Terms
- GARS: an improved genetic algorithm with reserve selection for global optimization
Recommendations
Comparative study of diversity based parallel dual population genetic algorithm for unconstrained function optimisations
The genetic algorithms GAs metaheuristic deals with large scale combinatorial optimisation problems. It is biologically inspired by the method, based on the principle of survival of the fittest. In GAs, the concept of multiple populations offers an ...
A Study of Population Diversity Using an Enhanced Brain Storm Optimization
ICCAI '20: Proceedings of the 2020 6th International Conference on Computing and Artificial IntelligenceIn evolutionary algorithm, population diversity is a vital factor for solving problems. To avoid the premature convergence, it is imperative to preserve the population diversity during the evolution. The population diversity ensures avoiding the ...
Improving the search efficiency of differential evolution algorithm by population diversity analysis and adaptation of mutation step sizes
The aim of this research work is to improve the efficiency of differential evolution (DE) algorithm, at the cases of its unsuccessful searches. Initially, this work discusses and compares different methods to measure the population diversity of DE ...
Comments