Study on Combinatorial Optimization Problem represented by TSP: Recent Research Work and Perspective
Zhijie Wang · Jisuanji fangzhen · 2007
Traveling Salesman Problem is a famous proposition in operations research and one of the most widely investigated problems as a typical one of the combinatorial optimization problems. The research work on the TSP will be influential for solving the NP problems. In this article, the basic concepts of the combinatorial problem and TSP are firstly given. Then the research history and recent advances in finding the best solution to TSP are reviewed and the comparison between traditional method and modern intelligent heuristic optimization algorithm is made emphatically. Finally the future of the TSP research and hot topics in the field of intelligent optimization algorithm are previewed. Further more, bottlenecks of the future TSP research work and the further study in the future are also foreseen.