摘要
该文设计了求解平面TSP的一种新算法,该算法首先构建一个“基因库”,在单亲演化中使用“基因库”中的基因,并将单亲演化所产生的最好解,作为群体演化中的一个个体,再进行群体演化。在求解TSPChina144问题实验中,不仅找到迄今最好的解,而且该算法具有高效的特点。
This paper present s a new algorithm which consists of two stages:single parent evolution and population evolution.During the stage of single-parent evolution,a gene bank is used and the initial population is formed,the best solution during the process is to be saved in the population and then continue the next single-parent evolution process.When applied to solve the TSP China144Problem,the algorithm can not only find the best solution,but also show its execellent efficience.
出处
《计算机工程与应用》
CSCD
北大核心
2003年第11期75-76,125,共3页
Computer Engineering and Applications
关键词
单亲遗传算法
TSP问题
基因库
Partheno-genetic algorithm,Traveling Salesman Problem(TSP),Gene Bank
