Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solverdoi:10.48788/DVUA/7P2OE6DataverseUA2025-12-131Anisa, Kasim; Alexandr, Palagin; Petro, Stetsyuk; Olha, Khomiak, 2025, "Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver", https://doi.org/10.48788/DVUA/7P2OE6, DataverseUA, V1, UNF:6:LkepojHDzM92QCMow9MEvg== [fileUNF]Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solverdoi:10.48788/DVUA/7P2OE6Anisa, KasimAlexandr, PalaginPetro, StetsyukOlha, KhomiakDataverseUAAnisa, KasimAnisa, Kasim2025-12-11Computer and Information Sciencesymmetric traveling salesman problem, NEOS server, Concorde solver, Lin-Kernighan algorithm, settlements of Kyiv regionThe 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.Kyiv_region_1354.tab13545text/tab-separated-valuesUNF:6:LkepojHDzM92QCMow9MEvg==НазванаселеногопунктуUNF:6:KnUknpHcBfS+ispHM6sk1A==Широта1354.049.196950.5407639897324630.050.233785.50.255535302806551.48571UNF:6:MakzhMfOBdItDa7B03db7g==Довгота30.2846750.6739290133833020.0.30.436152296898081354.029.2739332.15149UNF:6:xGnilk4YIYAuNyNGw+aQAg==X(м)0.0112868.0.-8745.031019202366-91144.01354.0-19484.547779.810918501506UNF:6:bBt4nhtFTsj5wNW8Zs6Gng==Y(м)-138408.0.-22988.01354.060197.58175410996-20566.80945347121116376.00.0UNF:6:x4dlDhDKrr/y/t6CiJsdsg==kr1354_L1.tspFile in TSPLIB format for L1 metric, structure similar to file for L2 metric, however distances are calculated using Manhattan metric (EDGE_WEIGHT_TYPE: MAN_2D).application/octet-streamkr1354_L2.tspFile in TSPLIB format for the L2 metric, containing a description of the traveling salesman problem, including location coordinates, with an indication of the norm type EDGE_WEIGHT_TYPE: EUC_2D.application/octet-streamLinKernigan_tour_kr1354_L1.txtApproximate route for L1-metric obtained by the LK algorithm. Intended for comparison with the exact solution.text/plainLinKernigan_tour_kr1354_L2.txtThe result of the heuristic solution of the problem for the L2 metric using the Lin-Kernighan (LK) algorithm. The route representation format is the same as in the optimal tour file.text/plainopt_tour_kr1354_L1.txtText file with the optimal route found by Concorde for the L1 metric. Represents the optimal tour obtained by the exact solution algorithm.text/plainopt_tour_kr1354_L2.txtText file with the optimal route found by Concorde for the L2 metric. Each line is a pair of vertices of the traversal order and the length between them, rounded to an integer value.text/plainviz_LinKernigan_tour_kr1354_L1.pngGraphical interpretation of the approximate route for the L1 metric obtained by the LK algorithm. Serves for visual analysis of deviation from the optimal route.image/pngviz_LinKernigan_tour_kr1354_L2.pngVisualization of the route constructed using the Lin-Kernighan algorithm for L2 metrics. Allows to visually assess the quality of the heuristic solution.image/pngviz_opt_tour_kr1354_L1.pngGraphical visualization of the exact route for the Manhattan metric. Displays the sequence of vertex traversal in a planar (2D) coordinate system.image/pngviz_opt_tour_kr1354_L2.pngGraphical visualization of the route corresponding to the optimal tour for the Euclidean metric. Constructed based on coordinates from the corresponding input file.image/pngxy_int_1354_L2_L1.txtInteger (rounded to meters) Euclidean coordinates of 1354 locations. The first line in the file indicates the number of locations. The file is intended for submission to the NEOS server via the web interface of the Concorde program (L2 and L1 modes).text/plain