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...
Збережено в:
| Дата: | 2025 |
|---|---|
| Автори: | , , , |
| Опубліковано: |
DataverseUA
2025
|
| Теми: | |
| Онлайн доступ: | https://doi.org/10.48788/DVUA/7P2OE6 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Open Data Repository of the National Academy of Sciences of Ukraine |
Репозитарії
Open Data Repository of the National Academy of Sciences of Ukraine| _version_ | 1856543375764750336 |
|---|---|
| author | Anisa, Kasim Alexandr, Palagin Petro, Stetsyuk Olha, Khomiak |
| author2 | Anisa, Kasim |
| author_facet | Anisa, Kasim Anisa, Kasim Alexandr, Palagin Petro, Stetsyuk Olha, Khomiak |
| author_sort | Anisa, Kasim |
| collection | DSpace |
| description | 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. |
| id | doi-10-48788-DVUA-7P2OE6 |
| institution | Open Data Repository of the National Academy of Sciences of Ukraine |
| publishDate | 2025 |
| publisher | DataverseUA |
| record_format | dspace |
| spelling | doi-10-48788-DVUA-7P2OE62025-12-14T02:00:01ZSolutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solverhttps://doi.org/10.48788/DVUA/7P2OE6Anisa, KasimAlexandr, PalaginPetro, StetsyukOlha, KhomiakDataverseUAThe 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, Kasim |
| spellingShingle | Computer and Information Science symmetric traveling salesman problem, NEOS server, Concorde solver, Lin-Kernighan algorithm, settlements of Kyiv region Anisa, Kasim Alexandr, Palagin Petro, Stetsyuk Olha, Khomiak Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver |
| title | Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver |
| title_full | Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver |
| title_fullStr | Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver |
| title_full_unstemmed | Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver |
| title_short | Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver |
| title_sort | solutions to the symmetric traveling salesman problem for 1354 locations in the kyiv region concorde solver |
| topic | Computer and Information Science symmetric traveling salesman problem, NEOS server, Concorde solver, Lin-Kernighan algorithm, settlements of Kyiv region |
| url | https://doi.org/10.48788/DVUA/7P2OE6 |
| work_keys_str_mv | AT anisakasim solutionstothesymmetrictravelingsalesmanproblemfor1354locationsinthekyivregionconcordesolver AT alexandrpalagin solutionstothesymmetrictravelingsalesmanproblemfor1354locationsinthekyivregionconcordesolver AT petrostetsyuk solutionstothesymmetrictravelingsalesmanproblemfor1354locationsinthekyivregionconcordesolver AT olhakhomiak solutionstothesymmetrictravelingsalesmanproblemfor1354locationsinthekyivregionconcordesolver |