{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T12:20:39Z","timestamp":1780057239892,"version":"3.54.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T00:00:00Z","timestamp":1681862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T00:00:00Z","timestamp":1681862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"This work is funded by the Ministry of Education and Training of Vietnam","award":["B2022-BKA-01"],"award-info":[{"award-number":["B2022-BKA-01"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s12065-023-00848-w","type":"journal-article","created":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T13:02:34Z","timestamp":1681909354000},"page":"1547-1566","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Genetic algorithm based approach to solve the Clustered Steiner Tree Problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Tuan Anh","family":"Do","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ha-Bang","family":"Ban","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thi Thanh Binh","family":"Huynh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minh Tu","family":"Le","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Binh Long","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,19]]},"reference":[{"key":"848_CR1","unstructured":"Pr\u00f6mel HJ, Steger A. The Steiner tree problem a tour through graphs, algorithms, and complexity"},{"key":"848_CR2","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/s10878-014-9772-7","volume":"30","author":"BY Wu","year":"2015","unstructured":"Wu BY, Lin CW (2015) On the Clustered Steiner Tree Problem. J Comb Optim 30:370\u2013386. https:\/\/doi.org\/10.1007\/s10878-014-9772-7","journal-title":"J Comb Optim"},{"issue":"2","key":"848_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","volume":"2","author":"JA Chisman","year":"1975","unstructured":"Chisman JA (1975) The clustered traveling salesman problem. Comput Op Res 2(2):115\u2013119","journal-title":"Comput Op Res"},{"key":"848_CR4","unstructured":"D\u2019Emidio M, Forlizzi L, Frigioni D, Leucci S, Proietti G (2016) On the clustered shortest-path tree problem. In: ICTCS, pp 263\u2013268"},{"issue":"3","key":"848_CR5","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1007\/s10878-016-0026-8","volume":"33","author":"C-W Lin","year":"2017","unstructured":"Lin C-W, Wu BY (2017) On the minimum routing cost clustered tree problem. J Comb Optim 33(3):1106\u20131121","journal-title":"J Comb Optim"},{"issue":"03","key":"848_CR6","doi-asserted-by":"publisher","first-page":"1430008","DOI":"10.1142\/S0129065714300083","volume":"24","author":"HD Men\u00e9ndez","year":"2014","unstructured":"Men\u00e9ndez HD, Barrero DF, Camacho D (2014) A genetic graph-based approach for partitional clustering. Int J Neural Syst 24(03):1430008","journal-title":"Int J Neural Syst"},{"issue":"4","key":"848_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S1007-0214(07)70068-8","volume":"12","author":"C Ding","year":"2007","unstructured":"Ding C, Cheng Y, He M (2007) Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPS. Tsinghua Sci Technol 12(4):459\u2013465","journal-title":"Tsinghua Sci Technol"},{"key":"848_CR8","doi-asserted-by":"publisher","unstructured":"Chen L, Abdellatif S, Gayraud T, Berthou P (2017) A Steiner tree based approach for the efficient support of multipoint communications in a multi-domain context. In: 2017 IEEE symposium on computers and communications (ISCC), pp 316\u2013321 https:\/\/doi.org\/10.1109\/ISCC.2017.8024549","DOI":"10.1109\/ISCC.2017.8024549"},{"key":"848_CR9","doi-asserted-by":"publisher","unstructured":"Haghighat AT, Faez K, Dehghan M, Mowlaei A, Ghahremani Y (2002) A genetic algorithm for Steiner tree optimization with multiple constraints using pr\u00fcfer number. In: EurAsia-ICT 2002: information and communication technology, pp 272\u2013280 https:\/\/doi.org\/10.1007\/3-540-36087-5_32","DOI":"10.1007\/3-540-36087-5_32"},{"key":"848_CR10","unstructured":"Hesser J, M\u00e4nner R, Stucky O (1989) Optimization of steiner trees using genetic algorithms. In: Third international conference on genetic algorithms, pp 231\u2013236"},{"key":"848_CR11","unstructured":"Julstrom B (1993) A genetic algorithm for the rectilinear steiner problem. In: 5th international conference on genetic algorithms, pp 474\u2013480"},{"key":"848_CR12","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1038\/sj\/jors\/0440408","volume":"44","author":"A Kapsalis","year":"1993","unstructured":"Kapsalis A, Rayward-Smith V, Smith G (1993) Solving the graphical Steiner tree problem using genetic algorithms. J Op Res Soc 44:397\u2013406. https:\/\/doi.org\/10.1038\/sj\/jors\/0440408","journal-title":"J Op Res Soc"},{"key":"848_CR13","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260403","author":"H Esbensen","year":"1995","unstructured":"Esbensen H (1995) Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm. Networks. https:\/\/doi.org\/10.1002\/net.3230260403","journal-title":"Networks"},{"key":"848_CR14","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"M Mitchell","year":"1998","unstructured":"Mitchell M (1998) An introduction to genetic algorithms. MIT Press, Cambridge. https:\/\/doi.org\/10.7551\/mitpress\/3927.001.0001"},{"key":"848_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10878-018-00374-x","volume":"38","author":"M D\u2019Emidio","year":"2018","unstructured":"D\u2019Emidio M, Forlizzi L, Frigioni D, Leucci S, Proietti G (2018) Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J Comb Optim 38:165\u2013184. https:\/\/doi.org\/10.1007\/s10878-018-00374-x","journal-title":"J Comb Optim"},{"issue":"4","key":"848_CR16","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1007\/s10489-019-01599-x","volume":"50","author":"PD Thanh","year":"2020","unstructured":"Thanh PD, Binh HTT, Trung TB (2020) An efficient strategy for using multifactorial optimization to solve the clustered shortest path tree problem. Appl Intell 50(4):1233\u20131258","journal-title":"Appl Intell"},{"key":"848_CR17","doi-asserted-by":"crossref","unstructured":"Thanh PD, Binh HTT, Long NB et al (2019) A heuristic based on randomized greedy algorithms for the clustered shortest-path tree problem. In: 2019 IEEE congress on evolutionary computation (CEC), IEEE, pp 2915\u20132922","DOI":"10.1109\/CEC.2019.8790070"},{"key":"848_CR18","doi-asserted-by":"crossref","unstructured":"Binh HTT, Thanh PD, Trung TB et al (2018) Effective multifactorial evolutionary algorithm for solving the cluster shortest path tree problem. In: 2018 IEEE congress on evolutionary computation (CEC), IEEE, pp 1\u20138","DOI":"10.1109\/CEC.2018.8477684"},{"key":"848_CR19","doi-asserted-by":"crossref","unstructured":"Thanh PD, Dung DA, Tien TN, Binh HTT (2018) An effective representation scheme in multifactorial evolutionary algorithm for solving cluster shortest-path tree problem. In: 2018 IEEE congress on evolutionary computation (CEC), IEEE, pp 1\u20138","DOI":"10.1109\/CEC.2018.8477684"},{"key":"848_CR20","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.knosys.2019.05.015","volume":"180","author":"HTT Binh","year":"2019","unstructured":"Binh HTT, Thanh PD, Thang TB (2019) New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm. Knowl-Based Syst 180:12\u201325. https:\/\/doi.org\/10.1016\/j.knosys.2019.05.015","journal-title":"Knowl-Based Syst"},{"key":"848_CR21","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1007\/s10878-016-0026-8","volume":"33","author":"CW Lin","year":"2017","unstructured":"Lin CW, Wu BY (2017) On the minimum routing cost clustered tree problem. J Comb Optim 33:1106\u20131121. https:\/\/doi.org\/10.1007\/s10878-016-0026-8","journal-title":"J Comb Optim"},{"key":"848_CR22","doi-asserted-by":"publisher","unstructured":"Trung T, Thanh L, Hieu L, Pham Dinh T, Binh H (2019) Multifactorial evolutionary algorithm for clustered minimum routing cost problem, pp 170\u2013177 https:\/\/doi.org\/10.1145\/3368926.3369712","DOI":"10.1145\/3368926.3369712"},{"key":"848_CR23","doi-asserted-by":"publisher","first-page":"107253","DOI":"10.1016\/j.asoc.2021.107253","volume":"105","author":"TB Thang","year":"2021","unstructured":"Thang TB, Long NB, Hoang NV, Binh HTT (2021) Adaptive knowledge transfer in multifactorial evolutionary algorithm for the clustered minimum routing cost problem. Appl Soft Comput 105:107253","journal-title":"Appl Soft Comput"},{"key":"848_CR24","doi-asserted-by":"publisher","unstructured":"Pham Dinh T (2019) Cluspt instances, mendeley data, v3. https:\/\/doi.org\/10.17632\/b4gcgybvt6.3","DOI":"10.17632\/b4gcgybvt6.3"},{"key":"848_CR25","doi-asserted-by":"publisher","first-page":"100665","DOI":"10.1016\/j.swevo.2020.100665","volume":"54","author":"J Carrasco","year":"2020","unstructured":"Carrasco J, Garc\u00eda S, Rueda MM, Das S, Herrera F (2020) Recent trends in the use of statistical tests for comparing swarm and evolutionary computing algorithms: practical guidelines and a critical review. Swarm Evolut Comput 54:100665","journal-title":"Swarm Evolut Comput"},{"issue":"1","key":"848_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318","journal-title":"Swarm Evol Comput"},{"issue":"4","key":"848_CR27","first-page":"808","volume":"50","author":"Z Stakic","year":"2021","unstructured":"Stakic Z (2021) Anokic: a reduced variable neighborhood search approach to the heterogeneous vector bin packing problem. J ICT 50(4):808\u2013826","journal-title":"J ICT"},{"issue":"1","key":"848_CR28","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.2991\/ijcis.d.210226.001","volume":"14","author":"H-B BAN","year":"2021","unstructured":"BAN H-B (2021) Applying metaheuristic for time-dependent traveling salesman problem in postdisaster. Int J Comput Intell Syst 14(1):1087\u20131107","journal-title":"Int J Comput Intell Syst"},{"issue":"4","key":"848_CR29","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1007\/s10878-021-00716-2","volume":"41","author":"H-B BAN","year":"2021","unstructured":"BAN H-B (2021) A metaheuristic for the delivery man problem with time windows. J Comb Optim 41(4):794\u2013816","journal-title":"J Comb Optim"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-023-00848-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-023-00848-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-023-00848-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T08:16:31Z","timestamp":1716279391000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-023-00848-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,19]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["848"],"URL":"https:\/\/doi.org\/10.1007\/s12065-023-00848-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2368144\/v1","asserted-by":"object"}]},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,19]]},"assertion":[{"value":"12 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interest or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}