10.48788/DVUA/7P2OE6Anisa, KasimKasimAnisa0000-0003-3627-3855V.M. Glushkov Institute of Cybernetics of the NAS of UkraineAlexandr, PalaginPalaginAlexandr0000-0003-3223-1391V.M. Glushkov Institute of Cybernetics of the NAS of UkrainePetro, StetsyukStetsyukPetro0000-0003-4036-2543V.M. Glushkov Institute of Cybernetics of the NAS of UkraineOlha, KhomiakKhomiakOlha0000-0002-5384-9070V.M. Glushkov Institute of Cybernetics of the NAS of UkraineDataverseUA2025Computer and Information Sciencesymmetric traveling salesman problem, NEOS server, Concorde solver, Lin-Kernighan algorithm, settlements of Kyiv regionAnisa, KasimKasimAnisaV.M. Glushkov Institute of Cybernetics of the NAS of Ukraine2025-12-112025-12-1375544194581942323793237931945719423111048934718480011315117824text/tab-separated-valuestext/plaintext/plainapplication/octet-streamapplication/octet-streamtext/plaintext/plainimage/pngimage/pngimage/pngimage/pngtext/plain1.0CC0 1.0The dataset includes geographic and Euclidean coordinates of 1354 locations in Kyiv region (including Kyiv city) and contains both input and output data for solving the symmetric traveling salesman problem (STSP) using Euclidean (L2) and Manhattan (L1) metrics. The dataset is intended for testing, validation and comparative analysis of algorithms for solving STSP using Concorde solver with different metrics. Both exact algorithms and Lin-Kernighan heuristic approach are supported. The dataset is suitable for use in educational purposes, scientific research on combinatorial optimization, as well as in modeling transport logistics problems and integration with applied geographic information systems.