Featured Dataverses

In order to use this feature you must have at least one published dataverse.

Publish Dataverse

Are you sure you want to publish your dataverse? Once you do so it must remain published.

Publish Dataverse

This dataverse cannot be published because the dataverse it is in has not been published.

Delete Dataverse

Are you sure you want to delete your dataverse? You cannot undelete this dataverse.

Advanced Search

1 to 10 of 13 Results
Dec 13, 2025
Anisa, 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]
The 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 int...
Tabular Data - 73.8 KB - 5 Variables, 1354 Observations - UNF:6:LkepojHDzM92QCMow9MEvg==
Дані
Geographic (latitude, longitude) and Euclidean (X, Y) coordinates of 1354 locations in Kyiv region with their numbers and alphabetically ordered names.
Plain Text - 19.0 KB - MD5: 59148db7535d8981e8ba37537feab89b
Дані
Approximate route for L1-metric obtained by the LK algorithm. Intended for comparison with the exact solution.
Plain Text - 19.0 KB - MD5: 2aabdfae9d18760417a354f999b50e7d
Дані
The 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.
Unknown - 23.2 KB - MD5: 9d3c333e08b47aa2ba976111a7a9063c
Дані
File 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).
Unknown - 23.2 KB - MD5: 54dd05fdae8cdc44b6420dcf0f9cb765
Дані
File 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.
Plain Text - 19.0 KB - MD5: 1efb16de1a0d84affc8f493b9d7afda8
Дані
Text file with the optimal route found by Concorde for the L1 metric. Represents the optimal tour obtained by the exact solution algorithm.
Plain Text - 19.0 KB - MD5: 553c7adbdd05802d801bb74f59abff24
Дані
Text 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.
PNG Image - 108.4 KB - MD5: 7c3bfde5017ea5bc36dee1a873589704
Дані
Graphical interpretation of the approximate route for the L1 metric obtained by the LK algorithm. Serves for visual analysis of deviation from the optimal route.
PNG Image - 91.3 KB - MD5: 4de1b86c250747831d65a354f4579f3b
Дані
Visualization of the route constructed using the Lin-Kernighan algorithm for L2 metrics. Allows to visually assess the quality of the heuristic solution.
Add Data

Sign up or log in to create a dataverse or add a dataset.

Share Dataverse

Share this dataverse on your favorite social media networks.

Link Dataverse
Reset Modifications

Are you sure you want to reset the selected metadata fields? If you do this, any customizations (hidden, required, optional) you have done will no longer appear.