The convergence of genetic algorithm is mainly determined by its core operation crossover operation. When the objective function is a multiple hump function, traditional genetic algorithms are easily trapped into loca...The convergence of genetic algorithm is mainly determined by its core operation crossover operation. When the objective function is a multiple hump function, traditional genetic algorithms are easily trapped into local optimum, which is called premature conver- gence. In this paper, we propose a new genetic algorithm with improved arithmetic crossover operation based on gradient method. This crossover operation can generate offspring along quasi-gradient direction which is the Steepest descent direction of the value of objective function. The selection operator is also simplified, every individual in the population is given an opportunity to get evolution to avoid complicated selection algorithm. The adaptive mutation operator and the elitist strategy are also applied in this algorithm. The case 4 indicates this algorithm can faster converge to the global optimum and is more stable than the conventional genetic algorithms.展开更多
Real-coded genetic algorithm（RGA）usually meets the demand of consecutive space problem.However,compared with simple genetic algorithm（SGA）RGA also has the inherent disadvantages such as prematurity and slow conver...Real-coded genetic algorithm（RGA）usually meets the demand of consecutive space problem.However,compared with simple genetic algorithm（SGA）RGA also has the inherent disadvantages such as prematurity and slow convergence when the solution is close to the optimum solution.This paper presents an improved real-coded genetic algorithm to increase the computation efficiency and avoid prematurity,especially in the optimization of multi-modal function.In this method,mutation operation and crossover operation are improved.Examples are given to demonstrate its com p utation efficiency and robustness.展开更多
文摘The convergence of genetic algorithm is mainly determined by its core operation crossover operation. When the objective function is a multiple hump function, traditional genetic algorithms are easily trapped into local optimum, which is called premature conver- gence. In this paper, we propose a new genetic algorithm with improved arithmetic crossover operation based on gradient method. This crossover operation can generate offspring along quasi-gradient direction which is the Steepest descent direction of the value of objective function. The selection operator is also simplified, every individual in the population is given an opportunity to get evolution to avoid complicated selection algorithm. The adaptive mutation operator and the elitist strategy are also applied in this algorithm. The case 4 indicates this algorithm can faster converge to the global optimum and is more stable than the conventional genetic algorithms.
文摘Real-coded genetic algorithm（RGA）usually meets the demand of consecutive space problem.However,compared with simple genetic algorithm（SGA）RGA also has the inherent disadvantages such as prematurity and slow convergence when the solution is close to the optimum solution.This paper presents an improved real-coded genetic algorithm to increase the computation efficiency and avoid prematurity,especially in the optimization of multi-modal function.In this method,mutation operation and crossover operation are improved.Examples are given to demonstrate its com p utation efficiency and robustness.
