摘要
利用基本遗传算法的思路解决旅行商问题,选择仍然采用轮盘选择方法;交叉算法采用一个启发式交叉算法,交叉位置随机,该算法以一定的概率生成一个比父代好的解,交叉概率取0.1;变异概率0.005。经多次运行,求得最优值。停止法则为循环最大遗传代数为止,另外如果30代解没有改进则停止。编程环境为Mat-lab6.5。
By analyzing the thought of basic genetic algorithm in solving the Traveler' s Sale Problem, roulette wheel selection is also chosen ; crossover method is a the heuristic method of crossover algorithm, the crossover location is random, this algorithm generates a better answer by fixed chances, the chance of crossover is 0. 1 ;and the chance of mutation is 0.005. the best answer is given by running program repeatedly. It is not stopped untill the maximum genetic generation, and it will stopped when 30 generations are not improved. The environment of program is Matlab6.5.
出处
《河池学院学报》
2007年第2期8-11,共4页
Journal of Hechi University
关键词
遗传算法
TSP
交叉算法
启发算法
genetic algorithm
TSP
crossover algorithm
heuristic algorithm