{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T20:22:29Z","timestamp":1774124549379,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T00:00:00Z","timestamp":1740441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T00:00:00Z","timestamp":1740441600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Postgraduate Education Reform Project of Liaoning Province","award":["LNYJG2022137"],"award-info":[{"award-number":["LNYJG2022137"]}]},{"name":"Basic Scientific Research Project of Institution of Higher Learning of Liaoning Province","award":["LJ222410146054"],"award-info":[{"award-number":["LJ222410146054"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10586-024-04895-5","type":"journal-article","created":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T10:04:31Z","timestamp":1740477871000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Victoria Amazonica optimization algorithm based on adaptive mutation factor and mathematical distribution for solving minimum spanning tree problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Xin-Ru","family":"Ma","sequence":"first","affiliation":[]},{"given":"Jie-Sheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yong-Cheng","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Yi-Xuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Si-Wen","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shi-Hui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,25]]},"reference":[{"key":"4895_CR1","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/j.renene.2018.08.077","volume":"130","author":"MA Mohamed","year":"2019","unstructured":"Mohamed, M.A., Diab, A.A.Z., Rezk, H.: Partial shading mitigation of PV systems via different meta-heuristic techniques. Renew. Energy 130, 1159\u20131175 (2019)","journal-title":"Renew. Energy"},{"key":"4895_CR2","doi-asserted-by":"publisher","first-page":"58139","DOI":"10.1109\/ACCESS.2019.2914064","volume":"7","author":"T Jin","year":"2019","unstructured":"Jin, T., Li, Q., Mohamed, M.A.: A novel adaptive EEMD method for switchgear partial discharge signal denoising. IEEE Access 7, 58139\u201358147 (2019)","journal-title":"IEEE Access"},{"issue":"18","key":"4895_CR3","doi-asserted-by":"publisher","first-page":"10382","DOI":"10.3390\/su131810382","volume":"13","author":"MA Mohamed","year":"2021","unstructured":"Mohamed, M.A., Mirjalili, S., Dampage, U., et al.: A cost-efficient-based cooperative allocation of mining devices and renewable resources enhancing blockchain architecture. Sustainability 13(18), 10382 (2021)","journal-title":"Sustainability"},{"key":"4895_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2020.118306","volume":"208","author":"MA Mohamed","year":"2020","unstructured":"Mohamed, M.A., Jin, T., Su, W.: Multi-agent energy management of smart islands using primal-dual method of multipliers. Energy 208, 118306 (2020)","journal-title":"Energy"},{"key":"4895_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10732-017-9323-3","volume":"23","author":"L Anton-Sanchez","year":"2017","unstructured":"Anton-Sanchez, L., Bielza, C., Larra\u00f1aga, P.: Network design through forests with degree\u2212and role\u2212constrained minimum spanning trees. J Heurist 23, 31\u201351 (2017)","journal-title":"J Heurist"},{"issue":"4","key":"4895_CR6","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"B Gavish","year":"1982","unstructured":"Gavish, B.: Topological design of centralized computer networks\u2014formulations and algorithms. Networks 12(4), 355\u2013377 (1982)","journal-title":"Networks"},{"issue":"3","key":"4895_CR7","doi-asserted-by":"publisher","first-page":"1738","DOI":"10.11591\/eei.v12i3.4794","volume":"12","author":"FRP Mary","year":"2023","unstructured":"Mary, F.R.P., Mohanaselvi, S., Broumi, S.: A solution approach to minimum spanning tree problem under fermatean fuzzy environment. Bull. Electr. Eng. Informat. 12(3), 1738\u20131746 (2023)","journal-title":"Bull. Electr. Eng. Informat."},{"issue":"1","key":"4895_CR8","doi-asserted-by":"publisher","first-page":"8591115","DOI":"10.1155\/2023\/8591115","volume":"2023","author":"X Wang","year":"2023","unstructured":"Wang, X., Li, S., Hou, C., et al.: Minimum spanning tree method for sparse graphs. Math. Probl. Eng. 2023(1), 8591115 (2023)","journal-title":"Math. Probl. Eng."},{"key":"4895_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2023.103210","volume":"176","author":"Z Li","year":"2023","unstructured":"Li, Z., Li, G., Xu, Z., et al.: Multiclass bi-criteria traffic assignment without class-specific variables: an alternative formulation and a subgradient projection algorithm. Transp. Res. Part E: Log. Transp. Rev. 176, 103210 (2023)","journal-title":"Transp. Res. Part E: Log. Transp. Rev."},{"issue":"1","key":"4895_CR10","doi-asserted-by":"publisher","first-page":"16786","DOI":"10.1038\/s41598-024-66703-9","volume":"14","author":"L Yang","year":"2024","unstructured":"Yang, L., Zhang, D., Li, L., et al.: Energy efficient cluster-based routing protocol for WSN using multi-strategy fusion snake optimizer and minimum spanning tree. Sci. Rep. 14(1), 16786 (2024)","journal-title":"Sci. Rep."},{"key":"4895_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-024-08974-y","author":"MKM Almansoori","year":"2024","unstructured":"Almansoori, M.K.M., Meszaros, A., Telek, M.: Fast and memory-efficient approximate minimum spanning tree generation for large datasets. Arab. J. Sci. Eng. (2024). https:\/\/doi.org\/10.1007\/s13369-024-08974-y","journal-title":"Arab. J. Sci. Eng."},{"key":"4895_CR12","unstructured":"Lettich, R.: A surprisingly simple method for distributed euclidean-minimum spanning tree\/single linkage dendrogram construction from high dimensional embeddings via distance decomposition. arXiv preprint arXiv:2406.01739 (2024)"},{"key":"4895_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.swevo.2019.07.001","volume":"49","author":"X Zhang","year":"2019","unstructured":"Zhang, X., Kang, Q., Wang, X.: Hybrid biogeography-based optimization with shuffled frog leaping algorithm and its application to minimum spanning tree problems. Swarm Evol. Comput. 49, 245\u2013265 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"3","key":"4895_CR14","doi-asserted-by":"publisher","first-page":"3112","DOI":"10.1137\/23M157627X","volume":"34","author":"CT Ryan","year":"2024","unstructured":"Ryan, C.T., Smith, R.L., Epelman, M.A.: Minimum spanning trees in infinite graphs: theory and algorithms. SIAM J. Optim. 34(3), 3112\u20133135 (2024)","journal-title":"SIAM J. Optim."},{"key":"4895_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107715","volume":"111","author":"S Ghoshal","year":"2021","unstructured":"Ghoshal, S., Sundar, S.: Two approaches for the min-degree constrained minimum spanning tree problem. Appl. Soft Comput. 111, 107715 (2021)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"4895_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2018.05.010","volume":"271","author":"RJ Chagas","year":"2018","unstructured":"Chagas, R.J., Valle, C.A., da Cunha, A.S.: Exact solution approaches for the multi-period degree constrained minimum spanning tree problem. Eur. J. Oper. Res. 271(1), 57\u201371 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"4895_CR17","doi-asserted-by":"crossref","unstructured":"Junaidi, A., Usman, M.: WAC4 algorithm to solve the multiperiod degree constrained minimum spanning tree problem. In: Journal of Physics: Conference Series, vol. 1524, no. 1, p. 012046. IOP Publishing (2020)","DOI":"10.1088\/1742-6596\/1524\/1\/012046"},{"issue":"1","key":"4895_CR18","first-page":"601782","volume":"2015","author":"X Sun","year":"2015","unstructured":"Sun, X., Chang, C., Su, H., et al.: Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm. Math. Probl. Eng. 2015(1), 601782 (2015)","journal-title":"Math. Probl. Eng."},{"key":"4895_CR19","doi-asserted-by":"crossref","unstructured":"Gao, Z., Gui, C., Liu, Y.: Solving degree constrained minimum spanning tree problem based on improved fireworks algorithm. In: Journal of Physics: Conference Series, vol. 2253, no. 1, P. 012013. IOP Publishing (2022)","DOI":"10.1088\/1742-6596\/2253\/1\/012013"},{"issue":"16","key":"4895_CR20","doi-asserted-by":"publisher","first-page":"11289","DOI":"10.1007\/s00500-021-05913-z","volume":"25","author":"K Singh","year":"2021","unstructured":"Singh, K., Sundar, S.: Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem. Soft. Comput. 25(16), 11289\u201311305 (2021)","journal-title":"Soft. Comput."},{"key":"4895_CR21","doi-asserted-by":"publisher","DOI":"10.3389\/fbioe.2022.830037","volume":"10","author":"T Zhang","year":"2022","unstructured":"Zhang, T., Zhou, Y., Zhou, G., et al.: Bioinspired bare bones mayfly algorithm for large\u2212scale spherical minimum spanning tree. Front. Bioeng. Biotechnol. 10, 830037 (2022)","journal-title":"Front. Bioeng. Biotechnol."},{"key":"4895_CR22","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.endm.2018.03.021","volume":"66","author":"JCT Campos","year":"2018","unstructured":"Campos, J.C.T., Martins, A.X., Souza, M.J.F.: A hybrid vns algorithm for solving the multi-level capacitated minimum spanning tree problem. Electron. Notes Discret. Math. 66, 159\u2013166 (2018)","journal-title":"Electron. Notes Discret. Math."},{"issue":"1","key":"4895_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10479-007-0263-4","volume":"159","author":"JEC Arroyo","year":"2008","unstructured":"Arroyo, J.E.C., Vieira, P.S., Vianna, D.S.: A GRASP algorithm for the multi-criteria minimum spanning tree problem. Ann. Oper. Res. 159(1), 125\u2013133 (2008)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"4895_CR24","doi-asserted-by":"publisher","first-page":"3213","DOI":"10.1007\/s13369-020-05141-x","volume":"46","author":"NA Alawad","year":"2021","unstructured":"Alawad, N.A., Abed-alguni, B.H.: Discrete island-based cuckoo search with highly disruptive polynomial mutation and opposition-based learning strategy for scheduling of workflow applications in cloud environments. Arab. J. Sci. Eng. 46(4), 3213\u20133233 (2021)","journal-title":"Arab. J. Sci. Eng."},{"issue":"7","key":"4895_CR25","doi-asserted-by":"publisher","first-page":"3293","DOI":"10.1007\/s00500-021-06665-6","volume":"26","author":"BH Abed-alguni","year":"2022","unstructured":"Abed-alguni, B.H., Paul, D.: Island-based Cuckoo Search with elite opposition-based learning and multiple mutation methods for solving optimization problems. Soft. Comput. 26(7), 3293\u20133312 (2022)","journal-title":"Soft. Comput."},{"issue":"15","key":"4895_CR26","doi-asserted-by":"publisher","first-page":"10167","DOI":"10.1007\/s00500-021-05939-3","volume":"25","author":"BH Abed-alguni","year":"2021","unstructured":"Abed-alguni, B.H., Alawad, N.A., Barhoush, M., et al.: Exploratory cuckoo search for solving single\u2212objective optimization problems. Soft. Comput. 25(15), 10167\u201310180 (2021)","journal-title":"Soft. Comput."},{"issue":"15","key":"4895_CR27","doi-asserted-by":"publisher","first-page":"17217","DOI":"10.1007\/s10489-022-03269-x","volume":"52","author":"BH Abed-Alguni","year":"2022","unstructured":"Abed-Alguni, B.H., Paul, D., Hammad, R.: Improved Salp swarm algorithm for solving single\u2212objective continuous optimization problems. Appl. Intell. 52(15), 17217\u201317236 (2022)","journal-title":"Appl. Intell."},{"key":"4895_CR28","unstructured":"Mousavi, S.M.H.: Victoria Amazonica Optimization (VAO): an algorithm inspired by the giant water Lily plant. arXiv preprint arXiv:2303.08070 (2023)"},{"key":"4895_CR29","unstructured":"Holway, T.: The Flower of Empire: The Amazon's Largest Water Lily, the Quest to Make it Bloom, and the World it Helped Create. Oxford University Press (2013)"},{"key":"4895_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.scienta.2021.110268","volume":"287","author":"H Zhang","year":"2021","unstructured":"Zhang, H., Wu, H., Zhou, Q., et al.: Flowering characteristics and reproductive biology of Nymphaea hybrid, a precious water lily. Sci. Hortic. 287, 110268 (2021)","journal-title":"Sci. Hortic."},{"issue":"2","key":"4895_CR31","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3(2), 82\u2013102 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4895_CR32","unstructured":"Yazdani, D., Branke, J., Omidvar, M.N., et al.: IEEE CEC 2022 competition on dynamic optimization problems generated by generalized moving peaks benchmark. arXiv preprint arXiv:2106.06174 (2021)"},{"issue":"4","key":"4895_CR33","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/985410","volume":"9","author":"W Guo","year":"2013","unstructured":"Guo, W., Zhang, B., Chen, G., et al.: A PSO-optimized minimum spanning tree\u2212based topology control scheme for wireless sensor networks. Int. J. Distrib. Sens. Netw. 9(4), 985410 (2013)","journal-title":"Int. J. Distrib. Sens. Netw."},{"key":"4895_CR34","doi-asserted-by":"crossref","unstructured":"Hosseini, S.M., Khaled, A.A., Jin, M.: Solving Euclidean minimal spanning tree problem using a new meta-heuristic approach: imperialist competitive algorithm (ICA). In: 2012 IEEE International Conference on Industrial Engineering and Engineering Management, pp. 176\u2013181. IEEE (2012)","DOI":"10.1109\/IEEM.2012.6837725"},{"key":"4895_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107194","volume":"155","author":"X Wu","year":"2021","unstructured":"Wu, X., Li, J.: Two layered approaches integrating harmony search with genetic algorithm for the integrated process planning and scheduling problem. Comput. Ind. Eng. 155, 107194 (2021)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"4895_CR36","first-page":"633","volume":"41","author":"SJ Sandeep Kumar","year":"2020","unstructured":"Sandeep Kumar, S.J., Sharma, V.K., Poonia, R.C., et al.: Modified differential evolution algorithm for solving minimum spanning tree. J. Inf. Optim. Sci. 41(2), 633\u2013639 (2020)","journal-title":"J. Inf. Optim. Sci."},{"issue":"1","key":"4895_CR37","first-page":"197","volume":"125","author":"M Lin","year":"2020","unstructured":"Lin, M., Liu, F., Zhao, H., et al.: A novel binary firefly algorithm for the minimum labeling spanning tree problem. CMES-Comput. Model. Eng. Sci. 125(1), 197\u2013214 (2020)","journal-title":"CMES-Comput. Model. Eng. Sci."},{"key":"4895_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119638","volume":"648","author":"M Zhang","year":"2023","unstructured":"Zhang, M., Wang, J.S., Liu, Y., et al.: Multi-objective optimization algorithm based on clustering guided binary equilibrium optimizer and NSGA-III to solve high-dimensional feature selection problem. Inf. Sci. 648, 119638 (2023)","journal-title":"Inf. Sci."},{"key":"4895_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2022.119209","volume":"318","author":"PB Dao","year":"2022","unstructured":"Dao, P.B.: On Wilcoxon rank sum test for condition monitoring and fault detection of wind turbines. Appl. Energy 318, 119209 (2022)","journal-title":"Appl. Energy"},{"key":"4895_CR40","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00521-017-2977-9","volume":"31","author":"U G\u00fcvenc","year":"2019","unstructured":"G\u00fcvenc, U., Kat\u0131rc\u0131o\u011flu, F.: Escape velocity: a new operator for gravitational search algorithm. Neural Comput. Appl. 31, 27\u201342 (2019)","journal-title":"Neural Comput. Appl."},{"key":"4895_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104314","volume":"104","author":"H Zamani","year":"2021","unstructured":"Zamani, H., Nadimi-Shahraki, M.H., Gandomi, A.H.: QANA: Quantum-based avian navigation optimizer algorithm. Eng. Appl. Artif. Intell. 104, 104314 (2021)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"4895_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105799","volume":"144","author":"Y Lu","year":"2022","unstructured":"Lu, Y., Benlic, U., Wu, Q.: A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem. Comput. Oper. Res. 144, 105799 (2022)","journal-title":"Comput. Oper. Res."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-024-04895-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-024-04895-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-024-04895-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T06:32:19Z","timestamp":1757140339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-024-04895-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,25]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["4895"],"URL":"https:\/\/doi.org\/10.1007\/s10586-024-04895-5","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,25]]},"assertion":[{"value":"30 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2025","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 interest"}},{"value":"There are no ethical and informed consent for data used.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"242"}}