旅行商问题是一个典型的NP完全性问题。本文基于改进的自适应遗传

算法设计并开发了一个求解旅行商问题的软件程序，并将此程序进行了48

个城市的TSP问题计算，与模拟退火算法的计算过程及计算结果进行了比

较。文中给出了遗传算法在解决TSP问题中的参数选择和编码方式、适应

度函数的设计、种群的初始化和遗传算子的详细设计。通过对此程序的改

装，即可用于其他NP完全性问题的求解。-The traveling salesman problem is a typical NP problem.This paper

implements a program to resolve the TSP problem according to the improved

Genetic Algorithm,and calculate a TSP problem of 48 cites.Comparing the

calculation result of GA program and Simulated Annealing Algorithm.This

paper describes the parameters selection and the coding method,fitness

function design,population’s initialization and genetic operators’design in

the program of resolving the TSP using the improved genetic algorithm.

The result proves that the improved GA program excels the SA program.

The improved GA program can get the satisfied result in a short time.