摘要
根据图同构遗传算法,提出了“保留最优,调节中间,淘汰最差”的确定型遗传算子策略。用实例说明了图同构遗传算法的过程,仿真计算结果也证明了该算法的有效性。
According to graph isomorphic algorithm, a deterministic genetic strategy is proposed based on the idea of preserving the best, adjusting the medium and abandoning the worst. The process of the genetic algorithm of graph isomorphs is illustrated with examples. Simulation calculating results also demonstrate the rationality and validity of this algorithm.
出处
《苏州科技学院学报（自然科学版）》
CAS
2006年第1期35-38,共4页
Journal of Suzhou University of Science and Technology （Natural Science Edition）
关键词
图的同构
邻接矩阵
遗传算法
交叉
变异
graph isomorphs
adjacency matrix
genetic algorithm
crossover
mutation
