{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T05:34:06Z","timestamp":1777095246962,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T00:00:00Z","timestamp":1774828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T00:00:00Z","timestamp":1774828800000},"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":["Evol. Intel."],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s12065-026-01156-9","type":"journal-article","created":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T08:47:15Z","timestamp":1774860435000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A fast novel heuristic and machine learning-assisted hybrid metaheurics for the Euclidean leaf-constrained minimum spanning tree problem"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-4507-3249","authenticated-orcid":false,"given":"Neha","family":"Varshney","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6226-1308","authenticated-orcid":false,"given":"Vasantha Lakshmi","family":"Chellapilla","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9573-6541","authenticated-orcid":false,"given":"Prem Prakash","family":"Vuppuluri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1169-4549","authenticated-orcid":false,"given":"Patvardhan","family":"Chellapilla","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,30]]},"reference":[{"key":"1156_CR1","doi-asserted-by":"crossref","unstructured":"Birattari M, Kacprzyk J (2009) Tuning metaheuristics: a machine learning perspective (Vol.\u00a0197). Springer","DOI":"10.1007\/978-3-642-00483-4_7"},{"key":"1156_CR2","first-page":"153","volume":"15","author":"O Boruvka","year":"1926","unstructured":"Boruvka O (1926) P\u0159\u00edsp\u011bvek k \u0159e\u0161en\u00ed ot\u00e1zky ekonomick\u00e9 stavby elektrovodn\u00edch s\u00edt\u00ed (contribution to the solution of a problem of economical construction of electrical networks). Elektronick\u1ef3 Obzor 15:153\u2013154","journal-title":"Elektronick\u1ef3 Obzor"},{"key":"1156_CR3","unstructured":"Bureau A (2025) Data by region methodology, 2011-24 \u2014 abs.gov.au. https:\/\/www.abs.gov.au\/methodologies\/data-region-methodology\/2011-24. ([Accessed 17-05-2025])"},{"issue":"1","key":"1156_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01890115","volume":"1","author":"WH Day","year":"1984","unstructured":"Day WH, Edelsbrunner H (1984) Efficient algorithms for agglomerative hierarchical clustering methods. J Classif 1(1):7\u201324. https:\/\/doi.org\/10.1007\/BF01890115","journal-title":"J Classif"},{"key":"1156_CR5","unstructured":"Deo N, Micikevicius P (1999) A heuristic for a leaf constrained minimum spanning tree problem. Congressus Numerantium, 61\u201372,"},{"issue":"1","key":"1156_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1051\/ro\/2014029","volume":"49","author":"EG De Sousa","year":"2015","unstructured":"De Sousa EG, Santos AC, Aloise DJ (2015) An exact method for solving the bi-objective minimum diameter-cost spanning tree problem. RAIRO-Operations Research 49(1):143\u2013160. https:\/\/doi.org\/10.1051\/ro\/2014029","journal-title":"RAIRO-Operations Research"},{"key":"1156_CR7","unstructured":"Dimacs (2014). 11th DIMACS Implementation Challenge \u2014 dimacs11.zib.de. https:\/\/dimacs11.zib.de\/. ([Accessed 17-05-2025])"},{"key":"1156_CR8","unstructured":"Edelson W, Gargano ML (2002) Leaf constrained minimal spanning trees solved by a genertic algorithm. Congressus Numerantium, 41\u201348,"},{"issue":"2","key":"1156_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.ejor.2013.01.001","volume":"229","author":"RZ Farahani","year":"2013","unstructured":"Farahani RZ, Miandoabchi E, Szeto WY, Rashidi H (2013) A review of urban transportation network design problems. Eur J Oper Res 229(2):281\u2013302. https:\/\/doi.org\/10.1016\/j.ejor.2013.01.001","journal-title":"Eur J Oper Res"},{"key":"1156_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10462-010-9158-x","volume":"34","author":"S Farzi","year":"2010","unstructured":"Farzi S, Dastjerdi AB (2010) Leaf constrained minimal spanning trees solved by modified quantum-behaved particle swarm optimization. Artif Intell Rev 34:1\u201317. https:\/\/doi.org\/10.1007\/s10462-010-9158-x","journal-title":"Artif Intell Rev"},{"issue":"3","key":"1156_CR11","first-page":"385","volume":"14","author":"BA Julstrom","year":"2004","unstructured":"Julstrom BA (2004) Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem. Int J Appl Math Comput Sci 14(3):385\u2013396","journal-title":"Int J Appl Math Comput Sci"},{"issue":"2","key":"1156_CR12","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","volume":"296","author":"M Karimi-Mamaghan","year":"2022","unstructured":"Karimi-Mamaghan M, Mohammadi M, Meyer P, Karimi-Mamaghan AM, Talbi E-G (2022) Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art. Eur J Oper Res 296(2):393\u2013422. https:\/\/doi.org\/10.1016\/j.ejor.2021.04.032","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1156_CR13","first-page":"42","volume":"1","author":"NK Kaur","year":"2014","unstructured":"Kaur NK, Kaur U, Singh D (2014) K-medoid clustering algorithm-a review. Int J Comput Appl Technol 1(1):42\u201345","journal-title":"Int J Comput Appl Technol"},{"issue":"1","key":"1156_CR14","doi-asserted-by":"publisher","first-page":"48","DOI":"10.2307\/2033241","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical society 7(1):48\u201350. https:\/\/doi.org\/10.2307\/2033241","journal-title":"Proceedings of the American Mathematical society"},{"key":"1156_CR15","doi-asserted-by":"publisher","unstructured":"Lang RD, Engelbrecht AP (2023). Performance analysis of hybrid sampling and meta-heuristics. Proceedings of the companion conference on genetic and evolutionary computation (pp. 499\u2013502). https:\/\/doi.org\/10.1145\/3583133.359060","DOI":"10.1145\/3583133.359060"},{"issue":"11","key":"1156_CR16","doi-asserted-by":"publisher","first-page":"2969","DOI":"10.1016\/j.cor.2009.01.013","volume":"36","author":"P Martins","year":"2009","unstructured":"Martins P, de Souza MC (2009) Vns and second order heuristics for the min-degree constrained minimum spanning tree problem. Computers & operations research 36(11):2969\u20132982. https:\/\/doi.org\/10.1016\/j.cor.2009.01.013","journal-title":"Computers & operations research"},{"key":"1156_CR17","doi-asserted-by":"publisher","unstructured":"McCosker M, Burton L (2024). Lack of mobile connectivity confronting regional australians. ABC News, , https:\/\/doi.org\/10.25916\/5ed5b6e204a95","DOI":"10.25916\/5ed5b6e204a95"},{"issue":"7","key":"1156_CR18","doi-asserted-by":"publisher","first-page":"8865","DOI":"10.1007\/s10586-024-04416-4","volume":"27","author":"DN Molokomme","year":"2024","unstructured":"Molokomme DN, Onumanyi AJ, Abu-Mahfouz AM (2024) Hybrid metaheuristic schemes with different configurations and feedback mechanisms for optimal clustering applications. Clust Comput 27(7):8865\u20138887. https:\/\/doi.org\/10.1007\/s10586-024-04416-4","journal-title":"Clust Comput"},{"key":"1156_CR19","doi-asserted-by":"publisher","unstructured":"Neha Agarwal K, Yadav P, Lakshmi CV, Vuppuluri PP, Patvardhan C (2023). Clustering-based heuristic approaches for the euclidean leaf-constrained minimum spanning tree problem. 2023 ieee 20th india council international conference (indicon) (pp. 819\u2013824). https:\/\/doi.org\/10.1109\/INDICON59947.2023.10440872","DOI":"10.1109\/INDICON59947.2023.10440872"},{"key":"1156_CR20","unstructured":"Neha V (2025) aez-dataset-lcmst. https:\/\/github.com\/neha-varshney1994\/aez-dataset-lcmst ([Accessed 17-05-2025])"},{"key":"1156_CR21","doi-asserted-by":"publisher","unstructured":"Patvardhan C, Prakash VP (2009) Novel deterministic heuristics for building minimum spanning trees with constrained diameter. Pattern recognition and machine intelligence: Third international conference, premi 2009 new delhi, india, december 16-20, 2009 proceedings 3 (pp. 68\u201373). https:\/\/doi.org\/10.1007\/978-3-642-11164-8_12","DOI":"10.1007\/978-3-642-11164-8_12"},{"issue":"2","key":"1156_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s42979-020-0120-y","volume":"1","author":"VP Prakash","year":"2020","unstructured":"Prakash VP, Patvardhan C (2020) Novel heuristics for the euclidean leaf-constrained minimum spanning tree problem. SN Computer Science 1(2):111. https:\/\/doi.org\/10.1007\/s42979-020-0120-y","journal-title":"SN Computer Science"},{"key":"1156_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.103237","volume":"87","author":"VP Prakash","year":"2020","unstructured":"Prakash VP, Patvardhan C, Srivastav A (2020) A novel hybrid multi-objective evolutionary algorithm for the bi-objective minimum diameter-cost spanning tree (bi-mdcst) problem. Eng Appl Artif Intell 87:103237. https:\/\/doi.org\/10.1016\/j.engappai.2019.103237","journal-title":"Eng Appl Artif Intell"},{"issue":"6","key":"1156_CR24","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC (1957) Shortest connection networks and some generalizations. The Bell System Technical Journal 36(6):1389\u20131401. https:\/\/doi.org\/10.1002\/j.1538-7305.1957.tb01515.x","journal-title":"The Bell System Technical Journal"},{"key":"1156_CR25","first-page":"2825","volume":"12","author":"F Prodregosa","year":"2011","unstructured":"Prodregosa F (2011) Scikit-learn: Machine learning in python. J Mach Learn Res 12:2825\u20132830","journal-title":"J Mach Learn Res"},{"key":"1156_CR26","doi-asserted-by":"publisher","unstructured":"Raidl GR, Julstrom BA (2003). Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. Proceedings of the 2003 acm symposium on applied computing (pp. 747\u2013752). https:\/\/doi.org\/10.1145\/952532.952678","DOI":"10.1145\/952532.952678"},{"key":"1156_CR27","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10898-013-0124-4","volume":"60","author":"AC Santos","year":"2014","unstructured":"Santos AC, Lima DR, Aloise DJ (2014) Modeling and solving the bi-objective minimum diameter-cost spanning tree problem. J Global Optim 60:195\u2013216. https:\/\/doi.org\/10.1007\/s10898-013-0124-4","journal-title":"J Global Optim"},{"key":"1156_CR28","unstructured":"Scikit-learn (2025). Minibatchkmeans. https:\/\/scikit-learn.org\/stable\/modules\/generated\/sklearn.cluster.MiniBatchKMeans.html ([Accessed 17-05-2025])"},{"issue":"2","key":"1156_CR29","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9(2):625\u2013631. https:\/\/doi.org\/10.1016\/j.asoc.2008.09.001","journal-title":"Appl Soft Comput"},{"issue":"04","key":"1156_CR30","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1142\/S0217595908001870","volume":"25","author":"A Singh","year":"2008","unstructured":"Singh A, Baghel AS (2008) New metaheuristic approaches for the leaf-constrained minimum spanning tree problem. Asia-Pacific J Oper Res 25(04):575\u2013589. https:\/\/doi.org\/10.1142\/S0217595908001870","journal-title":"Asia-Pacific J Oper Res"},{"issue":"6","key":"1156_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/345966","volume":"54","author":"E-G Talbi","year":"2021","unstructured":"Talbi E-G (2021) Machine learning into metaheuristics: A survey and taxonomy. ACM Computing Surveys (CSUR) 54(6):1\u201332. https:\/\/doi.org\/10.1145\/345966","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"6","key":"1156_CR32","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1109\/TEVC.2006.877147","volume":"10","author":"Y Xiong","year":"2006","unstructured":"Xiong Y, Golden B, Wasil E (2006) Improved heuristics for the minimum label spanning tree problem. IEEE Trans Evol Comput 10(6):700\u2013703. https:\/\/doi.org\/10.1109\/TEVC.2006.877147","journal-title":"IEEE Trans Evol Comput"},{"key":"1156_CR33","doi-asserted-by":"publisher","unstructured":"Yuan F, Meng Z-H, Zhang H-X, Dong C-R (2004). A new algorithm to get the initial centroids. Proceedings of 2004 international conference on machine learning and cybernetics (ieee cat. no. 04ex826) (Vol.\u00a02, pp. 1191\u20131193). https:\/\/doi.org\/10.1109\/ICMLC.2004.1382371","DOI":"10.1109\/ICMLC.2004.1382371"},{"key":"1156_CR34","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"T Zhang","year":"1997","unstructured":"Zhang T, Ramakrishnan R, Livny M (1997) Birch: A new data clustering algorithm and its applications. Data Min Knowl Disc 1:141\u2013182. https:\/\/doi.org\/10.1023\/A:1009783824328","journal-title":"Data Min Knowl Disc"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-026-01156-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-026-01156-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-026-01156-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:35:00Z","timestamp":1777091700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-026-01156-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,30]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["1156"],"URL":"https:\/\/doi.org\/10.1007\/s12065-026-01156-9","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,30]]},"assertion":[{"value":"17 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2026","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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}],"article-number":"58"}}