An Algorithm in Solving the TSP Based on the Improved Genetic Algorithm

The Traveling Salesman Problem is a famous NP - complete problem in Graph and Combinatorial Optimization. This article, proposed an improved genetic algorithm in solving the multi-constrained Traveling Salesman Problem. First of all, increase constraint conditions of the Traveling Salesman Problem, including time, area and cost constraint, at the same time design the fitness function which describes the merit of the line. Then use vertices to encode the traveling path and use the improved genetic algorithm to search the optimal path. Finally, under the condition that do not consider the region constraint, by using the obtained set of the path to get a better delineation of areas.