{"id":519,"identifier":"DVUA/7P2OE6","persistentUrl":"https://doi.org/10.48788/DVUA/7P2OE6","protocol":"doi","authority":"10.48788","publisher":"DataverseUA","publicationDate":"2025-12-13","storageIdentifier":"local://10.48788/DVUA/7P2OE6","datasetVersion":{"id":73,"datasetId":519,"datasetPersistentId":"doi:10.48788/DVUA/7P2OE6","storageIdentifier":"local://10.48788/DVUA/7P2OE6","versionNumber":1,"versionMinorNumber":0,"versionState":"RELEASED","UNF":"UNF:6:LkepojHDzM92QCMow9MEvg==","lastUpdateTime":"2025-12-13T19:37:58Z","releaseTime":"2025-12-13T19:37:58Z","createTime":"2025-12-11T14:21:02Z","publicationDate":"2025-12-13","citationDate":"2025-12-13","license":{"name":"CC0 1.0","uri":"http://creativecommons.org/publicdomain/zero/1.0","iconUri":"https://licensebuttons.net/p/zero/1.0/88x31.png"},"fileAccessRequest":true,"metadataBlocks":{"citation":{"displayName":"Citation Metadata","name":"citation","fields":[{"typeName":"title","multiple":false,"typeClass":"primitive","value":"Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver"},{"typeName":"author","multiple":true,"typeClass":"compound","value":[{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"Anisa, Kasim"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine"},"authorIdentifierScheme":{"typeName":"authorIdentifierScheme","multiple":false,"typeClass":"controlledVocabulary","value":"ORCID"},"authorIdentifier":{"typeName":"authorIdentifier","multiple":false,"typeClass":"primitive","value":"https://orcid.org/0000-0003-3627-3855"}},{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"Alexandr, Palagin"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine"},"authorIdentifierScheme":{"typeName":"authorIdentifierScheme","multiple":false,"typeClass":"controlledVocabulary","value":"ORCID"},"authorIdentifier":{"typeName":"authorIdentifier","multiple":false,"typeClass":"primitive","value":"https://orcid.org/0000-0003-3223-1391"}},{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"Petro, Stetsyuk"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine"},"authorIdentifierScheme":{"typeName":"authorIdentifierScheme","multiple":false,"typeClass":"controlledVocabulary","value":"ORCID"},"authorIdentifier":{"typeName":"authorIdentifier","multiple":false,"typeClass":"primitive","value":"https://orcid.org/0000-0003-4036-2543"}},{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"Olha, Khomiak"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine"},"authorIdentifierScheme":{"typeName":"authorIdentifierScheme","multiple":false,"typeClass":"controlledVocabulary","value":"ORCID"},"authorIdentifier":{"typeName":"authorIdentifier","multiple":false,"typeClass":"primitive","value":"https://orcid.org/0000-0002-5384-9070"}}]},{"typeName":"datasetContact","multiple":true,"typeClass":"compound","value":[{"datasetContactName":{"typeName":"datasetContactName","multiple":false,"typeClass":"primitive","value":"Anisa, Kasim"},"datasetContactAffiliation":{"typeName":"datasetContactAffiliation","multiple":false,"typeClass":"primitive","value":"V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine"},"datasetContactEmail":{"typeName":"datasetContactEmail","multiple":false,"typeClass":"primitive","value":"Kasim@nas.gov.ua"}}]},{"typeName":"dsDescription","multiple":true,"typeClass":"compound","value":[{"dsDescriptionValue":{"typeName":"dsDescriptionValue","multiple":false,"typeClass":"primitive","value":"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."},"dsDescriptionDate":{"typeName":"dsDescriptionDate","multiple":false,"typeClass":"primitive","value":"2025-12-11"}}]},{"typeName":"subject","multiple":true,"typeClass":"controlledVocabulary","value":["Computer and Information Science"]},{"typeName":"keyword","multiple":true,"typeClass":"compound","value":[{"keywordValue":{"typeName":"keywordValue","multiple":false,"typeClass":"primitive","value":"symmetric traveling salesman problem, NEOS server, Concorde solver, Lin-Kernighan algorithm, settlements of Kyiv region"}}]},{"typeName":"depositor","multiple":false,"typeClass":"primitive","value":"Anisa, Kasim"},{"typeName":"dateOfDeposit","multiple":false,"typeClass":"primitive","value":"2025-12-11"}]}},"files":[{"description":"Geographic (latitude, longitude) and Euclidean (X, Y) coordinates of 1354 locations in Kyiv region with their numbers and alphabetically ordered names.","label":"Kyiv_region_1354.tab","restricted":false,"version":5,"datasetVersionId":73,"categories":["Дані"],"dataFile":{"id":524,"persistentId":"","filename":"Kyiv_region_1354.tab","contentType":"text/tab-separated-values","friendlyType":"Tab-Delimited","filesize":75544,"description":"Geographic (latitude, longitude) and Euclidean (X, Y) coordinates of 1354 locations in Kyiv region with their numbers and alphabetically ordered names.","categories":["Дані"],"storageIdentifier":"local://19b0dc6b6f1-58a6318338fb","originalFileFormat":"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet","originalFormatLabel":"MS Excel Spreadsheet","originalFileSize":86100,"originalFileName":"Kyiv_region_1354.xlsx","UNF":"UNF:6:LkepojHDzM92QCMow9MEvg==","rootDataFileId":-1,"md5":"e1c65fc3f709c7e8f2809ecb3ff8cef2","checksum":{"type":"MD5","value":"e1c65fc3f709c7e8f2809ecb3ff8cef2"},"tabularData":true,"creationDate":"2025-12-11","publicationDate":"2025-12-13","fileAccessRequest":true}},{"description":"Approximate route for L1-metric obtained by the LK algorithm. Intended for comparison with the exact solution.","label":"LinKernigan_tour_kr1354_L1.txt","restricted":false,"version":3,"datasetVersionId":73,"categories":["Дані"],"dataFile":{"id":527,"persistentId":"","filename":"LinKernigan_tour_kr1354_L1.txt","contentType":"text/plain","friendlyType":"Plain Text","filesize":19458,"description":"Approximate route for L1-metric obtained by the LK algorithm. Intended for comparison with the exact solution.","categories":["Дані"],"storageIdentifier":"local://19b0dc6ba1d-c765e6f439c0","rootDataFileId":-1,"md5":"59148db7535d8981e8ba37537feab89b","checksum":{"type":"MD5","value":"59148db7535d8981e8ba37537feab89b"},"tabularData":false,"creationDate":"2025-12-11","publicationDate":"2025-12-13","fileAccessRequest":true}},{"description":"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.","label":"LinKernigan_tour_kr1354_L2.txt","restricted":false,"version":3,"datasetVersionId":73,"categories":["Дані"],"dataFile":{"id":522,"persistentId":"","filename":"LinKernigan_tour_kr1354_L2.txt","contentType":"text/plain","friendlyType":"Plain Text","filesize":19423,"description":"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.","categories":["Дані"],"storageIdentifier":"local://19b0dc6b968-825dadd702f2","rootDataFileId":-1,"md5":"2aabdfae9d18760417a354f999b50e7d","checksum":{"type":"MD5","value":"2aabdfae9d18760417a354f999b50e7d"},"tabularData":false,"creationDate":"2025-12-11","publicationDate":"2025-12-13","fileAccessRequest":true}},{"description":"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).","label":"kr1354_L1.tsp","restricted":false,"version":3,"datasetVersionId":73,"categories":["Дані"],"dataFile":{"id":523,"persistentId":"","filename":"kr1354_L1.tsp","contentType":"application/octet-stream","friendlyType":"Unknown","filesize":23793,"description":"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).","categories":["Дані"],"storageIdentifier":"local://19b0dc6b89c-178febf89969","rootDataFileId":-1,"md5":"9d3c333e08b47aa2ba976111a7a9063c","checksum":{"type":"MD5","value":"9d3c333e08b47aa2ba976111a7a9063c"},"tabularData":false,"creationDate":"2025-12-11","publicationDate":"2025-12-13","fileAccessRequest":true}},{"description":"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.","label":"kr1354_L2.tsp","restricted":false,"version":4,"datasetVersionId":73,"categories":["Дані"],"dataFile":{"id":530,"persistentId":"","filename":"kr1354_L2.tsp","contentType":"application/octet-stream","friendlyType":"Unknown","filesize":23793,"description":"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.","categories":["Дані"],"storageIdentifier":"local://19b0dc6b7e3-897ab662c028","rootDataFileId":-1,"md5":"54dd05fdae8cdc44b6420dcf0f9cb765","checksum":{"type":"MD5","value":"54dd05fdae8cdc44b6420dcf0f9cb765"},"tabularData":false,"creationDate":"2025-12-11","publicationDate":"2025-12-13","fileAccessRequest":true}},{"description":"Text file with the optimal route found by Concorde for the L1 metric. Represents the optimal tour obtained by the exact solution algorithm.","label":"opt_tour_kr1354_L1.txt","restricted":false,"version":3,"datasetVersionId":73,"categories":["Дані"],"dataFile":{"id":521,"persistentId":"","filename":"opt_tour_kr1354_L1.txt","contentType":"text/plain","friendlyType":"Plain Text","filesize":19457,"description":"Text file with the optimal route found by Concorde for the L1 metric. Represents the optimal tour obtained by the exact solution algorithm.","categories":["Дані"],"storageIdentifier":"local://19b0dc6b60f-1ad8e5f3601d","rootDataFileId":-1,"md5":"1efb16de1a0d84affc8f493b9d7afda8","checksum":{"type":"MD5","value":"1efb16de1a0d84affc8f493b9d7afda8"},"tabularData":false,"creationDate":"2025-12-11","publicationDate":"2025-12-13","fileAccessRequest":true}},{"description":"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.","label":"opt_tour_kr1354_L2.txt","restricted":false,"version":3,"datasetVersionId":73,"categories":["Дані"],"dataFile":{"id":520,"persistentId":"","filename":"opt_tour_kr1354_L2.txt","contentType":"text/plain","friendlyType":"Plain Text","filesize":19423,"description":"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.","categories":["Дані"],"storageIdentifier":"local://19b0dc6b52c-224ffcdea2db","rootDataFileId":-1,"md5":"553c7adbdd05802d801bb74f59abff24","checksum":{"type":"MD5","value":"553c7adbdd05802d801bb74f59abff24"},"tabularData":false,"creationDate":"2025-12-11","publicationDate":"2025-12-13","fileAccessRequest":true}},{"description":"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.","label":"viz_LinKernigan_tour_kr1354_L1.png","restricted":false,"version":3,"datasetVersionId":73,"categories":["Дані"],"dataFile":{"id":526,"persistentId":"","filename":"viz_LinKernigan_tour_kr1354_L1.png","contentType":"image/png","friendlyType":"PNG Image","filesize":111048,"description":"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.","categories":["Дані"],"storageIdentifier":"local://19b0dc6b210-acf1edd8d9aa","rootDataFileId":-1,"md5":"7c3bfde5017ea5bc36dee1a873589704","checksum":{"type":"MD5","value":"7c3bfde5017ea5bc36dee1a873589704"},"tabularData":false,"creationDate":"2025-12-11","publicationDate":"2025-12-13","fileAccessRequest":true}},{"description":"Visualization of the route constructed using the Lin-Kernighan algorithm for L2 metrics. Allows to visually assess the quality of the heuristic solution.","label":"viz_LinKernigan_tour_kr1354_L2.png","restricted":false,"version":3,"datasetVersionId":73,"categories":["Дані"],"dataFile":{"id":529,"persistentId":"","filename":"viz_LinKernigan_tour_kr1354_L2.png","contentType":"image/png","friendlyType":"PNG Image","filesize":93471,"description":"Visualization of the route constructed using the Lin-Kernighan algorithm for L2 metrics. Allows to visually assess the quality of the heuristic solution.","categories":["Дані"],"storageIdentifier":"local://19b0dc6b097-a0df76accce8","rootDataFileId":-1,"md5":"4de1b86c250747831d65a354f4579f3b","checksum":{"type":"MD5","value":"4de1b86c250747831d65a354f4579f3b"},"tabularData":false,"creationDate":"2025-12-11","publicationDate":"2025-12-13","fileAccessRequest":true}},{"description":"Graphical visualization of the exact route for the Manhattan metric. Displays the sequence of vertex traversal in a planar (2D) coordinate system.","label":"viz_opt_tour_kr1354_L1.png","restricted":false,"version":3,"datasetVersionId":73,"categories":["Дані"],"dataFile":{"id":531,"persistentId":"","filename":"viz_opt_tour_kr1354_L1.png","contentType":"image/png","friendlyType":"PNG Image","filesize":84800,"description":"Graphical visualization of the exact route for the Manhattan metric. Displays the sequence of vertex traversal in a planar (2D) coordinate system.","categories":["Дані"],"storageIdentifier":"local://19b0dc6aeec-8ca647705dca","rootDataFileId":-1,"md5":"bd18126a006c554a39244d0d229e1101","checksum":{"type":"MD5","value":"bd18126a006c554a39244d0d229e1101"},"tabularData":false,"creationDate":"2025-12-11","publicationDate":"2025-12-13","fileAccessRequest":true}},{"description":"Graphical visualization of the route corresponding to the optimal tour for the Euclidean metric. Constructed based on coordinates from the corresponding input file.","label":"viz_opt_tour_kr1354_L2.png","restricted":false,"version":3,"datasetVersionId":73,"categories":["Дані"],"dataFile":{"id":525,"persistentId":"","filename":"viz_opt_tour_kr1354_L2.png","contentType":"image/png","friendlyType":"PNG Image","filesize":113151,"description":"Graphical visualization of the route corresponding to the optimal tour for the Euclidean metric. Constructed based on coordinates from the corresponding input file.","categories":["Дані"],"storageIdentifier":"local://19b0dc6b32e-5729478b5f4b","rootDataFileId":-1,"md5":"ffdcd1575e4abb20781fdb89be0aa8cd","checksum":{"type":"MD5","value":"ffdcd1575e4abb20781fdb89be0aa8cd"},"tabularData":false,"creationDate":"2025-12-11","publicationDate":"2025-12-13","fileAccessRequest":true}},{"description":"Integer (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).","label":"xy_int_1354_L2_L1.txt","restricted":false,"version":3,"datasetVersionId":73,"categories":["Дані"],"dataFile":{"id":528,"persistentId":"","filename":"xy_int_1354_L2_L1.txt","contentType":"text/plain","friendlyType":"Plain Text","filesize":17824,"description":"Integer (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).","categories":["Дані"],"storageIdentifier":"local://19b0dc6b448-2315eed63e16","rootDataFileId":-1,"md5":"d5cf445b70615ffade71dd13a71082d5","checksum":{"type":"MD5","value":"d5cf445b70615ffade71dd13a71082d5"},"tabularData":false,"creationDate":"2025-12-11","publicationDate":"2025-12-13","fileAccessRequest":true}}],"citation":"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]"}}