改进的遗传算法求解TSP
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TP273

基金项目:

黑龙江省博士后科研启动基金项目(LBH-Q08159)


Solving TSP Based on Improved Genetic Algorithm
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    阐述了一种针对TSP问题的改进遗传算法。引入了局部优化搜索算法,加快了算法的收敛速度,减轻了初值对结果的影响。加入了改进的ox交叉算法,在交叉中合理保留了优秀个体基因的排列顺序。利用精英复制保留了优秀基因,维持了种群个体数目稳定。提出了一种新的变异算法,有效避免了路径重复,减小了运算量,提高了运算速度。

    Abstract:

    An improved genetic algorithm for TSP problem was provided. In this paper, a local optimization search algorithm was introduced to accelerate the convergence velocity and mitigated the influence of the initial value. An improved ox cross algorithm was added and the genes sequence of excellent individuals were reasonably preserved. The elite reproduction retained good genes and guaranteed the number stability of the population. A new variation algorithm was described, which avoided the duplication of the paths, reduced the computation and improved the operation speed.

    参考文献
    相似文献
    引证文献
引用本文

程孝庆,田妙苗,邵克勇,等. 改进的遗传算法求解TSP[J]. 科学技术与工程, 2011, (9): .
chengxiaoqing, tianmiaomiao, shaokeyong, et al. Solving TSP Based on Improved Genetic Algorithm[J]. Science Technology and Engineering,2011,(9).

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2010-12-30
  • 最后修改日期:2010-12-30
  • 录用日期:2011-01-05
  • 在线发布日期: 2011-02-25
  • 出版日期:
×
律回春渐,新元肇启|《科学技术与工程》编辑部恭祝新岁!
亟待确认版面费归属稿件,敬请作者关注