Circular insertion method for traveling salesman problem
S.T. Liu, L. Y. Shue · Journal of the Chinese Institute of Engineers · 1981
This paper briefly reviews the Nearest Insertion, Cheapest Insertion, and the Farthest Insertion for the traveling salesman problem. An in‐depth description of the proposed Circular Insertion is subsequently made, as well as the experimental results of the four methods on a comparison basis. Computational efficiency of the Circular Insertion over the other three methods is cited, and formally compared through the number of computer comparison operations required by each method.