{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:10Z","timestamp":1742913730986,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031210938"},{"type":"electronic","value":"9783031210945"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21094-5_15","type":"book-chapter","created":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T00:02:48Z","timestamp":1668038568000},"page":"201-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Slime Mould Algorithm: An Experimental Study of\u00a0Nature-Inspired Optimiser"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2956-1226","authenticated-orcid":false,"given":"Petr","family":"Bujok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Lacko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,10]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106642","volume":"95","author":"M Abdel-Basset","year":"2020","unstructured":"Abdel-Basset, M., Chang, V., Mohamed, R.: HSMA_WOA: a hybrid novel Slime mould algorithm with whale optimization algorithm for tackling the image segmentation problem of chest X-ray images. Appl. Soft Comput. 95, 106642 (2020). https:\/\/doi.org\/10.1016\/j.asoc.2020.106642","journal-title":"Appl. Soft Comput."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.asoc.2018.02.025","volume":"66","author":"IB Aydilek","year":"2018","unstructured":"Aydilek, I.B.: A hybrid firefly and particle swarm optimization algorithm for computationally expensive numerical problems. Appl. Soft Comput. 66, 232\u2013249 (2018)","journal-title":"Appl. Soft Comput."},{"key":"15_CR3","first-page":"7","volume":"23","author":"P Bujok","year":"2017","unstructured":"Bujok, P., Tvrd\u00edk, J., Pol\u00e1kov\u00e1, R.: Nature-inspired algorithms in real-world optimization problems. MENDEL Soft Comput. J. 23, 7\u201314 (2017)","journal-title":"MENDEL Soft Comput. J."},{"key":"15_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.01.006","volume":"50","author":"P Bujok","year":"2019","unstructured":"Bujok, P., Tvrd\u00edk, J., Pol\u00e1kov\u00e1, R.: Comparison of nature-inspired population-based algorithms on continuous optimisation problems. Swarm Evol. Comput. 50, 100490 (2019). https:\/\/doi.org\/10.1016\/j.swevo.2019.01.006","journal-title":"Swarm Evol. Comput."},{"key":"15_CR5","unstructured":"Das, S., Suganthan, P.N.: Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems. Technical report, Jadavpur University, India and Nanyang Technological University, Singapore (2010)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-01085-9_2","volume-title":"Foundations of Computational Intelligence","author":"S Das","year":"2009","unstructured":"Das, S., Biswas, A., Dasgupta, S., Abraham, A.: Bacterial foraging optimization algorithm: theoretical foundations, analysis, and applications. In: Abraham, A., Hassanien, A.E., Siarry, P., Engelbrecht, A. (eds.) Foundations of Computational Intelligence, vol. 203, pp. 23\u201355. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01085-9_2"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ins.2014.08.053","volume":"293","author":"B Dogan","year":"2015","unstructured":"Dogan, B., \u00d6lmez, T.: A new metaheuristic for numerical function optimization: Vortex search algorithm. Inf. Sci. 293, 125\u2013145 (2015)","journal-title":"Inf. Sci."},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.2307\/2435936","volume":"18","author":"FL Howard","year":"1931","unstructured":"Howard, F.L.: The life history of physarum polycephalum. Am. J. Botany 18(2), 116\u2013133 (1931). https:\/\/doi.org\/10.2307\/2435936","journal-title":"Am. J. Botany"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: 1995 IEEE International Conference on Neural Networks Proceedings, vol. 1\u20136, pp. 1942\u20131948. IEEE, Neural Networks Council (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"19","key":"15_CR10","doi-asserted-by":"publisher","first-page":"6686","DOI":"10.1016\/j.eswa.2015.04.055","volume":"42","author":"MS Kiran","year":"2015","unstructured":"Kiran, M.S.: TSA: tree-seed algorithm for continuous optimization. Expert Syst. Appl. 42(19), 6686\u20136698 (2015). https:\/\/doi.org\/10.1016\/j.eswa.2015.04.055","journal-title":"Expert Syst. Appl."},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Kumar, C., Raj, T.D., Premkumar, M., Raj, T.D.: A new stochastic Slime mould optimization algorithm for the estimation of solar photovoltaic cell parameters. Optik 223 (2020). https:\/\/doi.org\/10.1016\/j.ijleo.2020.165277","DOI":"10.1016\/j.ijleo.2020.165277"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.future.2020.03.055","volume":"111","author":"S Li","year":"2020","unstructured":"Li, S., Chen, H., Wang, M., Heidari, A.A., Mirjalili, S.: Slime mould algorithm: a new method for stochastic optimization. Future Generation Computer Systems-The International Journal Of Escience 111, 300\u2013323 (2020). https:\/\/doi.org\/10.1016\/j.future.2020.03.055","journal-title":"Future Generation Computer Systems-The International Journal Of Escience"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Liang, X., Wu, D., Liu, Y., He, M., Sun, L.: An enhanced Slime mould algorithm and its application for digital IIR filter design. Discrete Dynamics in Nature and Society 2021 (2021). https:\/\/doi.org\/10.1155\/2021\/5333278","DOI":"10.1155\/2021\/5333278"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.ecoinf.2006.07.003","volume":"1","author":"A Mehrabian","year":"2006","unstructured":"Mehrabian, A., Lucas, C.: A novel numerical optimization algorithm inspired from weed colonization. Ecological Informat. 1(4), 355\u2013366 (2006)","journal-title":"Ecological Informat."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46\u201361 (2014)","journal-title":"Adv. Eng. Softw."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.matcom.2022.02.030","volume":"198","author":"BN Ornek","year":"2022","unstructured":"Ornek, B.N., Aydemir, S.B., Duzenli, T., Ozak, B.: A novel version of Slime mould algorithm for global optimization and real world engineering problems enhanced slime mould algorithm. Math. Comput. Simul. 198, 253\u2013288 (2022). https:\/\/doi.org\/10.1016\/j.matcom.2022.02.030","journal-title":"Math. Comput. Simul."},{"key":"15_CR17","first-page":"1337","volume":"24","author":"L Rastrigin","year":"1963","unstructured":"Rastrigin, L.: The convergence of random search method in extremal control of many-parameter system. Autom. Remote. Control. 24, 1337\u20131342 (1963)","journal-title":"Autom. Remote. Control."},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"al Rifaie, M.M.: Dispersive flies optimisation. In: Federated Conference on Computer Science and Information Systemss, 2014. ACSIS-Annals of Computer Science and Information Systems, vol. 2, pp. 529\u2013538 (2014)","DOI":"10.15439\/2014F142"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.isatra.2021.04.011","volume":"121","author":"RM Rizk-Allah","year":"2022","unstructured":"Rizk-Allah, R.M., Hassanien, A.E., Song, D.: Chaos-opposition-enhanced Slime mould algorithm for minimizing the cost of energy for the wind turbines on high-altitude sites. ISA Trans. 121, 191\u2013205 (2022). https:\/\/doi.org\/10.1016\/j.isatra.2021.04.011","journal-title":"ISA Trans."},{"issue":"6","key":"15_CR20","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon, D.: Biogeography-based optimization. IEEE Trans. Evol. Comput. 12(6), 702\u2013713 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Tanabe, R., Fukunaga, A.S.: Improving the search performance of shade using linear population size reduction. In: IEEE Congress on Evolutionary Computation (CEC) 2014, pp. 1658\u20131665 (2014)","DOI":"10.1109\/CEC.2014.6900380"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Tzanetos, A., Dounias, G.: A new metaheuristic method for optimization: sonar inspired optimization. In: Engineering Applications of Neural Networks (EANN), pp. 417\u2013428 (2017)","DOI":"10.1007\/978-3-319-65172-9_35"},{"key":"15_CR23","unstructured":"Wang, G.G., Deb, S., Cui, Z.: Monarch butterfly optimization. Neural Comput. Appl., 1\u201320 (2015)"},{"issue":"6","key":"15_CR24","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1504\/IJBIC.2016.081335","volume":"8","author":"GG Wang","year":"2017","unstructured":"Wang, G.G., Deb, S., Gao, X.Z., Coelho, L.D.S.: A new metaheuristic optimisation algorithm motivated by elephant herding behaviour. Int. J. Bio-Inspired Comput. 8(6), 394\u2013409 (2017)","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.asoc.2014.01.038","volume":"18","author":"Y Wang","year":"2014","unstructured":"Wang, Y., Li, H.X., Huang, T., Li, L.: Differential evolution based on covariance matrix learning and bimodal distribution parameter setting. Appl. Soft Comput. 18, 232\u2013247 (2014)","journal-title":"Appl. Soft Comput."},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: A new metaheuristic bat-inspired algorithm. In: Gonzalez, J., Pelta, D., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) NICSO 2010: Nature Inspired Cooperative Strategies for Optimization. Studies in Computational Intelligence, vol. 284, pp. 65\u201374 (2010)","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: Nature-Inspired Optimization Algorithms. Elsevier (2014)","DOI":"10.1016\/B978-0-12-416743-8.00005-1"},{"key":"15_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13369-021-06513-7","volume":"7","author":"S Yin","year":"2022","unstructured":"Yin, S., Luo, Q., Zhou, Y.: EOSMA: an equilibrium optimizer Slime mould algorithm for engineering design problems. Arab. J. Sci. Eng. 7, 1\u201332 (2022). https:\/\/doi.org\/10.1007\/s13369-021-06513-7","journal-title":"Arab. J. Sci. Eng."},{"key":"15_CR29","unstructured":"Zelinka, I., Lampinen, J.: SOMA - self organizing migrating algorithm. In: Matousek, R. (ed.) MENDEL, 6th International Conference On Soft Computing, pp. 177\u2013187. Czech Republic, Brno (2000)"},{"key":"15_CR30","doi-asserted-by":"publisher","unstructured":"Zhu, Z.: An improved solution to generation scheduling problem using slime mold algorithm. Front. Ener. Res. 10 (2022). https:\/\/doi.org\/10.3389\/fenrg.2022.878810","DOI":"10.3389\/fenrg.2022.878810"},{"key":"15_CR31","doi-asserted-by":"publisher","unstructured":"Zubaidi, S.L., et al.: Hybridised artificial neural network model with slime mould algorithm: a novel methodology for prediction of urban stochastic water demand. Water 12(10) (2020). https:\/\/doi.org\/10.3390\/w12102692","DOI":"10.3390\/w12102692"}],"container-title":["Lecture Notes in Computer Science","Bioinspired Optimization Methods and Their Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21094-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T21:24:10Z","timestamp":1728336250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21094-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031210938","9783031210945"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21094-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIOMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bioinspired Optimization Methods and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Maribor","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bioma2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/bioma2022.um.si\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}