%0 Journal Article
%T Using Gene Clusters for TSP Solving Genetic Algorithm<br>引入基因簇求解TSP的遗传算法
%A MA Guang-zhi LU Yan-sheng SONG En-min TANG Hai-xian
%A <br>马光志
%A 卢炎生
%A 宋恩民
%A 汤海先
%J 计算机科学
%D 2009
%I 
%X When a genetic algorithm is used to solve the TSP(Traveling Salesman Problem),shorter paths found before are accessible to be destroyed,and thus the convergence of the genetic algorithm slows down.To prevent the shorter paths from being destroyed,the gene cluster was introduced into genetic operations so that the superior gene piece can be wholly inherited to descendent off-springs.After a near optimum is found,all gene clusters are smashed and the optimum finding process is continued for global optimums.Ex...
%K Traveling salesman problem
%K Gene cluster
%K Genetic algorithm<br>旅行商问题
%K 基因簇
%K 遗传算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=FBF791BA01BD0FC86AA896AC76E60E23&yid=DE12191FBD62783C&vid=933658645952ED9F&iid=B31275AF3241DB2D&sid=FBA00558C57D9C11&eid=1D01216AD76577EC&journal_id=1002-137X&journal_name=计算机科学&referenced_num=1&reference_num=7