{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T09:03:09Z","timestamp":1785402189938,"version":"3.56.0"},"reference-count":40,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T00:00:00Z","timestamp":1775088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004488","name":"HRZZ","doi-asserted-by":"publisher","award":["410-25-2"],"award-info":[{"award-number":["410-25-2"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]},{"award":["410-25-2"],"award-info":[{"award-number":["410-25-2"]}],"id":[{"id":"https:\/\/ror.org\/03n51vw80","id-type":"ROR","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100023652","name":"University of Rijeka","doi-asserted-by":"crossref","award":["uniri-iz-25-103"],"award-info":[{"award-number":["uniri-iz-25-103"]}],"id":[{"id":"10.13039\/501100023652","id-type":"DOI","asserted-by":"crossref"}]},{"award":["uniri-iz-25-103"],"award-info":[{"award-number":["uniri-iz-25-103"]}],"id":[{"id":"https:\/\/ror.org\/05r8dqr10","id-type":"ROR","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Nature-inspired metaheuristic algorithms are commonly applied to complex combinatorial optimization problems where exact methods are computationally impractical. Tourist route optimization is a representative multi-objective problem characterized by realistic constraints such as travel time, cost, opening hours, and transportation modes. Although Mushroom Reproduction Optimization is computationally efficient, it often experiences premature convergence in complex search spaces. This paper proposes a novel hybrid algorithm, Mushroom\u2013Weed Hybrid Reproduction Optimization (MWHRO), which integrates the colony-based local search of the Mushroom Reproduction algorithm with the fitness-proportional reproduction and competitive elimination mechanisms of Invasive Weed Optimization. Hybridization enhances population diversity and global exploration while preserving fast convergence. The proposed algorithm is evaluated based on a realistic tourist route optimization problem using real-world data from Zagreb, Croatia, across multiple transportation modes and objective-weight scenarios. Performance is compared against Ant Colony Optimization, Invasive Weed Optimization, Particle Swarm Optimization, and standard Mushroom Reproduction Optimization under equal evaluation budgets. Experimental results demonstrate that the proposed MWHRO algorithm consistently achieves high-quality solutions with significantly lower execution times, particularly in constrained and multimodal scenarios. Statistical analysis confirms the robustness and practical suitability of the proposed approach for real-world route optimization.<\/jats:p>","DOI":"10.3390\/a19040275","type":"journal-article","created":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T07:57:55Z","timestamp":1775116675000},"page":"275","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The New Mushroom\u2013Weed Hybrid Reproduction Optimization Algorithm and Its Application to Tourist Route Planning"],"prefix":"10.3390","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-1052-718X","authenticated-orcid":false,"given":"Domagoj","family":"Palinic","sequence":"first","affiliation":[{"name":"Faculty of Engineering, University of Rijeka, 51000 Rijeka, Croatia"},{"name":"Faculty of Informatics and Digital Technologies, University of Rijeka, 51000 Rijeka, Croatia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rea","family":"Aladrovic","sequence":"additional","affiliation":[{"name":"Faculty of Informatics and Digital Technologies, University of Rijeka, 51000 Rijeka, Croatia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1940-5089","authenticated-orcid":false,"given":"Marina","family":"Ivasic-Kos","sequence":"additional","affiliation":[{"name":"Faculty of Informatics and Digital Technologies, University of Rijeka, 51000 Rijeka, Croatia"},{"name":"Centre for Artificial Intelligence, University of Rijeka, 51000 Rijeka, Croatia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4058-8449","authenticated-orcid":false,"given":"Jonatan","family":"Lerga","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, University of Rijeka, 51000 Rijeka, Croatia"},{"name":"Centre for Artificial Intelligence, University of Rijeka, 51000 Rijeka, Croatia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2026,4,2]]},"reference":[{"key":"ref_1","unstructured":"(2026, March 03). Optimization Problem, Available online: https:\/\/xlinux.nist.gov\/dads\/HTML\/optimization.html."},{"key":"ref_2","unstructured":"(2026, March 03). Constraint Satisfaction and Optimisation Group, University of Essex. Combinatorial Explosion. Edward Tsang, Combinatorial Explosion (Tutorial). Available online: https:\/\/www.bracil.net\/finance\/ComputationalFinanceTeaching\/CombinatorialExplosion.html."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Korte, B., and Vygen, J. (2000). Combinatorial Optimization: Theory and Algorithms, Springer.","DOI":"10.1007\/978-3-662-21708-5"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","article-title":"Metaheuristics in combinatorial optimization: Overview and conceptual comparison","volume":"35","author":"Blum","year":"2003","journal-title":"ACM Comput. Surv."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Dorigo, M., and St\u00fctzle, T. (2004). Ant Colony Optimization, The MIT Press.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.ecoinf.2006.07.003","article-title":"A novel numerical optimization algorithm inspired from weed colonization","volume":"1","author":"Mehrabian","year":"2006","journal-title":"Ecol. Inform."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Bidar, M., Kanan, H.R., Mouhoub, M., and Sadaoui, S. (2018). Mushroom Reproduction Optimization (MRO): A novel nature-inspired evolutionary algorithm. 2018 IEEE Congress on Evolutionary Computation (CEC), IEEE.","DOI":"10.1109\/CEC.2018.8477837"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"10031","DOI":"10.1109\/ACCESS.2022.3142859","article-title":"Particle Swarm Optimization: A Comprehensive Survey","volume":"10","author":"Shami","year":"2022","journal-title":"IEEE Access"},{"key":"ref_9","unstructured":"Lackovi\u0107, R. (2025). Optimizacija Turisti\u010dke Rute Kori\u0161tenjem Prirodom Inspiriranih Algoritama. [Bachelor\u2019s Thesis, University of Rijeka]."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s11537-007-0657-8","article-title":"Mean field games","volume":"2","author":"Lasry","year":"2007","journal-title":"Jpn. J. Math."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"114700","DOI":"10.1016\/j.jcp.2026.114700","article-title":"An online interactive physics-informed diffusion-adversarial network for solving mean field games","volume":"552","author":"Xu","year":"2026","journal-title":"J. Comput. Phys."},{"key":"ref_12","first-page":"100228","article-title":"A systematic literature review for the tourist trip design problem: Extensions, solution techniques and future research lines","volume":"9","year":"2022","journal-title":"Oper. Res. Perspect."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"3973","DOI":"10.1007\/s40747-021-00635-z","article-title":"Tourism route optimization based on improved knowledge ant colony algorithm","volume":"8","author":"Li","year":"2022","journal-title":"Complex Intell. Syst."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Liang, S., Jiao, T., Du, W., and Qu, S. (2021). An improved ant colony optimization algorithm based on context for tourism route planning. PLoS ONE, 16.","DOI":"10.1371\/journal.pone.0257317"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"20220541","DOI":"10.1515\/geo-2022-0541","article-title":"A novel travel route planning method based on an ant colony optimization algorithm","volume":"15","author":"He","year":"2023","journal-title":"Open Geosci."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Mavrovouniotis, M., Anastasiadou, M.N., and Hadjimitsis, D. (2023). Measuring the performance of ant colony optimization algorithms for the dynamic traveling salesman problem. Algorithms, 16.","DOI":"10.3390\/a16120545"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"7665874","DOI":"10.1155\/2022\/7665874","article-title":"An Optimal Round-Trip Route Planning Method for Tourism Based on Improved Genetic Algorithm","volume":"2022","author":"Cao","year":"2022","journal-title":"Comput. Intell. Neurosci."},{"key":"ref_18","first-page":"6467086","article-title":"Particle Swarm Algorithm and Its Application in Tourism Route Design and Optimization","volume":"2022","author":"Lu","year":"2022","journal-title":"Comput. Intell. Neurosci."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Alhasan, W. (2024). Towards Enhanced Route Optimization in Tourism: Adaptive Particle Swarm Strategies for Multi-Objective Tourist Trip Planning. SSRN, Available online: https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=5067411.","DOI":"10.2139\/ssrn.5067411"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Yang, Y. (2024). An optimization method for tour routes of characteristic tourist attractions considering tourists45 preferences. Proceedings of the 2024 International Conference on Computer and Multimedia Technology, Association for Computing Machinery.","DOI":"10.1145\/3675249.3675326"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Kiran, A., Nagaraju, C., Babu, J.C., Venkatesh, B., Kumar, A., Khan, S.B., Albuali, A., and Basheer, S. (2024). Hybrid optimization algorithm for enhanced performance and security of counter-flow shell and tube heat exchangers. PLoS ONE, 19.","DOI":"10.1371\/journal.pone.0298731"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1049\/smt2.12185","article-title":"The hybrid algorithms in constrained optimization of the permanent magnet motors","volume":"18","author":"Devarapalli","year":"2024","journal-title":"IET Sci. Meas. Technol."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Seyyedabbasi, A. (2025). A Hybrid Multi-Strategy Optimization Metaheuristic Algorithm for Multi-Level Thresholding Color Image Segmentation. Appl. Sci., 15.","DOI":"10.3390\/app15137255"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Muthuraman, S., and Venkatesan, V.P. (2017). A Comprehensive Study on Hybrid Meta-Heuristic Approaches Used for Solving Combinatorial Optimization Problems. Proceedings of the World Congress on Computing and Communication Technologies (WCCCT 2017), IEEE.","DOI":"10.1109\/WCCCT.2016.53"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"8468438","DOI":"10.1155\/2022\/8468438","article-title":"Logistics distribution route optimization based on genetic algorithm","volume":"2022","author":"Xin","year":"2022","journal-title":"Comput. Intell. Neurosci."},{"key":"ref_26","first-page":"1377","article-title":"Research on the optimization of tourist attraction route planning through multiple big data","volume":"18","author":"Dong","year":"2024","journal-title":"Int. Dec. Tech."},{"key":"ref_27","unstructured":"Saleh, M.B., Grunder, O., and El Hassani, A.H. (2023). Discrete invasive weed optimization and greedy hybridization algorithm for home care multi-days assignment scheduling and routing problems. 2023 9th International Conference on Control, Decision and Information Technologies (CoDIT), IEEE."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"85103","DOI":"10.1007\/s11042-024-19437-9","article-title":"An Effective Hybrid Metaheuristic Algorithm for Solving Global Optimization Algorithms","volume":"83","author":"Seyyedabbasi","year":"2024","journal-title":"Multimed. Tools Appl."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Fuladi, S.K., and Kim, C.S. (2024). Dynamic events in the flexible job-shop scheduling problem: Rescheduling with a hybrid metaheuristic algorithm. Algorithms, 17.","DOI":"10.3390\/a17040142"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2307","DOI":"10.1007\/s42044-025-00317-w","article-title":"Bioluminescent fungi optimization algorithm and its applications to solve engineering optimization problems","volume":"8","author":"Beheshti","year":"2025","journal-title":"Iran J. Comput. Sci."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Gandomi, A.H., Yang, X.-S., Talatahari, S., and Alavi, A.H. (2013). Metaheuristic Algorithms in Modeling and Optimization. Metaheuristic Applications in Structures and Infrastructures, Elsevier.","DOI":"10.1016\/B978-0-12-398364-0.00001-2"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","article-title":"Ant Colony Optimization","volume":"1","author":"Dorigo","year":"2006","journal-title":"IEEE Comput. Intell. Mag."},{"key":"ref_33","unstructured":"Solgi, M., Lo\u00e1iciga, H.A., and Borzog-Haddad, O. (2017). Meta-Heuristic and Evolutionary Algorithms for Engineering Optimization, Wiley."},{"key":"ref_34","unstructured":"(2026, January 29). Routes API. Available online: https:\/\/developers.google.com\/maps\/documentation\/routes\/reference\/rest."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","article-title":"Individual Comparisons by Ranking Methods","volume":"1","author":"Wilcoxon","year":"1945","journal-title":"Biom. Bull."},{"key":"ref_36","unstructured":"(2026, January 30). Cliff\u2019s Delta Effect Size. Available online: https:\/\/tkimhofer.github.io\/metabom8\/reference\/es_cdelta.html."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"72","DOI":"10.2307\/1412159","article-title":"The proof and measurement of association between two things","volume":"15","author":"Spearman","year":"1904","journal-title":"Am. J. Psychol."},{"key":"ref_38","unstructured":"(2026, January 30). Jupyter Notebook. Available online: https:\/\/jupyter.org\/."},{"key":"ref_39","unstructured":"(2026, January 30). The Python Standard Library. Available online: https:\/\/docs.python.org\/3\/library\/index.html."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"e70173","DOI":"10.1112\/jlms.70173","article-title":"Decoding a mean field game by the Cauchy data around its unknown stationary states","volume":"111","author":"Liu","year":"2025","journal-title":"J. Lond. Math. Soc."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/19\/4\/275\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:13:50Z","timestamp":1775276030000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/19\/4\/275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,2]]},"references-count":40,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["a19040275"],"URL":"https:\/\/doi.org\/10.3390\/a19040275","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,2]]}}}