SOFTWARE ARCHITECTURE FOR SOLVING LARGE-SCALE TRAVELING SALESMAN PROBLEM
DOI:
https://doi.org/10.30890/2567-5273.2023-26-01-063Keywords:
Traveling salesman problem, decomposition, large-scale, software, architecture, combinatorial optimization, algorithmAbstract
The architecture of a cross-platform software for solving large-scale Traveling Salesman Problem (TSP) is proposed. According to the proposed architecture, the software consists of a central control module and additional modules - input data processing, iMetrics
References
Applegate D. The Traveling Salesman Problem – A Computational Study / Applegate D.L., Bixby R.E., Chvatal V., Cook W. J. // Princeton Series in Applied Mathematics. – Princeton University Press. – 2006 . – 608 pp.
Cook W. In pursuit of the traveling salesman : mathematics at the limits of computation // Princeton University Press. – 2014. – 214 pp.
Concorde TSP Solver URL: https://www.math.uwaterloo.ca/tsp/concorde.html
LKH Version 2.0.10 (November 2022) URL: http://akira.ruc.dk/~keld/research/LKH/
Helsgaun K. An Efficient Implementation of k-Opt Moves for the Lin–Kernighan TSP Heuristic // Datalogiske Skrifter (Writings on Computer Science) . – 2006. – No. 109. – Roskilde University.
Helsgaun, K. General k-opt submoves for the Lin-Kernighan TSP heuristic. Math. Prog. Comput. – 2009 .- 1(2-3) .- pp. 119-163.
Helsgaun K., An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems. Technical Report, Roskilde University, 2017
Bazylevych R. Decomposition and scanning optimization algorithms for TSP / Bazylevych R., Kutelmakh R., Prasad B., Bazylevych L. // Proceedings of the International Conference on Theoretical and Mathematical Foundations of Computer Science. – Orlando, USA. – 2008. – pp. 110-116.
Bazylevych R. A decomposition algorithm for uniform Traveling Salesman Problem / Bazylevych R., Prasad B., Kutelmakh R., Dupas R, Bazylevych L. // Proceedings of the 4th Indian International Conference on Artificial Intelligence. – Tumkur, India. – 2009. – pp. 47-59.
R. Bazylevych, M. Palasinski, R. Kutelmakh, B. Kuz, L. Bazylevych. “Decomposition methods for large-scale TSP”. Artificial intelligence methods and techniques for business and engineering applications”, ITHEA, Rzeszow – Sofia, 2012, pp. 148-157.
Roman Bazylevych, Marek Pałasiński, Roman Kutelmakh, Bohdan Kuz, Efficient decomposition algorithms for solving large-scale TSP. In book: G. Setlak, K. Markow. Computational models for business and engineering domains. ITHEA, Rzeszow-Sofia, 2014, pp. 225-234.
Bazylevych R., Kutelmakh R., Kuz B., Dupas R., B. Prasad, Y. Haxhimusa, L. Bazylevych, A Parallel Ring Method for Solving a Large-scale Traveling Salesman Problem, I.J. Information Technology and Computer Science, 2016, 5, pp. 1-12
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Authors
This work is licensed under a Creative Commons Attribution 4.0 International License.
