%0 Journal Article
%T Improving Optimization Speed for Genetic Algorithms<br>遗传算法优化速度的改进
%A YANG Qi-wen
%A JIANG Jing-ping
%A ZHANG Guo-hong
%A <br>杨启文
%A 蒋静坪
%A 张国宏
%J 软件学报
%D 2001
%I 
%X The disadvantage of the traditional mutation operator of GAs was analyzed in this paper, and a DMO (dyadic mutation operator) was presented to take the place of the traditional one. The function of DMO to prevent premature convergence was also discussed. Meanwhile, according to the features of binary-based GAs, an implicit implementation for decoding the chromosomes for GAs was presented so that the run time of the improved program for GAs was shortened by 6～50 times compared with the original one. The performance of the genetic algorithm is tested based on the DMO (GADMO) in several aspects. The experimental results show that the GADMO can converge quickly and its robustness of parameters is strong. The GADMO can prevent the premature convergence effectively. By improving the mutation operator and the decoding algorithm, the optimization speed of GA is speeded up greatly.
%K genetic algorithm
%K optimization speed
%K dyadic mutation operator
%K premature convergence<br>遗传算法
%K 优化速度
%K 二元变异算子
%K 早熟收敛
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=1C12AD0ECE605660&yid=14E7EF987E4155E6&vid=59906B3B2830C2C5&iid=0B39A22176CE99FB&sid=B7BFA4B351E4C682&eid=7979125BBE749348&journal_id=1000-9825&journal_name=软件学报&referenced_num=47&reference_num=5