{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:20:50Z","timestamp":1740169250179,"version":"3.37.3"},"reference-count":80,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Lucian Blaga University of Sibiu and the Hasso Plattner Foundation","award":["LBUS-RRC-2020-01"],"award-info":[{"award-number":["LBUS-RRC-2020-01"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2020.3048774","type":"journal-article","created":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T20:35:28Z","timestamp":1609533328000},"page":"5312-5331","source":"Crossref","is-referenced-by-count":2,"title":["On Randomness and Structure in Euclidean TSP Instances: A Study With Heuristic Methods"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1795-2297","authenticated-orcid":false,"given":"Gloria Cerasela","family":"Crisan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Nechita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5210-1810","authenticated-orcid":false,"given":"Dana","family":"Simian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1093\/jigpal\/jzz069","article-title":"Economical connections between several European countries based on TSP data","volume":"28","author":"cri?an","year":"2020","journal-title":"Log J IGPL"},{"journal-title":"2D Euclidean TSP Instances","year":"2020","key":"ref72"},{"journal-title":"TSP Test Data","year":"2020","key":"ref71"},{"journal-title":"TSPLIB","year":"2020","key":"ref70"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/INDIN41052.2019.8972232"},{"journal-title":"Stochastic Local Search Foundations and Applications","year":"2004","author":"hoos","key":"ref77"},{"journal-title":"Romanian and Swiss TSP Instances","year":"2020","key":"ref74"},{"journal-title":"NEOS Interfaces to Concorde","year":"2020","key":"ref39"},{"journal-title":"DIMACS Implementation Challenge TSP","year":"2020","key":"ref75"},{"journal-title":"Concorde TSP Solver Traveling Salesman Problem","year":"2020","author":"applegate","key":"ref38"},{"key":"ref78","first-page":"356","article-title":"The roles of mutation, inbreeding, crossbreeding and selection in evolution","volume":"1","author":"wright","year":"1932","journal-title":"Proc 6th Int Congr Genet"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-017-9334-0"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053944"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1186\/1751-0473-1-3"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/00207540310001614150"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0791"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.012"},{"key":"ref35","first-page":"228","article-title":"Solving fuzzy TSP with ant algorithms","volume":"3","author":"crisan","year":"2008","journal-title":"Int J Comput Commun Control"},{"article-title":"Probabilistic travelling salesman problems","year":"1985","author":"jaillet","key":"ref34"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.10.012"},{"journal-title":"ACOTSPQAP Ant Colony Optimization Algorithms for the Travelling Salesman Problem and the Quadratic Assignment Problem","year":"2020","author":"l\u00f3pez-ib\u00e1\u00f1ez","key":"ref62"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2016.06.006"},{"key":"ref63","article-title":"Local search in combinatorial optimization","author":"johnson","year":"1996","journal-title":"The Traveling Salesman Problem A Case Study in Local Optimization"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90360-3"},{"key":"ref64","first-page":"299","article-title":"Large-step Markov chains for the traveling salesman problem","volume":"1991","author":"martin","year":"0","journal-title":"J Complex Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2864-4_131"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90012-3"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICICES.2014.7033850"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-013-9341-2"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.3389\/frobt.2015.00018"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340307"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"ref20","article-title":"Hard to solve instances of the Euclidean traveling salesman problem","author":"hougardy","year":"2018","journal-title":"arXiv 1808 02859"},{"journal-title":"Linear Programming and Extensions","year":"1963","author":"dantzig","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0960-0779(95)80046-J"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-3059-9_5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2.4.393"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30162-4_230"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s13676-012-0010-0"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41000-5_16"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/1510256"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45246-3_9"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.14257\/ijmue.2015.10.12.16"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_9"},{"journal-title":"Clever Algorithms Nature-Inspired Programming Recipes","year":"2011","author":"brownlee","key":"ref56"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.plrev.2005.10.001"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106284"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45724-0_10"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330351"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.7771\/1932-6246.1151"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.10.003"},{"key":"ref40","first-page":"76","article-title":"Comparison of algorithms for solving traveling salesman problem","volume":"4","author":"abdulkarim","year":"2015","journal-title":"International Journal of Advanced Engineering Technology"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00215"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2014.18"},{"key":"ref14","article-title":"Understanding TSP difficulty by learning from evolved instances","volume":"6073","author":"van hemert","year":"2010","journal-title":"Learning and Intelligent Optimization"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0004-6"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TSMCB.2008.2006910","article-title":"Multiagent optimization system for solving the traveling salesman problem (TSP)","volume":"39","author":"xie","year":"2009","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071305"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v35i3.2460"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-011-9230-5"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-016-0212-3"},{"key":"ref4","first-page":"123","article-title":"Estimating the hardness of optimization","author":"thi\u00e9baux","year":"2000","journal-title":"Proc Europ Conf Artif Intel (ECAI)"},{"journal-title":"National Traveling Salesman Problems","year":"2020","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"journal-title":"In Pursuit of the Traveling Salesman Mathematics at the Limits of Computation","year":"2012","author":"cook","key":"ref5"},{"key":"ref8","first-page":"6","article-title":"Using L-systems to generate arbitrarily large instances of the Euclidean traveling salesman problem with known optimal tours","author":"mariano","year":"1995","journal-title":"Proc Anales del 27th Simposio Brasileiro de Pesquisa Operacional"},{"key":"ref7","first-page":"331","article-title":"Where the really hard problems are","volume":"1","author":"cheeseman","year":"1991","journal-title":"Proc 12th Int Joint Conf Artif Intell IJCAI"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12065-8_12"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.7771\/1932-6246.1117"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1923-y"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.3991\/ijes.v1i2.3233"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISCBI.2015.8"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2018.093328"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"390","DOI":"10.11591\/tijee.v15i2.1554","article-title":"Heuristic approaches to solve traveling salesman problem","volume":"15","author":"abid","year":"2015","journal-title":"TELKOMNIKA Indonesian Journal on Electrical Engineering"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/11802372_34"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74759-0_262"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-319-46200-4_2","article-title":"On the effect of adding nodes to TSP instances: An empirical analysis","volume":"116","author":"cri?an","year":"2017","journal-title":"Advances in Combining Intelligent Methods"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09312045.pdf?arnumber=9312045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T14:49:44Z","timestamp":1724165384000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9312045\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":80,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3048774","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}