摘要
以群论的观点考察货郎担问题(TSP)的等价解.指出在利用免疫遗传算法求解TSP问题时,采用平均信息量的方法计算亲和度是不合理的,并且传统的交叉算子存在缺陷.依据群论的观点,提出一种新方法计算亲和度,并提出两种新的交叉算子.
In this paper the equivalent solutions of TSP was analyzed by Using group theory. We point out that to solve TSP problem by using immune genetic algorithm, it is unreasonable to compute genetic affinity using entropy, although the classic crossover operators exist some defects. Base on the group theory, a new method to calculate affinity and two novel crossover operators was proposed.
出处
《华侨大学学报（自然科学版）》
CAS
北大核心
2007年第1期27-29,共3页
Journal of Huaqiao University(Natural Science)
基金
福建省自然科学基金资助项目(A0540005)
关键词
免疫遗传算法
遗传算法
亲和度
交叉算子
货郎担问题
immune genetic algorithm
genetic algorithm
affinity
crossover operator
traveling salesman problem
