基于改进遗传算法的TSP问题求解

SOLVING TSP BASED ON AN IMPROVED GENETIC ALGORITHM

TSP问题是典型的NP完全问题 ,遗传算法是求解NP完全问题的一种常用方法。本文针对解决TSP问题 ,提出一种新的改进遗传算法。该算法用多样性维持机制来设计算法的选择机制 ,提高算法的求解性能。经过对TSP问题求解的实验 。

TSP(Traveling Salesman Problem)is a typical NP complete problem,genetic algorithm is the perfect method for solving NP complete problem.This paper proposes a new genetic algorithm using the maintaining variety mechanism to design the selection mechanism of the algorithm in order to improve the algorithm capability. We also use this algorithm to resolve the TSP and get the perfect results.