连锁-遗传算法中的一种启发式方法  

LINKAGE, A KIND OF HEURISTICS IN GENETIC ALGORITHM

作　　者：黄焱[1] 王嘉松[1] 

机构地区：[1]南京大学数学系,南京210093

出　　处：《高等学校计算数学学报》1999年第2期126-131,共6页Numerical Mathematics A Journal of Chinese Universities

摘　　要：This paper put forwards a new heuristic method of applying linkage, an important concept of genetics, to genetic algorithm as a kind of heuristics. Traveling salesman problem is used to show linkage on genetic algorithm. Finally, in a test case, the solution of genetic algorithm with linkage in compared with that of genetic algorithm without linkage.This paper put forwards a new heuristic method of applying linkage, an important concept of genetics, to genetic algorithm as a kind of heuristics. Traveling salesman problem is used to show linkage on genetic algorithm. Finally, in a test case, the solution of genetic algorithm with linkage in compared with that of genetic algorithm without linkage.

关 键 词：连锁-遗传算法 启发式法 随机搜索算法 

分 类 号：O242.23[理学—计算数学]