Program Systems: Theory and Applications
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Program Systems: Theory and Applications:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Program Systems: Theory and Applications, 2020, Volume 11, Issue 4, Pages 3–16
DOI: https://doi.org/10.25209/2079-3316-2020-11-4-3-16 (Mi ps371) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Mathematical Foundations of Programming

Optimization and parallelization of simplified Balas' and Christofides' algorithm for the traveling salesman problem

V. V. Burkhovetskiy

Southern Federal University
Full-text PDF (1577 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.25209/2079-3316-2020-11-4-3-16
Abstract: The paper describes an exact parallel algorithm for the traveling salesman problem based on simplified Balas' and Christofides' algorithm, its optimization, and improvements in its parallel efficiency. Due to the new method of passing tasks between parallel threads, the algorithm solves, on average, instances with 3000 nodes (with random edge weights) in 1 minute, and instances with 10000 nodes in 50 minutes. The algorithm can solve instances with more than 3000 nodes due to the memory usage optimization introduced in this paper.
Key words and phrases: branch-and-bound, parallel computing, traveling salesman problem, tree traversal, memory optimization.
Received: 11.04.2020
06.08.2020
Accepted: 09.10.2020
Document Type: Article
UDC: 004.832.25:519.712.45
BBC: 22.181.19:22.181.2
MSC: Primary 97K30; Secondary 97N60, 97N80
Language: Russian
Citation: V. V. Burkhovetskiy, “Optimization and parallelization of simplified Balas' and Christofides' algorithm for the traveling salesman problem”, Program Systems: Theory and Applications, 11:4 (2020), 3–16
Citation in format AMSBIB
\Bibitem{Bur20}
\by V.~V.~Burkhovetskiy
\paper Optimization and parallelization of simplified Balas' and Christofides' algorithm for the traveling salesman problem
\jour Program Systems: Theory and Applications
\yr 2020
\vol 11
\issue 4
\pages 3--16
\mathnet{http://mi.mathnet.ru/ps371}
\crossref{https://doi.org/10.25209/2079-3316-2020-11-4-3-16}
Linking options:
  • https://www.mathnet.ru/eng/ps371
  • https://www.mathnet.ru/eng/ps/v11/i4/p3
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Program Systems: Theory and Applications
    Statistics & downloads:
    Abstract page:211
    Full-text PDF :44
    References:23
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024