摘要
针对传统遗传算法(以下简称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
