{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:45:59Z","timestamp":1770990359183,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T00:00:00Z","timestamp":1770940800000},"content-version":"vor","delay-in-days":23,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Artif Intell"],"DOI":"10.1007\/s44163-025-00743-6","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T05:35:23Z","timestamp":1768973723000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid mating optimization algorithm based on natural mating behaviors for complex optimization problems"],"prefix":"10.1007","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-1567-1149","authenticated-orcid":false,"given":"Neha","family":"Tyagi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7017-1372","authenticated-orcid":false,"given":"Deepshikha","family":"Bhargava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5600-9360","authenticated-orcid":false,"given":"Anil","family":"Ahlawat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,21]]},"reference":[{"key":"743_CR1","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1186\/s40064-016-2064-1","volume":"5","author":"AF Ali","year":"2016","unstructured":"Ali AF, Tawhid MA. A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems. Springerplus. 2016;5:473. https:\/\/doi.org\/10.1186\/s40064-016-2064-1.","journal-title":"Springerplus"},{"key":"743_CR2","unstructured":"An improved salp swarm algorithm for permutation flow shop vehicle routing problem | Scientific Reports [Internet]. [cited 2025 Oct 31]. https:\/\/www.nature.com\/articles\/s41598-025-86054-3?utm_source=chatgpt.com. Accessed 31 Oct 2025"},{"key":"743_CR3","doi-asserted-by":"publisher","first-page":"4207","DOI":"10.1007\/s00366-021-01368-w","volume":"38","author":"BS Yildiz","year":"2022","unstructured":"Yildiz BS, Pholdee N, Bureerat S, Yildiz AR, Sait SM. Enhanced grasshopper optimization algorithm using elite opposition-based learning for solving real-world engineering problems. Eng Comput. 2022;38:4207\u201319. https:\/\/doi.org\/10.1007\/s00366-021-01368-w.","journal-title":"Eng Comput"},{"key":"743_CR4","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 BH, Alawad NA, Barhoush M, Hammad R. Exploratory cuckoo search for solving single-objective optimization problems. Soft Comput. 2021;25:10167\u201380. https:\/\/doi.org\/10.1007\/s00500-021-05939-3.","journal-title":"Soft Comput"},{"key":"743_CR5","doi-asserted-by":"publisher","first-page":"278","DOI":"10.3390\/biomimetics8030278","volume":"8","author":"Z Jak\u0161i\u0107","year":"2023","unstructured":"Jak\u0161i\u0107 Z, Devi S, Jak\u0161i\u0107 O, Guha K. A comprehensive review of bio-inspired optimization algorithms including applications in microelectronics and nanophotonics. Biomimetics. 2023;8:278. https:\/\/doi.org\/10.3390\/biomimetics8030278.","journal-title":"Biomimetics"},{"key":"743_CR6","doi-asserted-by":"publisher","unstructured":"Agarwal S, Rani N, Vajpayee A. Bioinspired Algorithms: Opportunities and Challenges. In: Srivastava S, Anand A, Kumar A, Saini B, Rathore PS, editors. Bio\u2010Inspired Optim Med Data Min [Internet]. 1st ed. Wiley; 2024 [cited 2025 Aug 15]. p. 1\u201330. https:\/\/doi.org\/10.1002\/9781394214211.ch1","DOI":"10.1002\/9781394214211.ch1"},{"key":"743_CR7","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/s10462-025-11251-5","volume":"58","author":"M Dratnal","year":"2025","unstructured":"Dratnal M, Danys L, Martinek R. Bio-inspired optimization methods for visible light communication: a comprehensive review. Artif Intell Rev. 2025;58:246. https:\/\/doi.org\/10.1007\/s10462-025-11251-5.","journal-title":"Artif Intell Rev"},{"key":"743_CR8","doi-asserted-by":"publisher","unstructured":"Bouaouda A, Hashim FA, Sayouti Y, Hussien AG. Pied kingfisher optimizer: a new bio-inspired algorithm for solving numerical optimization and industrial engineering problems. Neural Comput Appl [Internet]. 2024 [cited 2025 Aug 21]; https:\/\/doi.org\/10.1007\/s00521-024-09879-5","DOI":"10.1007\/s00521-024-09879-5"},{"key":"743_CR9","doi-asserted-by":"publisher","unstructured":"Kaur N, Jain C, Rattan M. Optimized Design of Dual-k Spacer FinFET Using Bio-Inspired Artificial Hummingbird Algorithm at 10 nm Gate Length. Natl Acad Sci Lett [Internet]. 2025 [cited 2025 Aug 15]; https:\/\/doi.org\/10.1007\/s40009-025-01753-9","DOI":"10.1007\/s40009-025-01753-9"},{"key":"743_CR10","doi-asserted-by":"publisher","first-page":"21265","DOI":"10.1007\/s11227-023-05444-4","volume":"79","author":"M Barhoush","year":"2023","unstructured":"Barhoush M, Abed-alguni BH, Al-qudah NEA. Improved discrete salp swarm algorithm using exploration and exploitation techniques for feature selection in intrusion detection systems. J Supercomput. 2023;79:21265\u2013309. https:\/\/doi.org\/10.1007\/s11227-023-05444-4.","journal-title":"J Supercomput"},{"key":"743_CR11","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 BH, Paul D. Island-based cuckoo search with elite opposition-based learning and multiple mutation methods for solving optimization problems. Soft Comput. 2022;26:3293\u2013312. https:\/\/doi.org\/10.1007\/s00500-021-06665-6.","journal-title":"Soft Comput"},{"key":"743_CR12","doi-asserted-by":"publisher","first-page":"456","DOI":"10.3390\/info16060456","volume":"16","author":"S Saifullah","year":"2025","unstructured":"Saifullah S, Dre\u017cewski R, Yudhana A, Caesarendra W, Huda N. Bio-inspired metaheuristics in deep learning for brain tumor segmentation: a decade of advances and future directions. Information. 2025;16:456. https:\/\/doi.org\/10.3390\/info16060456.","journal-title":"Information"},{"key":"743_CR13","doi-asserted-by":"publisher","unstructured":"Srivastava S, Anand A, Kumar A, Saini B, Rathore PS, editors. Bio\u2010Inspired Optimization for Medical Data Mining [Internet]. 1st ed. Wiley; 2024 [cited 2025 Aug 15]. https:\/\/doi.org\/10.1002\/9781394214211","DOI":"10.1002\/9781394214211"},{"key":"743_CR14","doi-asserted-by":"publisher","first-page":"603","DOI":"10.32604\/cmc.2024.050523","volume":"81","author":"J Zhao","year":"2024","unstructured":"Zhao J, Wang K, Wang J, Guo X, Qi L. African bison optimization algorithm: a new bio-inspired optimizer with engineering applications. Comput Mater Continua. 2024;81:603\u201323. https:\/\/doi.org\/10.32604\/cmc.2024.050523.","journal-title":"Comput Mater Continua"},{"key":"743_CR15","doi-asserted-by":"publisher","unstructured":"Fossa Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Engineering Applications. Int J Intell Eng Syst. 2024;17:1038\u201347. https:\/\/doi.org\/10.22266\/ijies2024.1031.78","DOI":"10.22266\/ijies2024.1031.78"},{"key":"743_CR16","doi-asserted-by":"publisher","unstructured":"S B, Kadry S, Tk MK, Kumar KS. Bio-inspired Algorithms in Machine Learning and Deep Learning for Disease Detection [Internet]. 1st ed. Boca Raton: CRC Press; 2025 [cited 2025 Aug 15]. https:\/\/doi.org\/10.1201\/9781003538158","DOI":"10.1201\/9781003538158"},{"key":"743_CR17","doi-asserted-by":"publisher","unstructured":"Ahmed K, Hassanien AE, Ezzat E, Bhattacharyya S. Swarming Behaviors of Chicken for Predicting Posts on Facebook Branding Pages. In: Hassanien AE, Tolba MF, Elhoseny M, Mostafa M, editors. Int Conf Adv Mach Learn Technol Appl AMLTA2018 [Internet]. Cham: Springer International Publishing; 2018 [cited 2025 Aug 21]. p. 52\u201361. https:\/\/doi.org\/10.1007\/978-3-319-74690-6_6","DOI":"10.1007\/978-3-319-74690-6_6"},{"key":"743_CR18","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s13278-017-0461-2","volume":"7","author":"R Aswani","year":"2017","unstructured":"Aswani R, Ghrera SP, Kar AK, Chandra S. Identifying buzz in social media: a hybrid approach using artificial bee colony and k-nearest neighbors for outlier detection. Soc Netw Anal Min. 2017;7:38. https:\/\/doi.org\/10.1007\/s13278-017-0461-2.","journal-title":"Soc Netw Anal Min"},{"key":"743_CR19","doi-asserted-by":"publisher","unstructured":"Utama DM, Widodo DS, Wijaya DS. A hybrid white shark optimizer for low-carbon permutation flow shop scheduling. AIP Conf Proc [Internet]. AIP Publishing; 2024 [cited 2025 Nov 10];2927. https:\/\/doi.org\/10.1063\/5.0192211","DOI":"10.1063\/5.0192211"},{"key":"743_CR20","doi-asserted-by":"publisher","DOI":"10.3390\/biomimetics10080533","author":"G Zheng","year":"2025","unstructured":"Zheng G, Wei W, Jia H, Liu Y, Lin J, Zheng G. An improved Elk herd optimization algorithm for maximum power point tracking in photovoltaic systems under partial shading conditions. Biomimetics. 2025. https:\/\/doi.org\/10.3390\/biomimetics10080533.","journal-title":"Biomimetics"},{"key":"743_CR21","doi-asserted-by":"publisher","unstructured":"Karaboga D, Basturk B. Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems. In: Melin P, Castillo O, Aguilar LT, Kacprzyk J, Pedrycz W, editors. Found Fuzzy Log Soft Comput. Berlin, Heidelberg: Springer; 2007. p. 789\u201398. https:\/\/doi.org\/10.1007\/978-3-540-72950-1_77","DOI":"10.1007\/978-3-540-72950-1_77"},{"key":"743_CR22","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1016\/j.procs.2018.05.100","volume":"132","author":"H Ali","year":"2018","unstructured":"Ali H, Kar AK. Discriminant analysis using ant colony optimization \u2013 an intra-algorithm exploration. Procedia Comput Sci. 2018;132:880\u20139. https:\/\/doi.org\/10.1016\/j.procs.2018.05.100.","journal-title":"Procedia Comput Sci"},{"key":"743_CR23","doi-asserted-by":"publisher","first-page":"1397","DOI":"10.1007\/s11831-020-09420-6","volume":"28","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Shehab M, Alshinwan M, Mirjalili S, Elaziz MA. Ant lion optimizer: a comprehensive survey of its variants and applications. Arch Comput Methods Eng. 2021;28:1397\u2013416. https:\/\/doi.org\/10.1007\/s11831-020-09420-6.","journal-title":"Arch Comput Methods Eng"},{"key":"743_CR24","doi-asserted-by":"publisher","first-page":"4418","DOI":"10.1007\/s10489-021-02642-6","volume":"52","author":"G-H Xu","year":"2022","unstructured":"Xu G-H, Zhang T-W, Lai Q. A new firefly algorithm with mean condition partial attraction. Appl Intell. 2022;52:4418\u201331. https:\/\/doi.org\/10.1007\/s10489-021-02642-6.","journal-title":"Appl Intell"},{"key":"743_CR25","doi-asserted-by":"publisher","unstructured":"Yumin Y, Bolin L, Shuai L. A New Optimization Algorithm and Its Comparison on Traditional Optimization Algorithms. 2019 Chin Control Conf CCC [Internet]. Guangzhou, China: IEEE; 2019 [cited 2025 Aug 21]. p. 2698\u2013701. https:\/\/doi.org\/10.23919\/ChiCC.2019.8866517","DOI":"10.23919\/ChiCC.2019.8866517"}],"container-title":["Discover Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44163-025-00743-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44163-025-00743-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44163-025-00743-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T12:45:37Z","timestamp":1770986737000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44163-025-00743-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,21]]},"references-count":25,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["743"],"URL":"https:\/\/doi.org\/10.1007\/s44163-025-00743-6","relation":{},"ISSN":["2731-0809"],"issn-type":[{"value":"2731-0809","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,21]]},"assertion":[{"value":"1 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publish"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Clinical trial number"}}],"article-number":"133"}}