论文信息 - A hybrid genetic algorithm for a class of global optimization problems with box constraints

A hybrid genetic algorithm for a class of global optimization problems with box constraints

In this paper, a new hybrid genetic algorithm is proposed, which combines the genetic algorithm with hill-climbing search steps differently from some former algorithms. The new algorithm can be widely applied to a class of global optimization problems for continuous functions with box constraints. Finally, numerical examples show that this algorithm can yield the global optimum with high efficiency.

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

[2] Larry J. Eshelman,et al. The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

[3] Z. J. Wu,et al. Non-numerical parallel algorithms , 1990 .

[4] Kalyanmoy Deb,et al. Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[5] Hu Jin. Analyzing Faults of GA by Extremum Element Assembling , 2003 .

[6] Larry J. Eshelman. The CHC Adaptive Search Algo-rithm , 1991 .

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