A quick Heuristic and a general search algorithm for traveling salesman problem
This paper puts forward a constructive heuristic algorithm called the method of inserting the minimum neighbor edge from outside to the center (IMNEFOTC) that can be applied to solve large-scale and ultra-large-scale travelling salesman problems.Through it and Burners the randomized greedy heuristic algorithm (RGH) which greedy heuristic algorithm