The Analysis And Development Of Algorithms For Traveling In Huabei Area

During the vacation, tourism has become the pursuit of fashion, in limited holidays, how to arrange the tours reasonably has become a hot topic of conversation. In fact, reasonable arrangement for tours is a traveling salesman problem. TSP is a classic combination of optimization problems, and also an NP-hard problem. But it is very broadly applied in practice. Over the years, the goal which has been worked by people is not only to find an existing high-quality solution, but also to find the rapid convergence algorithm.In the past few years there have been many new results of traveling salesman problem. So far, there are Dijkstra (Dijkstra) algorithm, binary tree method, Floyd algorithms, neural network, genetic algorithms and other methods in the international community. Each method has its own advantages, disadvantages and limitations; however, genetic algorithm is the most appropriate method to solve the traveling salesman problem.This article is for the tourist routes in North China region. First, analyses the existing algorithms systematically and point out the advantages and disadvantages. Second, discusses some different genetic algorithm for the traveling salesman problem in details summarized these programs' working aspect and their advantages and disadvantages, then introduced my own improved program. Finally this paper develops the improved program for best tourist routes among the North China's identical view spots by VC + + program.