摘要
旅行商问题属于ＮＰ问题，现在还没有找到有效的解法。本文应用遗传算法对解决此类问题的有效性作了探讨。文中对遗传算子的应用，编码，参数选择及其对收敛的影响等问题作了分析与探讨。
Traveling salesman problem belongs to NP complete. Now it has not found the effective solution yet. In this paper, using genetic algorithm has been studied to solving the effectiveness of this kind of question,at same time, we analyzed and had a discussion on the application of the genetic algorithm, the coding,the choice of the parameter, the influence of the convergence,and so on.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
1997年第9期15-21,共7页
Systems Engineering-Theory & Practice
关键词
遗传算法
遗传处子
旅行商问题
NP问题
genetic algorithm
genetic operator
traveling salesman problem
