摘要： 针对 NP完全问题的TSP问题，该文提出了一种属于启发式算法的竞争演化算法。并用构造能量函数的方法证明，用这种算法能使能量函数减小，最终必找到一条有意义的路径。微机仿真结果说明，这种算法能在较少的迭代步骤内找出一条较短的路径。

关键词: NP完全问题, 货郎问题, 竞争演化, 启发式算法

Abstract: According to the NP complete problem, TSP (traveling salesman-problem), this paper proposes a heuristic algorithm, competitive evolvement algorithm, which is enlightened from the competition of biology. By constructing the energy function, it can be proved that this algorithm can find out a better path in the end. The computer simulation shows that this algorithm can find a short path in a few step of iteration.

中图分类号: 

• TP301.6