{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:19:30Z","timestamp":1743016770253,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030921200"},{"type":"electronic","value":"9783030921217"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92121-7_22","type":"book-chapter","created":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T17:13:15Z","timestamp":1638983595000},"page":"265-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hybridising Self-Organising Maps with\u00a0Genetic Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0383-0379","authenticated-orcid":false,"given":"Abtin","family":"Nourmohammadzadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,9]]},"reference":[{"key":"22_CR1","unstructured":"Der Handlungsreisende - wie er sein soll und was er zu tun hat, um Auftr\u00e4ge zu erhalten und eines gl\u00fccklichen Erfolgs in seinen Gesch\u00e4ften gewi\u00df zu sein - von einem alten Commis-Voyageur. Springer (1832)"},{"key":"22_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94463-0","volume-title":"Neural Networks and Deep Learning","author":"CC Aggarwal","year":"2018","unstructured":"Aggarwal, C.C.: Neural Networks and Deep Learning. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94463-0"},{"issue":"8","key":"22_CR3","doi-asserted-by":"publisher","first-page":"404","DOI":"10.14569\/ijacsa.2017.080852","volume":"8","author":"A Alsheddy","year":"2017","unstructured":"Alsheddy, A.: Solving the free clustered TSP using a memetic algorithm. Int. J. Adv. Comput. Sci. Appl. 8(8), 404\u2013408 (2017). https:\/\/doi.org\/10.14569\/ijacsa.2017.080852","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"issue":"1","key":"22_CR4","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). https:\/\/doi.org\/10.1016\/j.orl.2008.09.006","journal-title":"Oper. Res. Lett."},{"key":"22_CR5","doi-asserted-by":"publisher","unstructured":"Bai, Y., Zhang, W., Jin, Z.: An new self-organizing maps strategy for solving the traveling salesman problem. Chaos, Solitons & Fractals 28(4), 1082\u20131089 (2006). https:\/\/doi.org\/10.1016\/j.chaos.2005.08.114","DOI":"10.1016\/j.chaos.2005.08.114"},{"key":"22_CR6","series-title":"Medizinische Informatik und Statistik","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-52307-6_8","volume-title":"Multiple Hypothesenpr\u00fcfung\/Multiple Hypotheses Testing","author":"B Bergmann","year":"1988","unstructured":"Bergmann, B., Hommel, G.: Improvements of general multiple test procedures for redundant systems of hypotheses. In: Bauer, P., Hommel, G., Sonnemann, E. (eds.) Multiple Hypothesenpr\u00fcfung\/Multiple Hypotheses Testing. MEDINFO, vol. 70, pp. 100\u2013115. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/978-3-642-52307-6_8"},{"issue":"4","key":"22_CR7","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1162\/evco.1996.4.4.361","volume":"4","author":"T Blickle","year":"1996","unstructured":"Blickle, T., Thiele, L.: A comparison of selection schemes used in evolutionary algorithms. Evol. Comput. 4(4), 361\u2013394 (1996). https:\/\/doi.org\/10.1162\/evco.1996.4.4.361","journal-title":"Evol. Comput."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-73956-2_24","volume-title":"Recent Advances in Mechatronics","author":"\u0141 Brocki","year":"1999","unstructured":"Brocki, \u0141, Kor\u017einek, D.: Kohonen self-organizing map for the traveling salesperson problem. In: Jab\u0142o\u0144ski, R., Turkowski, M., Szewczyk, R. (eds.) Recent Advances in Mechatronics, pp. 116\u2013119. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-73956-2_24"},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2(4), 393\u2013410 (1954). https:\/\/doi.org\/10.1287\/opre.2.4.393","journal-title":"J. Oper. Res. Soc. Am."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.ins.2019.06.038","volume":"512","author":"P D\u2019Urso","year":"2020","unstructured":"D\u2019Urso, P., Giovanni, L.D., Massari, R.: Smoothed self-organizing map for robust clustering. Inf. Sci. 512, 381\u2013401 (2020). https:\/\/doi.org\/10.1016\/j.ins.2019.06.038","journal-title":"Inf. Sci."},{"key":"22_CR11","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-07695-9_27","volume-title":"Advances in Self-Organizing Maps and Learning Vector Quantization","author":"J Faigl","year":"2014","unstructured":"Faigl, J., Hollinger, G.A.: Self-organizing map for the prize-collecting traveling salesman problem. In: Villmann, T., Schleif, F.-M., Kaden, M., Lange, M. (eds.) Advances in Self-Organizing Maps and Learning Vector Quantization. AISC, vol. 295, pp. 281\u2013291. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07695-9_27"},{"issue":"8","key":"22_CR12","doi-asserted-by":"publisher","first-page":"e0201868","DOI":"10.1371\/journal.pone.0201868","volume":"13","author":"GEA Fuentes","year":"2018","unstructured":"Fuentes, G.E.A., Gress, E.S.H., Mora, J.C.S.T., Mar\u00edn, J.M.: Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic. PLoS ONE 13(8), e0201868 (2018). https:\/\/doi.org\/10.1371\/journal.pone.0201868","journal-title":"PLoS ONE"},{"key":"22_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5","volume-title":"Handbook of Metaheuristics","year":"2010","unstructured":"Gendreau, M., Potvin, J.Y. (eds.): Handbook of Metaheuristics. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5"},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Grabusts, P., Musatovs, J.: The application of simulated annealing method for solving travelling salesman problem. In: Proceedings of the 4th Global Virtual Conference. Publishing Society, pp. 225\u2013229 (2016). https:\/\/doi.org\/10.18638\/gv.2016.4.1.732","DOI":"10.18638\/gv.2016.4.1.732"},{"issue":"2","key":"22_CR15","doi-asserted-by":"publisher","first-page":"208","DOI":"10.2307\/1271458","volume":"42","author":"JV Grice","year":"2000","unstructured":"Grice, J.V., Montgomery, D.C.: Design and analysis of experiments. Technometrics 42(2), 208 (2000). https:\/\/doi.org\/10.2307\/1271458","journal-title":"Technometrics"},{"issue":"4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"555","DOI":"10.7155\/jgaa.00478","volume":"22","author":"N Guttmann-Beck","year":"2018","unstructured":"Guttmann-Beck, N., Knaan, E., Stern, M.: Approximation algorithms for not necessarily disjoint clustered TSP. J. Graph Algorithms Appl. 22(4), 555\u2013575 (2018). https:\/\/doi.org\/10.7155\/jgaa.00478","journal-title":"J. Graph Algorithms Appl."},{"key":"22_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/0471671746","volume-title":"Practical Genetic Algorithms","author":"RL Haupt","year":"2003","unstructured":"Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms. Wiley, Hoboken (2003). https:\/\/doi.org\/10.1002\/0471671746"},{"key":"22_CR18","doi-asserted-by":"publisher","unstructured":"Jaradat, A., Matalkeh, B., Diabat, W.: Solving traveling salesman problem using firefly algorithm and k-means clustering. In: 2019 IEEE Jordan International Joint Conference on Electrical Engineering and Information Technology (JEEIT). IEEE, pp. 586\u2013589 (2019). https:\/\/doi.org\/10.1109\/jeeit.2019.8717463","DOI":"10.1109\/jeeit.2019.8717463"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-05983-5_5","volume-title":"Hybrid Metaheuristics","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R., Tuba, M., Vo\u00df, S.: Fixed set search applied to the traveling salesman problem. In: Blesa Aguilera, M.J., Blum, C., Gambini Santos, H., Pinacho-Davidson, P., Godoy del Campo, J. (eds.) HM 2019. LNCS, vol. 11299, pp. 63\u201377. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05983-5_5"},{"key":"22_CR20","doi-asserted-by":"publisher","unstructured":"King, B., Barve, S., Ford, A., Jha, R.: Unsupervised clustering of COVID-19 chest X-ray images with a self-organizing feature map. In: 2020 IEEE 63rd International Midwest Symposium on Circuits and Systems (MWSCAS). IEEE (2020). https:\/\/doi.org\/10.1109\/mwscas48704.2020.9184493","DOI":"10.1109\/mwscas48704.2020.9184493"},{"issue":"1","key":"22_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/bf00337288","volume":"43","author":"T Kohonen","year":"1982","unstructured":"Kohonen, T.: Self-organized formation of topologically correct feature maps. Biol. Cybern. 43(1), 59\u201369 (1982). https:\/\/doi.org\/10.1007\/bf00337288","journal-title":"Biol. Cybern."},{"issue":"9","key":"22_CR22","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1057\/palgrave.jors.2601420","volume":"53","author":"G Laporte","year":"2002","unstructured":"Laporte, G., Palekar, U.: Some applications of the clustered travelling salesman problem. J. Oper. Res. Soc. 53(9), 972\u2013976 (2002). https:\/\/doi.org\/10.1057\/palgrave.jors.2601420","journal-title":"J. Oper. Res. Soc."},{"key":"22_CR23","doi-asserted-by":"publisher","unstructured":"Liu, D., Wang, X., Du, J.: A clustering-based evolutionary algorithm for traveling salesman problem. In: 2009 International Conference on Computational Intelligence and Security. IEEE, pp. 118\u2013122 (2009). https:\/\/doi.org\/10.1109\/cis.2009.80","DOI":"10.1109\/cis.2009.80"},{"key":"22_CR24","doi-asserted-by":"publisher","unstructured":"Matai, R., Singh, S., Lal, M.: Traveling salesman problem: an overview of applications, formulations, and solution approaches. In: Davendra, D. (ed.) Traveling Salesman Problem, Theory and Applications. InTech (2010). https:\/\/doi.org\/10.5772\/12909","DOI":"10.5772\/12909"},{"key":"22_CR25","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-1-4613-1361-8_37","volume-title":"Meta-Heuristics","author":"JY Potvin","year":"1996","unstructured":"Potvin, J.Y., Guertin, F.: The clustered traveling salesman problem: a genetic approach. In: Osman, I.H., Kelly, J.P. (eds.) Meta-Heuristics, pp. 619\u2013631. Springer, Boston (1996). https:\/\/doi.org\/10.1007\/978-1-4613-1361-8_37"},{"issue":"3","key":"22_CR26","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2010.09.010","volume":"211","author":"C Rego","year":"2011","unstructured":"Rego, C., Gamboa, D., Glover, F., Osterman, C.: Traveling salesman problem heuristics: leading methods, implementations and latest advances. Eur. J. Oper. Res. 211(3), 427\u2013441 (2011). https:\/\/doi.org\/10.1016\/j.ejor.2010.09.010","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"22_CR27","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991). https:\/\/doi.org\/10.1287\/ijoc.3.4.376","journal-title":"ORSA J. Comput."},{"issue":"5","key":"22_CR28","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s10955-010-0080-z","volume":"141","author":"JJ Schneider","year":"2010","unstructured":"Schneider, J.J., Bukur, T., Krause, A.: Traveling salesman problem with clustering. J. Stat. Phys. 141(5), 767\u2013784 (2010). https:\/\/doi.org\/10.1007\/s10955-010-0080-z","journal-title":"J. Stat. Phys."},{"key":"22_CR29","doi-asserted-by":"publisher","unstructured":"Suhriani, I.F., Mutawalli, L., Widiami, B.R.A., Chumairoh: Implementation self organizing map for cluster flood disaster risk. In: Proceedings of the International Conference on Mathematics and Islam. SCITEPRESS - Science and Technology Publications, pp. 405\u2013409 (2018). https:\/\/doi.org\/10.5220\/0008522604050409","DOI":"10.5220\/0008522604050409"},{"issue":"2","key":"22_CR30","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.ejor.2018.06.039","volume":"272","author":"\u00c9D Taillard","year":"2019","unstructured":"Taillard, \u00c9.D., Helsgaun, K.: POPMUSIC for the travelling salesman problem. Eur. J. Oper. Res. 272(2), 420\u2013429 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.06.039","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"22_CR31","doi-asserted-by":"publisher","first-page":"2801","DOI":"10.18494\/sam.2020.2800","volume":"32","author":"S Yu","year":"2020","unstructured":"Yu, S., Yang, M., Wei, L., Hu, J.S., Tseng, H.W., Meen, T.H.: Combination of self-organizing map and k-means methods of clustering for online games marketing. Sens. Mater. 32(8), 2801 (2020). https:\/\/doi.org\/10.18494\/sam.2020.2800","journal-title":"Sens. Mater."},{"key":"22_CR32","doi-asserted-by":"publisher","unstructured":"Yuanyuan, L., Jing, Z.: An application of ant colony optimization algorithm in TSP. In: 2012 Fifth International Conference on Intelligent Networks and Intelligent Systems. IEEE, pp. 61\u201364 (2012). https:\/\/doi.org\/10.1109\/icinis.2012.20","DOI":"10.1109\/icinis.2012.20"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92121-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T17:15:38Z","timestamp":1638983738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92121-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030921200","9783030921217"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92121-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion15.sba-research.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}