KIAM Main page Web Library  •  Publication Searh  Русский 

KIAM Preprint № 8, Moscow, 2024
Authors: Avramenko A.D., Sudakov V.A.
Creating Synthetic Graphs for the Traveling Salesman Problem
The study is dedicated to the pressing issue of solving the Traveling Salesman Problem (TSP). The paper focuses on the development of neural network approaches to solving this problem, emphasizing the need for training models on a sufficient volume of data, which is not feasible to obtain in a reasonable time under current conditions. Therefore, the authors propose an algorithm for generating a random graph with a known shortest path or a path close to the optimal one. As a result of the study, an algorithm for augmenting adjacency matrices for the TSP with a known route was created.
synthetic data sets, traveling salesman problem, statistical test
Publication language: russian,  pages: 16
Research direction:
Mathematical modelling in actual problems of science and technics
Russian source text:
Export link to publication in format:   RIS    BibTeX
View statistics (updated once a day)
over the last 30 days — 9 (+0), total hit from 06.02.2024 — 88
About authors:
  • Avramenko Aleksandr Dmitrievich, University under the Government of the Russian Federation
  • Sudakov Vladimir Anatolievich, RAS; Financial University under the Government of the Russian Federation