Solve Travelling Salesman Problem on the Basis of Genetic Algorithm
Chuan Chen · 1999
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.