This article is cited in 1 scientific paper (total in 1 paper)
On the optimization and parallelizing Little algorithm for solving the Traveling Salesman Problem
V. V. Vasilchikov
P.G. Demidov Yaroslavl State University, Sovetskaya str., 14, Yaroslavl, 150000, Russia
The paper describes some ways to accelerate solving the NP-complete Traveling Salesman Problem. The classic Little algorithm belonging to the category of “branch and bound methods” can solve it both for directed and undirected graphs. However, for undirected graphs its operation can be accelerated by eliminating the consideration of branches examined earlier. The paper proposes changes to be made in the key operations of the algorithm to speed up its execution. It also describes the results of an experiment that demonstrated a significant acceleration of solving the problem by using an advanced algorithm. Another way to speed up the work is to parallelize the algorithm. For problems of this kind it is difficult to break the task into a sufficient number of subtasks having comparable complexity. Their parallelism arises dynamically during the execution. For such problems, it seems reasonable to use parallel-recursive algorithms. In our case the use of the library RPM_ParLib developed by the author was a good choice. It allows us to develop effective applications for parallel computing on a local network using any .NET-compatible programming language. We used C# to develop the programs. Parallel applications were developed as for basic and modified algorithms, the comparing of their speed was made. Experiments were performed for the graphs with the number of vertexes up to 45 and with the number of network computers up to 16. We also investigated the acceleration that can be achieved by parallelizing the basic Little algorithm for directed graphs. The results of these experiments are also presented in the paper.
Traveling Salesman Problem, Little algorithm, parallel algorithm, recursion, .NET.
PDF file (1074 kB)
V. V. Vasilchikov, “On the optimization and parallelizing Little algorithm for solving the Traveling Salesman Problem”, Model. Anal. Inform. Sist., 23:4 (2016), 401–411
Citation in format AMSBIB
\paper On the optimization and parallelizing Little algorithm for solving the Traveling Salesman Problem
\jour Model. Anal. Inform. Sist.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
V. V. Vasilchikov, “O rekursivno-parallelnom algoritme resheniya zadachi o ryukzake”, Model. i analiz inform. sistem, 25:2 (2018), 155–164
|Number of views:|