摘要
针对利用传统的遗传编码求解TSP中,普遍存在的不能在两条染色体间的任意位置进行交叉、编码空间过大等缺点,提出了一种新的编码方案:比较编码法。理论分析和实验结果表明,所提的编码方案较传统编码方案有明显的优势。
Genetic algorithm（GA）using traditional encoding schemes can＇t cross in any position of two pieces of chromosome and the representation space is too big, Considering these shortages comparison encoding scheme is proposed, The theoretic analyses and experimental results indicate that this encoding scheme that has obvious superiority.
出处
《科学技术与工程》
2006年第2期206-208,共3页
Science Technology and Engineering
基金
国家自然科学基金(50244015)资助
关键词
比较编码法
组合优化
遗传算法TSP
comparison encoding scheme combinatorial optimization salesman problem genetic algorithm traveling
