الگوريتم جديدي براي مساله فروشنده دوره گرد با مقياس بزرگ

A new Algorithm for Large-Scale Traveling Salesman Problems

The classic traveling - salesman problem is to determine a tour that will minimize the total distance or cost involved in visiting several cities and returning to the starting point. This paper describes a new algorithm for accelerating the computational performances of branch exchange heuristics for symmetric traveling salesman problem. The improvement in performance is obtained by considering only exchanges that have a good chance of producing a better solution. This algorithm is faster than other heuristicsʹ algorithms and computation times increase much less rapidly with problem size. The new algorithm makes it possible to solve large-scale traveling salesman problems.