作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (5): 174-175,. doi: 10.3969/j.issn.1000-3428.2008.05.061

• 人工智能及识别技术 • 上一篇    下一篇

快速求解巡回施行商问题的遗传算法策略

贾丽媛,周翠红   

  1. (1. 湖南省城市学院计算机系,益阳 413000;2. 益阳市委党校,益阳 413000)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-03-05 发布日期:2008-03-05

Strategy for Generic Algorithms to Solve TSP Problem Quickly

JIA Li-yuan, ZHOU Cui-hong   

  1. (1. Dept. of Computer, Hunan City University, Yiyang 413000; 2. School of Communist Party, Yiyang City, Yiyang 413000)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-03-05 Published:2008-03-05

摘要: 传统的遗传算法收敛速度与问题解的质量是影响算法寻优性能的一对矛盾。该文提出一种新的遗传算法的控制策略——精英子空间算子、变交叉概率Pc和变异概率Pm算子和变维子空间算子。实例计算表明该算法收敛速度快,可以进一步改善遗传算法的性能。

关键词: 巡回施行商问题, 控制策略

Abstract: The convergence speed of Genetic Algorithm(GA) and the quality of problem result are the main inconsistency which affects the performance of GA. This paper proposes the control strategies of improved GA, which are the good subspace operator, the variable crossover probability and variable mutation probability operator and the variable dimension subspace operator. Experimental results show that the convergence speed of this algorithm is so fast to improve GA.

Key words: Genetic Algorithm(GA), TSP problem, control strategy

中图分类号: