Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver

Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver

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 intended for testing, v...

Full description

Saved in:
Bibliographic Details
Date:2025
Main Authors: Anisa, Kasim, Alexandr, Palagin, Petro, Stetsyuk, Olha, Khomiak
Published: DataverseUA 2025
Subjects:
Computer and Information Science
symmetric traveling salesman problem, NEOS server, Concorde solver, Lin-Kernighan algorithm, settlements of Kyiv region
Online Access:https://doi.org/10.48788/DVUA/7P2OE6
Tags: Add Tag
No Tags, Be the first to tag this record!
Journal Title:Open Data Repository of the National Academy of Sciences of Ukraine

Institution

Open Data Repository of the National Academy of Sciences of Ukraine
Description
Summary: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 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.

Similar Items