Yang Zhenqiang, Wang Changhong, Zhuang Xianyi. ADAPTIVE PROBABILITIES OF SELECTION,CROSSOVER AND MUTATION IN GENETIC ALGORITHMS[J]. Journal of Electronics & Information Technology, 2000, 22(1): 112-117.
Citation:
Yang Zhenqiang, Wang Changhong, Zhuang Xianyi. ADAPTIVE PROBABILITIES OF SELECTION,CROSSOVER AND MUTATION IN GENETIC ALGORITHMS[J]. Journal of Electronics & Information Technology, 2000, 22(1): 112-117.
Yang Zhenqiang, Wang Changhong, Zhuang Xianyi. ADAPTIVE PROBABILITIES OF SELECTION,CROSSOVER AND MUTATION IN GENETIC ALGORITHMS[J]. Journal of Electronics & Information Technology, 2000, 22(1): 112-117.
Citation:
Yang Zhenqiang, Wang Changhong, Zhuang Xianyi. ADAPTIVE PROBABILITIES OF SELECTION,CROSSOVER AND MUTATION IN GENETIC ALGORITHMS[J]. Journal of Electronics & Information Technology, 2000, 22(1): 112-117.
In this paper an adaptive genetic algorithms is presented.The adaptive method of probabilities of reproduction, crossover,and mutation which have selectivity about the operated solutions is adopted in the course of calculation.It makes the reproduction probability of the solution which has the similar fitness decrease, the probabilities of crossover and mutation increase, hence it inaintains the diversity in the population and sustains the search capacity of the genetic algorithms．The method is tested by the genetic algorithm testing functions.
Holland J H．Adaptation in Nature and Artificial Systems．Michigan: The University of Michigan Press,1975．[2]Srinivas M. Patnaik L M．Adaptive probabilities of crossover and mutation in genetic algorithms，IEEE Trans.on SMC, 1994，SMC-24(4)：656-667[3]丁承民，张传生，刘辉．遗传算法纵横谈．信息与控制，1997，26(1)：40-47.
DownLoad: