首页> 中文期刊> 《计算机技术与发展》 >面向旅行商问题的一种改进遗传算法

面向旅行商问题的一种改进遗传算法

             

摘要

针对传统遗传算法解决组合优化领域的典型难题--旅行商问题时存在的缺陷与不足,对传统遗传算法加以改进.引入了种群熵和基因座多样性来测度种群的多样性,并利用求得的测度值修改了个体的适应度,达到了预期目的.还提出启发式交叉箅子、二分局部搜索、自适应遗传参数,使该算法在提高搜索效率与解质量方面取得了综合平衡.在算法的仿真和测试中,改进后的算法明显优于传统的遗传算法.这表明,该算法具有良好的可行性和实用性.%By analyzing the deficiency of traditional genetic algorithm in solving the traveling salesman problem,one representative problem of the combination optimization, the algorithm structure of traditional genetic algorithm was improved. Entropy and the locus of population diversity are introduced to measure the populafon diversity in this paper, and the measure values obtained are used to modify the fitness of the individual to achieve the desired purpose. Also introduces self-adjust adapt value and proposing heuristic crossover operafion, second detach local searching and self-adapt genetic parameter, the algorithm achieved a balance between quality and efficiency. According to the analysis and test,the improved genetic algorithm can get the better result than the traditional genetic algorithm. This shows that the method has better feasibility and practicability.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号