%0 Journal Article
%T On the “Onion Husk” Algorithm for Approximate Solution of the Traveling Salesman Problem
%A Mikhail E. Abramyan
%A Nikolai I. Krainiukov
%A Boris F. Melnikov
%J Journal of Applied Mathematics and Physics
%P 1557-1570
%@ 2327-4379
%D 2024
%I Scientific Research Publishing
%R 10.4236/jamp.2024.124095
%X &lt;div style=&quot;text-align:justify;&quot;&gt;
	The paper describes some implementation aspects of an algorithm for approximate solution of the traveling salesman problem based on the construction of convex closed contours on the initial set of points (“cities”) and their subsequent combination into a closed path (the so-called contour algorithm or “onion husk” algorithm). A number of heuristics related to the different stages of the algorithm are considered, and various variants of the algorithm based on these heuristics are analyzed. Sets of randomly generated points of different sizes (from 4 to 90 and from 500 to 10,000) were used to test the algorithms. The numerical results obtained are compared with the results of two well-known combinatorial optimization algorithms, namely the algorithm based on the branch and bound method and the simulated annealing algorithm.
&lt;/div&gt;
%K Branch and Bound Method
%K Contour Algorithm
%K “Onion Husk” Algorithm
%K Simulated Annealing Method
%K Traveling Salesman Problem
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=132998