{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:42:11Z","timestamp":1648759331264},"reference-count":33,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2019,12,31]],"date-time":"2019-12-31T00:00:00Z","timestamp":1577750400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"ProSEco project of EU\u2019s 7th FP","award":["NMP-2013 609143"],"award-info":[{"award-number":["NMP-2013 609143"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,1,24]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A fluent economical collaboration between countries is a major need. European flows of trade and people are supported by efficient connections between main localities from a geographic region, in many cases overriding national borders. This paper introduces three traveling salesmen problem instances based on freely available geographic coordinates of the main cities of France, Portugal and Spain. These instances are unified, generating other four larger instances: three with all pairs of countries and one instance with the settlements from all the three countries. The study includes an analysis of quality of solutions for a version of branch &amp; cut algorithm and some hybrid heuristics including the Lin\u2013Kernighan algorithm. $Bor\\mathring{u}vka$, Quick$Bor\\mathring{u}vka$ and Greedy algorithms are also used in the hybrid approaches in order to obtain a potential beneficent initial solution for the Lin\u2013Kernighan algorithm. Concorde solver, nowadays state-of-the-art exact software, together with the already mentioned algorithms, is used to test and furthermore analyze the new TSP instances. Some results are represented using online services such as Google Maps, showing the potential integration of the Concorde\u2019s optimum results into commercial routing applications. The very good results provided by the Lin\u2013Kernighan method allow its usage for real medium-sized routing instances.<\/jats:p>","DOI":"10.1093\/jigpal\/jzz069","type":"journal-article","created":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T20:12:27Z","timestamp":1573503147000},"page":"33-44","source":"Crossref","is-referenced-by-count":2,"title":["Economical connections between several European countries based on TSP data"],"prefix":"10.1093","volume":"28","author":[{"given":"Gloria Cerasela","family":"Cri\u015fan","sequence":"first","affiliation":[{"name":"Department of Mathematics and Informatics, Vasile Alecsandri University of Bac\u0103u, 600115 Bac\u0103u, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camelia-M","family":"Pintea","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Informatics, Technical University of Cluj-Napoca, 430122 Baia Mare, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petric\u0103 C","family":"Pop","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Informatics, Technical University of Cluj-Napoca, 430122 Baia Mare, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliviu","family":"Matei","sequence":"additional","affiliation":[{"name":"Department of Engineering, Technical University of Cluj-Napoca, 430122 Baia Mare, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2019,12,31]]},"reference":[{"key":"2020012910165319700_ref1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"Applegate","year":"2007"},{"key":"2020012910165319700_ref2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","article-title":"The multiple traveling salesman problem: an overview of formulations and solution procedures","volume":"34","author":"Bektas","year":"2006","journal-title":"OMEGA: The International Journal of Management Science"},{"key":"2020012910165319700_ref3","volume-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","author":"Cook","year":"2014"},{"key":"2020012910165319700_ref4","volume-title":"Nonparametric Statistics: A Step-by-Step Approach","author":"Corder","year":"2014"},{"key":"2020012910165319700_ref5","first-page":"V1","article-title":"Romania TSP instance with GPS coordinates and GEOM norm","author":"Cri\u015fan","year":"2017"},{"key":"2020012910165319700_ref6","article-title":"Spain TSP instance","author":"Cri\u015fan","year":"2015"},{"key":"2020012910165319700_ref7","article-title":"Portugal TSP instance","author":"Cri\u015fan","year":"2015"},{"key":"2020012910165319700_ref8","article-title":"France TSP instance","author":"Cri\u015fan","year":"2015"},{"key":"2020012910165319700_ref9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","article-title":"Ant colonies for traveling salesman problem","volume":"43","author":"Dorigo","year":"1997","journal-title":"Biosystems"},{"key":"2020012910165319700_ref10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1080\/10095020.2012.708151","article-title":"A novel GIS-based decision-making framework for the school bus routing problem","volume":"15","author":"Eldrandaly","year":"2012","journal-title":"Geo-spatial Information Science"},{"key":"2020012910165319700_ref11"},{"key":"2020012910165319700_ref12","article-title":"Routing, Traveling Salesman Problem:"},{"key":"2020012910165319700_ref13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01415960","article-title":"Optimal control of plotting and drilling machines: a case study","volume":"35","author":"Gr\u00f6tschel","year":"1991","journal-title":"Mathematical Methods of Operations Research"},{"key":"2020012910165319700_ref14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","article-title":"Reducibility among combinatorial problems","volume-title":"Complexity of Computer Computations","author":"Karp","year":"1972"},{"key":"2020012910165319700_ref15","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling-salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operations Research"},{"key":"2020012910165319700_ref16"},{"key":"2020012910165319700_ref17"},{"key":"2020012910165319700_ref18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(00)00224-7","article-title":"OtakarBor\u016fvka on minimum spanning tree problem: translation of both the 1926 papers, comments, history","volume":"233","author":"Ne\u0161et\u0159il","year":"2001","journal-title":"Discrete Mathematics"},{"key":"2020012910165319700_ref19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1504\/IJAIP.2010.029438","article-title":"Route optimisation using evolutionary approaches for on-demand pickup problem","volume":"2","author":"Mukai","year":"2010","journal-title":"International Journal of Advanced Intelligence Paradigms."},{"key":"2020012910165319700_ref20","doi-asserted-by":"crossref","first-page":"509","DOI":"10.15388\/Informatica.2015.61","article-title":"A unifying survey of agent-based approaches for equality-generalized traveling salesman problem","volume":"26","author":"Pintea","year":"2015","journal-title":"Informatica"},{"key":"2020012910165319700_ref21","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1504\/IJAIP.2012.052071","article-title":"Comparing heuristics for a packing problem","volume":"4","author":"Pintea","year":"2012","journal-title":"International Journal of Advanced Intelligence Paradigms"},{"key":"2020012910165319700_ref22","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02125403","article-title":"Genetic algorithms for the traveling salesman problem","volume":"63","author":"Potvin","year":"1996","journal-title":"Annals of Operations Research"},{"key":"2020012910165319700_ref23","volume-title":"The Traveling Salesman: Computational Solutions for TSP Application","author":"Reinelt","year":"1994"},{"key":"2020012910165319700_ref24","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1504\/IJAIP.2016.077498","article-title":"Adaptive probabilities of crossover and mutation in genetic algorithm for solving stochastic vehicle routing problem","volume":"8","author":"Rekik","year":"2016","journal-title":"International Journal of Advanced Intelligence Paradigms."},{"key":"2020012910165319700_ref25","doi-asserted-by":"crossref","first-page":"1566","DOI":"10.1016\/j.cor.2011.09.005","article-title":"The effect of the asymmetry of road transportation networks on the traveling salesman problem","volume":"39","author":"Rodr\u00edguez","year":"2012","journal-title":"Computers & Operations Research"},{"key":"2020012910165319700_ref26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-06941-8","volume-title":"Support Vector Machines and Evolutionary Algorithms for Classification","author":"Stoean","year":"2014"},{"key":"2020012910165319700_ref27","volume-title":"Algorithms for the Solution of the Optimal Cost and Bottleneck Traveling Salesman Problems","author":"Shapiro","year":"1966"},{"key":"2020012910165319700_ref28","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/978-3-319-32034-2_30","article-title":"An analysis of the hardness of novel TSP Iberian instances","volume":"9648","author":"Cri\u015fan","year":"2016","journal-title":"Lecture Notes in Computer Science"},{"key":"2020012910165319700_ref29","author":"Spanish Government","year":"2017"},{"key":"2020012910165319700_ref30"},{"key":"2020012910165319700_ref31"},{"key":"2020012910165319700_ref32"},{"key":"2020012910165319700_ref33"}],"container-title":["Logic Journal of the IGPL"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/jigpal\/article-pdf\/28\/1\/33\/32219672\/jzz069.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/jigpal\/article-pdf\/28\/1\/33\/32219672\/jzz069.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T20:47:49Z","timestamp":1612298869000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jigpal\/article\/28\/1\/33\/5691245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,31]]},"references-count":33,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,12,31]]},"published-print":{"date-parts":[[2020,1,24]]}},"URL":"https:\/\/doi.org\/10.1093\/jigpal\/jzz069","relation":{},"ISSN":["1367-0751","1368-9894"],"issn-type":[{"value":"1367-0751","type":"print"},{"value":"1368-9894","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2020,2]]},"published":{"date-parts":[[2019,12,31]]}}}