%0 Journal Article
%T A Genetic Algorithm Based on Evolutionarily Stable Strategy<br>基于进化稳定策略的遗传算法
%A SU Xiao-Hong
%A YANG Bo
%A WANG Ya-Dong
%A <br>苏小红
%A 杨博
%A 王亚东
%J 软件学报
%D 2003
%I 
%X An improved genetic algorithm based on the evolutionarily stable strategy is proposed to avoid the problem of local optimum. The key to this algorithm lies in the construction of a new mutation operator controlled by a stable factor,, which maintains the polymorphism in the colony by setting a stable factor and changing certain best seeds to mutant. Therefore, the operator can keep the number of the best individuals at a stable level when it enlarges the search space. The simulation experiments show that this algorithm can effectively avoid the premature convergence problem caused by the high selective pressure. Moreover, this algorithm improves the ability of searching an optimum solution and increases the convergent speed. This algorithm has extensive application prospects in many practical optimization problems.
%K evolutionarily stable strategy
%K genetic algorithm
%K mutation operator
%K stable factor
%K premature convergence<br>进化稳定策略
%K 遗传算法
%K 突变算子
%K 稳定参数
%K 早熟收敛
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=B622B08C70597F62&yid=D43C4A19B2EE3C0A&vid=F3583C8E78166B9E&iid=708DD6B15D2464E8&sid=F488521195FD61A9&eid=945A0D4267ABB31D&journal_id=1000-9825&journal_name=软件学报&referenced_num=30&reference_num=17