{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T04:18:10Z","timestamp":1728447490568},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031741821","type":"print"},{"value":"9783031741838","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74183-8_26","type":"book-chapter","created":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T07:04:34Z","timestamp":1728371074000},"page":"312-323","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the\u00a0Clustered Minimum Routing Tree Problem Using Pr\u00fcfer-Coding Based Hybrid Genetic Algorithms"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-5648-7191","authenticated-orcid":false,"given":"Cosmin","family":"Sabo","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0009-0008-5262-0830","authenticated-orcid":false,"given":"Bogdan","family":"Teglas","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0626-9284","authenticated-orcid":false,"given":"Petric\u0103 C.","family":"Pop","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6877-027X","authenticated-orcid":false,"given":"Adrian","family":"Petrovan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","unstructured":"Cosma, O., Pop, P.C., Cosma, L.: A hybrid based genetic algorithm for solving the clustered generalized traveling salesman problem. In: Garc\u00eda Bringas, P., et al. Hybrid Artificial Intelligent Systems, HAIS 2023, LNCS, vol. 14001, pp. 352\u2013362. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-40725-3_30","DOI":"10.1007\/978-3-031-40725-3_30"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.37193\/CJM.2022.01.09","volume":"38","author":"O Cosma","year":"2022","unstructured":"Cosma, O., Pop, P.C., Pop Sitar, C.: A two-level based genetic algorithm for solving the soft-clustered vehicle routing problem. Carpathian J. Math. 38(1), 117\u20131280 (2022)","journal-title":"Carpathian J. Math."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"15570","DOI":"10.1109\/ACCESS.2021.3053295","volume":"9","author":"O Cosma","year":"2021","unstructured":"Cosma, O., Pop, P.C., Zelina, I.: An effective genetic algorithm for solving the clustered shortest-path tree problem. IEEE Access 9, 15570\u201315591 (2021)","journal-title":"IEEE Access"},{"issue":"3","key":"26_CR4","doi-asserted-by":"publisher","first-page":"401","DOI":"10.37193\/CJM.2020.03.08","volume":"36","author":"O Cosma","year":"2020","unstructured":"Cosma, O., Pop, P.C., Zelina, I.: A novel genetic algorithm for solving the clustered shortest-path tree problem. Carpathian J. Math. 36(3), 401\u2013414 (2020)","journal-title":"Carpathian J. Math."},{"key":"26_CR5","unstructured":"D\u2019Emidio, M., Forlizzi, L., Frigioni, D., Leucci, S., Proietti, G.: On the clustered shortest-path tree problem. In Proceedings of Italian Conference on Theoretical Computer Science, pp. 263-268 (2016)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10878-018-00374-x","volume":"38","author":"M D\u2019Emidio","year":"2019","unstructured":"D\u2019Emidio, M., Forlizzi, L., Frigioni, D., Leucci, S., Proietti, G.: Hardness, approximability and fixed-parameter tractability of the clustered shortest-path tree problem. J. Comb. Optim. 38, 165\u2013184 (2019)","journal-title":"J. Comb. Optim."},{"key":"26_CR7","first-page":"82","volume":"540\u2013541","author":"M Demange","year":"2014","unstructured":"Demange, M., Monnot, J., Pop, P.C., Ries, B.: On the complexity of the selective graph coloring problem in some special classes of graphs. Theoret. Comput. Sci. 540\u2013541, 82\u2013102 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00404-6","volume":"148","author":"C Feremans","year":"2003","unstructured":"Feremans, C., Labbe, M., Laporte, G.: Generalized network design problems. Eur. J. Oper. Res. 148(1), 1\u201313 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.cam.2015.04.030","volume":"293","author":"S Fidanova","year":"2016","unstructured":"Fidanova, S., Pop, P.C.: An improved hybrid ant-local search for the partition graph coloring problem. J. Comput. Appl. Math. 293, 55\u201361 (2016)","journal-title":"J. Comput. Appl. Math."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0377-2217(99)00073-9","volume":"122","author":"G Ghiani","year":"2000","unstructured":"Ghiani, G., Improta, G.: An efficient transformation of the generalized vehicle routing problem. Eur. J. Oper. Res. 122, 11\u201317 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Lin, C.-W., Wu, B.Y.: On the minimum routing cost clustered tree problem. J. Comb. Optim. 33(3), 1106\u20131121 (2017)","DOI":"10.1007\/s10878-016-0026-8"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"119961","DOI":"10.1016\/j.ins.2023.119961","volume":"657","author":"NB Long","year":"2024","unstructured":"Long, N.B., Anh, D.T., Ban, H.-B., Binh, H.T.T.: A multipopulation multitasking evolutionary scheme with adaptive knowledge transfer to solve the clustered minimum routing cost tree problem. Inf. Sci. 657, 119961 (2024)","journal-title":"Inf. Sci."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Masone, A., Nenni, M.E., Sforza, A., Sterle, C.: The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm. Soft Comput. 23, 2947\u20132957 (2019)","DOI":"10.1007\/s00500-018-3557-3"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Mestria, M., Ochi, L.S., de Lima Martins, S.: GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem. Comput. Oper. Res. 40(12), 3218\u20133229 (2013)","DOI":"10.1016\/j.cor.2012.10.001"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.3230260407","volume":"26","author":"YS Myung","year":"1995","unstructured":"Myung, Y.S., Lee, C.H., Tcha, D.W.: On the generalized minimum spanning tree problem. Networks 26, 231\u2013241 (1995)","journal-title":"Networks"},{"key":"26_CR16","doi-asserted-by":"publisher","unstructured":"Petrovan, A., Pop, P.C., Sabo, C., Zelina, I.: A two-level hybrid based genetic algorithm to solve the clustered shortest-path tree problem using the Pr\u00fcfer code. In: Garc\u00eda Bringas, P., et al. Hybrid Artificial Intelligent Systems, HAIS 2022, LNCS, vol. 13469, pp 323\u2013334. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15471-3_28","DOI":"10.1007\/978-3-031-15471-3_28"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"119372","DOI":"10.1016\/j.eswa.2022.119372","volume":"215","author":"A Petrovan","year":"2023","unstructured":"Petrovan, A., Pop, P.C., Sabo, C., Zelina, I.: Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem. Expert Syst. Appl. 215, 119372 (2023)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"26_CR18","doi-asserted-by":"publisher","first-page":"734","DOI":"10.15837\/ijccc.2011.4.2098","volume":"6","author":"C Pintea","year":"2011","unstructured":"Pintea, C., Chira, C., Dumitrescu, D., Pop, P.C.: Sensitive ants in solving the generalized vehicle routing problem. Int. J. Comput. Commun. Control 6(4), 734\u2013741 (2011)","journal-title":"Int. J. Comput. Commun. Control"},{"issue":"2","key":"26_CR19","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ejor.2017.08.015","volume":"265","author":"PC Pop","year":"2018","unstructured":"Pop, P.C., Matei, O., Sabo, C., Petrovan, A.: A two-level solution approach for solving the generalized minimum spanning tree problem. Eur. J. Oper. Res. 265(2), 478\u2013487 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.cie.2017.11.018","volume":"115","author":"PC Pop","year":"2018","unstructured":"Pop, P.C., Fuksz, L., Horvat Marc, A., Sabo, C.: A novel two-level optimization approach for clustered vehicle routing problem. Comput. Ind. Eng. 115, 304\u2013318 (2018)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"26_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2019.05.017","volume":"283","author":"PC Pop","year":"2020","unstructured":"Pop, P.C.: The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances. Eur. J. Oper. Res. 283(1), 1\u201315 (2020)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"26_CR22","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ejor.2023.07.022","volume":"314","author":"PC Pop","year":"2024","unstructured":"Pop, P.C., Cosma, O., Sabo, C., Pop Sitar, C.: A comprehensive survey on the generalized traveling salesman problem. Eur. J. Oper. Res. 314(3), 819\u2013835 (2024)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Pop, P.C.: Generalized Network Design Problems. Modeling and Optimization. De Gruyter Series in Discrete Mathematics and Applications, Germany (2012)","DOI":"10.1515\/9783110267686"},{"key":"26_CR24","doi-asserted-by":"publisher","unstructured":"Thanh, P.D.: CluSPT instances, Mendeley Data v2. https:\/\/doi.org\/10.17632\/b4gcgybvt6.2","DOI":"10.17632\/b4gcgybvt6.2"},{"key":"26_CR25","doi-asserted-by":"publisher","first-page":"108225","DOI":"10.1016\/j.knosys.2022.108225","volume":"241","author":"TB Thang","year":"2022","unstructured":"Thang, T.B., Binh, H.T.T.: A hybrid multifactorial evolutionary algorithm and firefly algorithm for the clustered minimum routing cost tree problem. Knowl.-Based Syst. 241, 108225 (2022)","journal-title":"Knowl.-Based Syst."},{"key":"26_CR26","doi-asserted-by":"publisher","first-page":"107253","DOI":"10.1016\/j.asoc.2021.107253","volume":"105","author":"TB Thang","year":"2021","unstructured":"Thang, T.B., Long, N.B., Hoang, N.V., Binh, H.T.T.: Adaptive knowledge transfer in multifactorial evolutionary algorithm for the clustered minimum routing cost problem. Appl. Soft Comput. 105, 107253 (2021)","journal-title":"Appl. Soft Comput."},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Trung, T.B., Thanh, L.T., Hieu, L.T., Thanh, P.D., Binh, H.T.T.: Multifactorial evolutionary algorithm for clustered minimum routing cost problem. In: Proceedings of the Tenth International Symposium on Information and Communication Technology, pp. 170\u2013177 (2019)","DOI":"10.1145\/3368926.3369712"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74183-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T07:12:46Z","timestamp":1728371566000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74183-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"ISBN":["9783031741821","9783031741838"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74183-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"9 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Hybrid Artificial Intelligence Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Salamanca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hais2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/haisconference.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}