Genetic algorithms have been extensively used as a global optimization tool. These algorithms, however, suffer from their generally slow convergence rates. This paper proposes two approaches to address this limitation...Genetic algorithms have been extensively used as a global optimization tool. These algorithms, however, suffer from their generally slow convergence rates. This paper proposes two approaches to address this limitation. First, a new crossover technique, the weighted average normally-distributed arithmetic crossover (NADX), is introduced to enhance the rate of convergence. Second, twinkling is incorporated within the crossover phase of the genetic algorithms. Twinkling is a controlled random deviation that allows only a subset of the design variables to undergo the decisions of an optimization algorithm while maintaining the remaining variable values. Two twinkling genetic algorithms are proposed. The proposed algorithmsare compared to simple genetic algorithms by using various mathematical and engineering design test problems. The results show that twinkling genetic algorithms have the ability to consistently reach known global minima, rather than nearby sub-optimal points, and are able to do this with competitive rates of convergence.展开更多
文摘Genetic algorithms have been extensively used as a global optimization tool. These algorithms, however, suffer from their generally slow convergence rates. This paper proposes two approaches to address this limitation. First, a new crossover technique, the weighted average normally-distributed arithmetic crossover (NADX), is introduced to enhance the rate of convergence. Second, twinkling is incorporated within the crossover phase of the genetic algorithms. Twinkling is a controlled random deviation that allows only a subset of the design variables to undergo the decisions of an optimization algorithm while maintaining the remaining variable values. Two twinkling genetic algorithms are proposed. The proposed algorithmsare compared to simple genetic algorithms by using various mathematical and engineering design test problems. The results show that twinkling genetic algorithms have the ability to consistently reach known global minima, rather than nearby sub-optimal points, and are able to do this with competitive rates of convergence.
