Performance tuning of genetic algorithms with reserve selection

This paper provides a deep insight into the performance of genetic algorithms with reserve selection (GARS), and investigates how parameters can be regulated to solve optimization problems more efficiently. First of all, we briefly present GARS, an improved genetic algorithm with a reserve selection mechanism which helps to avoid premature convergence. The comparable results to state-of-the-art techniques such as fitness scaling and sharing demonstrate both the effectiveness and the robustness of GARS in global optimization. Next, two strategies named static RS and dynamic RS are proposed for tuning the parameter reserve size to optimize the performance of GARS. Empirical studies conducted in several cases indicate that the optimal reserve size is problem dependent.

[1]  Kotaro Hirasawa,et al.  GARS: an improved genetic algorithm with reserve selection for global optimization , 2007, GECCO '07.

[2]  David B. Fogel,et al.  An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4]  Yee Leung,et al.  Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov chain analysis , 1997, IEEE Trans. Neural Networks.

[5]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6]  John J. Grefenstette,et al.  Genetic Algorithms for Tracking Changing Environments , 1993, ICGA.

[7]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[8]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[9]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[10]  John J. Grefenstette,et al.  Genetic Algorithms for Changing Environments , 1992, PPSN.

[11]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[12]  O. Fuentes,et al.  Generic algorithms: what fitness scaling is optimal? , 1993 .

[13]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[14]  Tao Jiang,et al.  On the Complexity of Multiple Sequence Alignment , 1994, J. Comput. Biol..

[15]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[16]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..