旅行商问题外文文献翻译.docVIP

旅行商问题外文文献翻译 () 文献出处： Mask Dorigo. Traveling salesman problem [C]// IEEE International Conference on Evolutionary Computation. IEEE, 2013,3(1), PP:30-41. 英文原文 Traveling salesman problem Mask Dorigo 1 Introduction In operational research and theoretical computer science, the Traveling Salesman Problem (TSP) is a NP-difficult combinatorial optimization problem. By giving pairs of city-to-city distances, find each city exactly one shortest trip. It is a special case of buyer travel problems. The problem was first elaborated in 1930 as one of the most in-depth research questions in mathematics problems and optimization. It becomes a benchmark for many optimization methods. Although the problem is difficult to calculate, a large number of heuristic detections and exact methods are known to solve certain situations that contain tens of thousands of cities. TSP has many applications, even based on its most essential concept itself, such as planning, logistics, and manufacturing microchips. With minor changes, it has emerged as a sub-problem in many areas, such as DNA sequencing. In these applications, the cities in the TSP represent the customers, welding points, or DNA fragments. The distance in the TSP represents the travel time or cost, or similarity measure between DNA fragments. In many applications, additional constraints, such as limited resources or time windows, make the problem quite difficult. In computational complexity theory, the decision version of the TSP (given a length L, the goal is to judge whether there is any travel shorter than L) belongs to the class of np complete problems. Therefore, it is likely that in the worst case scenario, the operating time required to solve any of the TSPs algorithms increases exponentially with the number of cities. 2 History The origin of the traveling salesman problem is still unclear. A manual of 1832 referred to the problem of travel salesmen, including examples from Germany and Switzerland. However, there is no math