Solving TSP Problem Based on Competitive Evolvement
Li Li · Jisuanji gongcheng · 2003
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.