{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:44:31Z","timestamp":1725853471262},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319320335"},{"type":"electronic","value":"9783319320342"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32034-2_30","type":"book-chapter","created":{"date-parts":[[2016,4,14]],"date-time":"2016-04-14T09:23:19Z","timestamp":1460625799000},"page":"353-364","source":"Crossref","is-referenced-by-count":3,"title":["An Analysis of the Hardness of Novel TSP Iberian Instances"],"prefix":"10.1007","author":[{"given":"Gloria Cerasela","family":"Cri\u015fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camelia-M.","family":"Pintea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petric\u0103","family":"Pop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliviu","family":"Matei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,14]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"Princeton Series in Applied Mathematics. The Traveling Salesman Problem: A Computational","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: Princeton Series in Applied Mathematics. The Traveling Salesman Problem: A Computational. Princeton University Press, Princeton (2007)"},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.orl.2008.09.006","volume":"37","author":"DL Applegate","year":"2009","unstructured":"Applegate, D.L., et al.: Certification of an optimal TSP tour through 85,900 cities. Oper. Res. Lett. 37(1), 11\u201315 (2009)","journal-title":"Oper. Res. Lett."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks 19, 621\u2013636 (1989)","journal-title":"Networks"},{"issue":"3","key":"30_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. OMEGA: Int. J. Manage. Sci. 34(3), 209\u2013219 (2006)","journal-title":"OMEGA: Int. J. Manage. Sci."},{"issue":"3","key":"30_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0167-6377(89)90037-0","volume":"8","author":"RG Bland","year":"1989","unstructured":"Bland, R.G., Shallcross, D.F.: Large travelling salesman problems arising from experiments in X-ray crystallography: a preliminary report on computation. Oper. Res. Lett. 8(3), 125\u2013128 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"30_CR6","doi-asserted-by":"crossref","first-page":"403","DOI":"10.24846\/v21i4y201206","volume":"21","author":"ST Brassai","year":"2012","unstructured":"Brassai, S.T., Iantovics, B., Enachescu, C.: Optimization of robotic mobile agent navigation. Stud. Inform. Control 21(4), 403\u2013412 (2012)","journal-title":"Stud. Inform. Control"},{"issue":"4","key":"30_CR7","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"30_CR8","volume-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","author":"WJ Cook","year":"2014","unstructured":"Cook, W.J.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton (2014)"},{"key":"30_CR9","volume-title":"Nonparametric Statistics: A Step-by-Step Approach","author":"GW Corder","year":"2014","unstructured":"Corder, G.W., Foreman, D.I.: Nonparametric Statistics: A Step-by-Step Approach. Wiley, New Jersey (2014)"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-26860-6_3","volume-title":"Combinations of Intelligent Methods and Applications","author":"GC Cri\u015fan","year":"2016","unstructured":"Cri\u015fan, G.C., Nechita, E., Palade, V.: Ant-based system analysis on the traveling salesman problem under real-world settings. In: Hatzilygeroudis, I., Palade, V., Prentzas, J. (eds.) Combinations of Intelligent Methods and Applications, vol. 46, pp. 39\u201359. Springer, Heidelberg (2016)"},{"key":"30_CR11","doi-asserted-by":"publisher","unstructured":"Cri\u015fan, C., Pintea, C.-M.: Romania2950 dataset (2014). doi: 10.13140\/2.1.4706.8165","DOI":"10.13140\/2.1.4706.8165"},{"key":"30_CR12","doi-asserted-by":"publisher","unstructured":"Cri\u015fan, C., Pintea, C.-M.: Spain TSP instance (2015). doi: 10.13140\/RG.2.1.2331.2727","DOI":"10.13140\/RG.2.1.2331.2727"},{"key":"30_CR13","doi-asserted-by":"publisher","unstructured":"Cri\u015fan, C., Pintea, C.-M.: Portugal TSP instance (2015). doi: 10.13140\/RG.2.1.4944.5209","DOI":"10.13140\/RG.2.1.4944.5209"},{"key":"30_CR14","unstructured":"Cri\u015fan, G.C.: Ant algorithms in artificial intelligence. Ph.D thesis, Al.I.Cuza Unversity of Iasi, Romania (2007)"},{"key":"30_CR15","first-page":"228","volume":"3","author":"GC Cri\u015fan","year":"2008","unstructured":"Cri\u015fan, G.C., Nechita, E.: Solving fuzzy TSP with ant algorithms. Int. J. Comput. Commun. Control 3, 228\u2013231 (2008)","journal-title":"Int. J. Comput. Commun. Control"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colonies for traveling salesman problem. BioSystems 43, 73\u201381 (1997)","journal-title":"BioSystems"},{"issue":"1","key":"30_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1080\/10095020.2012.708151","volume":"15","author":"KA Eldrandaly","year":"2012","unstructured":"Eldrandaly, K.A., Abdallah, A.F.: A novel GIS-based decision-making framework for the school bus routing problem. Geo-spat. Inf. Sci. 15(1), 51\u201359 (2012)","journal-title":"Geo-spat. Inf. Sci."},{"key":"30_CR18","unstructured":"GeoNames download page. http:\/\/www.geonames.org\/export\/"},{"key":"30_CR19","unstructured":"Google Developers TSP Application. https:\/\/developers.google.com\/optimization\/routing\/tsp?hl=en"},{"issue":"1","key":"30_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01415960","volume":"35","author":"M Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: Optimal control of plotting and drilling machines: a case study. Math. Methods Oper. Res. 35(1), 61\u201384 (1991)","journal-title":"Math. Methods Oper. Res."},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1057\/jors.1975.151","volume":"26","author":"JK Lenstra","year":"1975","unstructured":"Lenstra, J.K., Kan, A.H.G.: Some simple applications of the traveling salesman problem. Oper. Res. 26, 717\u2013733 (1975)","journal-title":"Oper. Res."},{"issue":"2","key":"30_CR23","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"30_CR24","unstructured":"List of the Spanish provinces. http:\/\/en.classora.com"},{"key":"30_CR25","unstructured":"NEOS server for Concorde. http:\/\/neos.mcs.anl.gov\/neos\/solvers\/co:concorde\/TSP.html"},{"key":"30_CR26","volume-title":"Production and Operations Analysis","author":"S Nahmias","year":"2015","unstructured":"Nahmias, S., Lennon, O.T.: Production and Operations Analysis, 7th edn. Waveland Press, Long Grove (2015)","edition":"7"},{"issue":"1\u20133","key":"30_CR27","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(00)00224-7","volume":"233","author":"J Ne\u0161et\u0159il","year":"2001","unstructured":"Ne\u0161et\u0159il, J., Milkov\u00e1, E., Ne\u0161et\u0159ilov\u00e1, H.: Otakar Bor $$\\mathring{{\\rm u}}$$ u \u02da vka on minimum spanning tree problem: translation of both the 1926 papers, comments, history. Discrete Math. 233(1\u20133), 3\u201336 (2001)","journal-title":"Discrete Math."},{"key":"30_CR28","unstructured":"OptiMap solver. http:\/\/www.gebweb.net\/optimap\/"},{"issue":"3","key":"30_CR29","doi-asserted-by":"publisher","first-page":"509","DOI":"10.15388\/Informatica.2015.61","volume":"26","author":"C-M Pintea","year":"2015","unstructured":"Pintea, C.-M.: A lnifying survey of agent-based approaches for equality-generalized traveling salesman problem. Informatica 26(3), 509\u2013522 (2015)","journal-title":"Informatica"},{"key":"30_CR30","doi-asserted-by":"crossref","unstructured":"Pintea, C.-M., Ludwig, S.A., Cri\u015fan, G.-C.: Adaptability of a discrete PSO algorithm applied to the traveling salesman problem with fuzzy data. In: IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pp. 1\u20136 (2015)","DOI":"10.1109\/FUZZ-IEEE.2015.7337839"},{"issue":"3","key":"30_CR31","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02125403","volume":"63","author":"J-Y Potvin","year":"1996","unstructured":"Potvin, J.-Y.: Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. 63(3), 337\u2013370 (1996)","journal-title":"Ann. Oper. Res."},{"key":"30_CR32","series-title":"Lecture Notes in Computer Science","volume-title":"The Traveling Salesman","year":"1994","unstructured":"Reinelt, G. (ed.): TSP. LNCS, vol. 840. Springer, Heidelberg (1994)"},{"key":"30_CR33","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1016\/j.cor.2011.09.005","volume":"39","author":"A Rodr\u00edguez","year":"2012","unstructured":"Rodr\u00edguez, A., Ruiz, R.: The effect of the asymmetry of road transportation networks on the traveling salesman problem. Comput. Oper. Res. 39, 1566\u20131576 (2012)","journal-title":"Comput. Oper. Res."},{"key":"30_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06941-8","volume-title":"Support Vector Machines and Evolutionary Algorithms for Classification","author":"C Stoean","year":"2014","unstructured":"Stoean, C., Stoean, R.: Support Vector Machines and Evolutionary Algorithms for Classification. Springer, Heidelberg (2014)"},{"key":"30_CR35","unstructured":"Shapiro, D.M.: Algorithms for the solution of the optimal cost and bottleneck traveling salesman problems. Sc.D. thesis, Washington University, St. Louis, MO (1966)"},{"key":"30_CR36","unstructured":"TSPLIB. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/tsplib95"},{"key":"30_CR37","unstructured":"TSP data. www.math.uwaterloo.ca\/tsp\/data\/"},{"key":"30_CR38","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-540-87656-4_21","volume-title":"Hybrid Artificial Intelligence Systems","author":"A Vescan","year":"2008","unstructured":"Vescan, A., Grosan, C.: A hybrid evolutionary multiobjective approach for the component selection problem. In: Corchado, E., Abraham, A., Pedrycz, W. (eds.) HAIS 2008. LNCS (LNAI), vol. 5271, pp. 164\u2013171. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32034-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T17:05:10Z","timestamp":1600448710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32034-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319320335","9783319320342"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32034-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}