基于遗传算法求解旅行商问题

Solve Travelling Salesman Problem on the Basis of Genetic Algorithm

提出一种基于生物进化论的寻优方法─—遗传算法，用以求解著名的组合优化难题─—旅行商问题，此算法与传统求解TSP问题的方法相比，具有简单、强壮、高效、高速的特点，每次皆可收到一个满意的结果，若不考虑内存限制，原则上对任何规模的对称欧几里德平面TSP问题具有通用性。

A optimizing method based on biological evolutionism—Genetic Algoriom (GA) is proposed to solve the well - known optimalization baffling problem-Travelling Salesman ProbIem (TSP). In comparison with the traditional methed, GA is simper, stronger, faster and more effective, with satisfactory converged result when it is employed. It possesses generality in principle for Euclid 2 - dimentional TSP in any scale regardless of the limitation of EMS memory.