Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solverhttps://doi.org/10.48788/DVUA/7P2OE6Anisa, KasimAlexandr, PalaginPetro, StetsyukOlha, KhomiakDataverseUA2025-12-132025-12-13T19:37:58ZThe 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.Computer and Information Sciencesymmetric traveling salesman problem, NEOS server, Concorde solver, Lin-Kernighan algorithm, settlements of Kyiv region2025-12-13Anisa, Kasim2025-12-11CC0 1.0