An adaptive genetic algorithm based on arctangent function
Ting Yu, Jiangqiang Hu, Jianchuan Yin, Xingxing Huo
Abstract
Ting Yu, Jiangqiang Hu, Jianchuan Yin, Xingxing Huo
Abstract
To speed up convergence rate and improve local convergence in genetic algorithm, nonlinear adaptive crossover probability and mutation probability function are designed. They are based on the arctangent function with three parameters of maximal fitness, minimal fitness and average fitness. An improved adaptive genetic algorithm is proposed based on the two designed functions. Simulation results prove that the proposed improved adaptive genetic algorithm possesses faster convergence speed than GA and AGA presented by Srinvas, stronger optimization ability and avoid the premature effectively.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
To speed up convergence rate and improve local convergence in genetic algorithm, nonlinear adaptive crossover probability and mutation probability function are designed. They are based on the arctangent function with three parameters of maximal fitness, minimal fitness and average fitness. An improved adaptive genetic algorithm is proposed based on the two designed functions. Simulation results prove that the proposed improved adaptive genetic algorithm possesses faster convergence speed than GA and AGA presented by Srinvas, stronger optimization ability and avoid the premature effectively.
Key concepts: Crossover, Fitness function, Genetic algorithm, Convergence (economics), Premature convergence, Inverse trigonometric functions, Rate of convergence, Algorithm