{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T18:44:29Z","timestamp":1746816269388,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319685267"},{"type":"electronic","value":"9783319685274"}],"license":[{"start":{"date-parts":[[2017,9,24]],"date-time":"2017-09-24T00:00:00Z","timestamp":1506211200000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-68527-4_41","type":"book-chapter","created":{"date-parts":[[2017,9,23]],"date-time":"2017-09-23T06:39:20Z","timestamp":1506148760000},"page":"379-387","source":"Crossref","is-referenced-by-count":2,"title":["Evaluation of Traveling Salesman Problem Instance Hardness by Clustering"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Kr\u00f6mer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Plato\u0161","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,24]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton (2007)"},{"key":"41_CR2","doi-asserted-by":"publisher","unstructured":"Arora, S.: Approximation Algorithms for Geometric TSP, pp. 207\u2013221. Springer, Boston (2007). doi: 10.1007\/0-306-48213-4_5","DOI":"10.1007\/0-306-48213-4_5"},{"key":"41_CR3","unstructured":"Bandyopadhyay, S., Saha, S.: Unsupervised Classification: Similarity Measures, Classical and Metaheuristic Approaches, and Applications. SpringerLink: B\u00fccher, Heidelberg (2012). https:\/\/books.google.cz\/books?id=Vb21R9_rMNoC"},{"key":"41_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"41_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/9780470512517","volume-title":"Computational Intelligence: An Introduction","author":"A Engelbrecht","year":"2007","unstructured":"Engelbrecht, A.: Computational Intelligence: An Introduction, 2nd edn. Wiley, New York (2007)","edition":"2"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Everitt, B., Landau, S., Leese, M., Stahl, D.: Cluster Analysis. Wiley Series in Probability and Statistics, Wiley, New York (2011). https:\/\/books.google.cz\/books?id=w3bE1kqd-48C","DOI":"10.1002\/9780470977811"},{"key":"41_CR7","doi-asserted-by":"publisher","unstructured":"Fischetti, M., Lodi, A., Toth, P.: Exact Methods for the Asymmetric Traveling Salesman Problem, pp. 169\u2013205. Springer, Boston (2007). doi: 10.1007\/0-306-48213-4_4","DOI":"10.1007\/0-306-48213-4_4"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Hernando, L., Pascual, J.A., Mendiburu, A., Lozano, J.A.: A study on the complexity of TSP instances under the 2-exchange neighbor system. In: 2011 IEEE Symposium on Foundations of Computational Intelligence (FOCI), pp. 15\u201321, April 2011","DOI":"10.1109\/FOCI.2011.5949471"},{"key":"41_CR9","doi-asserted-by":"publisher","unstructured":"Kefi, S., Rokbani, N., Kr\u00f6mer, P., Alimi, A.M.: Ant supervised by PSO and 2-opt algorithm, AS-PSO-2Opt, applied to traveling salesman problem. In: 2016 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2016, Budapest, Hungary, 9\u201312 October 2016, pp. 4866\u20134871. IEEE (2016). doi: 10.1109\/SMC.2016.7844999","DOI":"10.1109\/SMC.2016.7844999"},{"issue":"3","key":"41_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/widm.30","volume":"1","author":"HP Kriegel","year":"2011","unstructured":"Kriegel, H.P., Kr\u00fcger, P., Sander, J., Zimek, A.: Density-based clustering. Wiley Interdiscip. Rev. Data Min. Knowl. Discov. 1(3), 231\u2013240 (2011). doi: 10.1002\/widm.30","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"key":"41_CR11","doi-asserted-by":"publisher","unstructured":"Kr\u00f6mer, P., Platos, J., Sn\u00e1sel, V.: Traditional and self-adaptive differential evolution for the p-median problem. In: 2nd IEEE International Conference on Cybernetics, CYBCONF 2015, Gdynia, Poland, 24\u201326 June 2015, pp. 299\u2013304. IEEE (2015). doi: 10.1109\/CYBConf.2015.7175950","DOI":"10.1109\/CYBConf.2015.7175950"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Mihal\u00e1k, M., Sch\u00f6ngens, M., \u0160r\u00e1mek, R., Widmayer, P.: On the complexity of the metric TSP under stability considerations. In: Proceedings of 37th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2011, pp. 382\u2013393. Springer, Heidelberg (2011). http:\/\/dl.acm.org\/citation.cfm?id=1946370.1946402","DOI":"10.1007\/978-3-642-18381-2_32"},{"key":"41_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/0-306-48213-4_1","volume-title":"The Traveling Salesman Problem and Its Variations Combinatorial Optimization","author":"AP Punnen","year":"2007","unstructured":"Punnen, A.P.: The traveling salesman problem: applications, formulations and variations. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and Its Variations Combinatorial Optimization, vol. 12, pp. 1\u201328. Springer, Boston (2007). doi: 10.1007\/0-306-48213-4_1"},{"key":"41_CR14","unstructured":"Salkind, N.: Encyclopedia of Measurement and Statistics. SAGE Publications, Upper Saddle River (2006). https:\/\/books.google.cz\/books?id=HJ91CgAAQBAJ"},{"key":"41_CR15","doi-asserted-by":"publisher","unstructured":"St\u00fctzle, T., Gr\u00fcn, A., Linke, S., R\u00fcttger, M.: A comparison of nature inspired heuristics on the traveling salesman problem, pp. 661\u2013670. Springer, Heidelberg (2000). doi: 10.1007\/3-540-45356-3_65","DOI":"10.1007\/3-540-45356-3_65"},{"key":"41_CR16","doi-asserted-by":"publisher","unstructured":"St\u00fctzle, T., Hoos, H.H.: Analysing the Run-Time Behaviour of Iterated Local Search for the Travelling Salesman Problem, pp. 589\u2013611. Springer, Boston (2002). doi: 10.1007\/978-1-4615-1507-4_26","DOI":"10.1007\/978-1-4615-1507-4_26"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Fourth Euro-China Conference on Intelligent Data Analysis and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68527-4_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,18]],"date-time":"2020-10-18T04:40:32Z","timestamp":1602996032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68527-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,24]]},"ISBN":["9783319685267","9783319685274"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68527-4_41","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,9,24]]}}}