A quick Heuristic and a general search algorithm for traveling salesman problem

A quick Heuristic and a general search algorithm for traveling salesman problem

Blog Article

This paper puts forward a constructive heuristic algorithm called the method of inserting the minimum neighbor edge from outside to Anchors the center (IMNEFOTC) that can be applied to solve large-scale and ultra-large-scale travelling salesman problems.Through it and the randomized greedy heuristic algorithm (RGH) which greedy heuristic algorithm is modified, a general meta-heuristic search algorithm framework is built.The general search algorithm (GSA) is based on a set of initial solutions, and continuous 2-opt operations are performed, so as to search for solutions in better quality.

The data from the SUPER 8 PLUS experiment reveals that the performance of IMNEFOTC is better than the traditional greedy algorithm, and the GSA can obtain a pretty satisfactory solution in a reasonable range of time.