摘要
旅游商问题是典型的NP完全问题,遗传算法是求解NP完全问题的一种理想方法.本文针对求解旅游商问题,设计了遗传算法的选择、交叉和变异算子等遗传算子.最后给出算法的仿真结果.
Traveling Salesman Problem(TSP) is a typical NP-Complete problem, Genetic Algorithm (GA) is the perfect method for solving NP-Complete problem. In this paper, In order to solve the TSP problem, We design the Selection Operator、Crossover Operator and Mutation Operator of GA.then present the result in the end.
出处
《温州师范学院学报》
2002年第3期7-10,共4页
Journal of Wenzhou Teachers College(Philosophy and Social Science Edition)
