期刊文献+

TSP问题的一种改进遗传算法 被引量:19

Ameliorative Genetic Algorithm of TSP
下载PDF
导出
摘要 针对传统遗传算法(以下简称GA)解决旅行商问题(以下简称TSP)时存在的缺陷与不足,对传统GA的结构加以改进,并提出OX改良算子、贪婪倒位变异算子、组合变异算子等,使该算法在提高搜索效率与解质量方面取得很好的综合平衡。仿真实验验证了该算法的有效性。 By analyzing the deficiency of traditional GA in solving the traveler's Sale Problem (TSP for shot), the algorithm structure of traditional genetic algorithm (GA for short) was improved, thus, it was made work more efficiently. The ameliorated OX operator, greed recessive operator and combined variation operator were contrived to achieve a balance between quality and efficiency. The emulation results proved the validity in solving TSP.
出处 《武汉理工大学学报》 EI CAS CSCD 北大核心 2006年第4期116-118,130,共4页 Journal of Wuhan University of Technology
基金 国家自然科学基金(70371063)
关键词 遗传算法 组合变异 OX改良算子 贪婪倒位变异 genetic algorithm combined variation ameliorated OX operator greed recessive variation
  • 相关文献

参考文献6

二级参考文献25

  • 1徐宗本,高勇.遗传算法过早收敛现象的特征分析及其预防[J].中国科学(E辑),1996,26(4):364-375. 被引量:99
  • 2[1]Baraglia R J I, Hidalgo R Perego. A hybrid heuristic for the traveling salesman problem. IEEE Transactions on Evolutionary Computation,2001,5 (6) : 613~622
  • 3[3]Guo T, Michalewicz Z. Inver-over operator for the TSP. In:Proceedings of the 5th Parallel Problem Solving form Nature,1998,803~812
  • 4[4]Michalewicz Z. Genetic Algorithm+ Data Structures = Evolution Programs. 3rd ed. Berlin: Springer-Verlag, 1996
  • 5[5]Merz P,Freisleben B. Genetic local search for the TSP: New results. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, 1997. 259~ 164
  • 6[6]Merz P, Freisleben B. Memetic algorithms for the traveling salesman problem. Complex System, 2001,13(4):297~345
  • 7[7]Volgenant T, Jonker R. The symmetric traveling salesman problem and edge exchanges i minima l-trees. European Journal of Operational Research, 1983,12: 394~403
  • 8[8]Carpaneto G, Fichetti M, Toth P. New lower bounds for the symmetric traveling salesman problem. Mathmatics Programming, 1989,45: 233~254
  • 9[10]Johnson D S. Local optimization and the traveling salesman problem. In: Proceedings of the 17th International Colloquium on Automata,Language and Programming,1990. 446~461
  • 10Garey M,Johnson D. Computers and Intractability. W. H. Freeman, San Francisco,1979.

共引文献89

同被引文献122

引证文献19

二级引证文献85

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部