{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:33:07Z","timestamp":1762918387110,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031425042"},{"type":"electronic","value":"9783031425059"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-42505-9_36","type":"book-chapter","created":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T07:03:11Z","timestamp":1694588591000},"page":"427-438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Barnacles Movement Optimizer (IBMO) Algorithm for\u00a0Engineering Design Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7064-255X","authenticated-orcid":false,"given":"Syed Kumayl","family":"Raza Moosavi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5025-2009","authenticated-orcid":false,"given":"Muhammad Hamza","family":"Zafar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1443-9458","authenticated-orcid":false,"given":"Seyedali","family":"Mirjalili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1437-8368","authenticated-orcid":false,"given":"Filippo","family":"Sanfilippo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,14]]},"reference":[{"issue":"7","key":"36_CR1","doi-asserted-by":"publisher","first-page":"2949","DOI":"10.1007\/s00521-020-05107-y","volume":"33","author":"L Abualigah","year":"2021","unstructured":"Abualigah, L.: Group search optimizer: a nature-inspired meta-heuristic optimization algorithm with its results, variants, and applications. Neural Comput. Appl. 33(7), 2949\u20132972 (2021)","journal-title":"Neural Comput. Appl."},{"key":"36_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah, L., Diabat, A., Mirjalili, S., Abd Elaziz, M., Gandomi, A.H.: The arithmetic optimization algorithm. Comput. Methods Appl. Mech. Eng. 376, 113609 (2021)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"3","key":"36_CR3","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1093\/zoolinnean\/zlaa160","volume":"193","author":"BK Chan","year":"2021","unstructured":"Chan, B.K., et al.: The evolutionary diversity of barnacles, with an updated classification of fossil and living forms. Zool. J. Linn. Soc. 193(3), 789\u2013846 (2021)","journal-title":"Zool. J. Linn. Soc."},{"key":"36_CR4","first-page":"1","volume":"2020","author":"Y Dong","year":"2020","unstructured":"Dong, Y., Hou, J., Zhang, N., Zhang, M.: Research on how human intelligence, consciousness, and cognitive computing affect the development of artificial intelligence. Complexity 2020, 1\u201310 (2020)","journal-title":"Complexity"},{"key":"36_CR5","doi-asserted-by":"publisher","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant colony optimization: overview and recent advances. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 227\u2013263. Springer, Boston (2019). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_8","DOI":"10.1007\/978-1-4419-1665-5_8"},{"key":"36_CR6","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-33206-7_1","volume-title":"Theory and Principled Methods for the Design of Metaheuristics","author":"C Igel","year":"2014","unstructured":"Igel, C.: No free lunch theorems: limitations and perspectives of metaheuristics. In: Borenstein, Y., Moraglio, A. (eds.) Theory and Principled Methods for the Design of Metaheuristics. NCS, pp. 1\u201323. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-33206-7_1"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995-International Conference on Neural Networks, vol. 4, pp. 1942\u20131948. IEEE (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.asoc.2017.11.006","volume":"62","author":"M Mafarja","year":"2018","unstructured":"Mafarja, M., Mirjalili, S.: Whale optimization approaches for wrapper feature selection. Appl. Soft Comput. 62, 441\u2013453 (2018)","journal-title":"Appl. Soft Comput."},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s00521-015-1920-1","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S.: Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput. Appl. 27, 1053\u20131073 (2016)","journal-title":"Neural Comput. Appl."},{"key":"36_CR10","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":"36_CR11","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10489-017-1019-8","volume":"48","author":"SZ Mirjalili","year":"2018","unstructured":"Mirjalili, S.Z., Mirjalili, S., Saremi, S., Faris, H., Aljarah, I.: Grasshopper optimization algorithm for multi-objective optimization problems. Appl. Intell. 48, 805\u2013820 (2018)","journal-title":"Appl. Intell."},{"key":"36_CR12","unstructured":"Oestreicher, C.: A History of Chaos Theory. Dialogues in Clinical Neuroscience (2022)"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1590\/S1415-47572005000300027","volume":"28","author":"AE Stark","year":"2005","unstructured":"Stark, A.E.: The Hardy-Weinberg principle. Genet. Mol. Biol. 28, 485\u2013485 (2005)","journal-title":"Genet. Mol. Biol."},{"key":"36_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.103330","volume":"87","author":"MH Sulaiman","year":"2020","unstructured":"Sulaiman, M.H., Mustaffa, Z., Saari, M.M., Daniyal, H.: Barnacles mating optimizer: a new bio-inspired algorithm for solving engineering optimization problems. Eng. Appl. Artif. Intell. 87, 103330 (2020)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"36_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2020.113017","volume":"366","author":"C Wang","year":"2020","unstructured":"Wang, C., Koh, J.M., Yu, T., Xie, N.G., Cheong, K.H.: Material and shape optimization of bi-directional functionally graded plates by giga and an improved multi-objective particle swarm optimization algorithm. Comput. Methods Appl. Mech. Eng. 366, 113017 (2020)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"36_CR16","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-03404-1_11","volume-title":"Innovative Computational Intelligence: A Rough Guide to 134 Clever Algorithms","author":"B Xing","year":"2014","unstructured":"Xing, B., Gao, W.-J.: Fruit fly optimization algorithm. In: Innovative Computational Intelligence: A Rough Guide to 134 Clever Algorithms. ISRL, vol. 62, pp. 167\u2013170. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-03404-1_11"},{"issue":"9","key":"36_CR17","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1080\/0305215X.2013.832237","volume":"46","author":"XS Yang","year":"2014","unstructured":"Yang, X.S., Karamanoglu, M., He, X.: Flower pollination algorithm: a novel approach for multiobjective optimization. Eng. Optim. 46(9), 1222\u20131237 (2014)","journal-title":"Eng. Optim."},{"key":"36_CR18","unstructured":"Yue, C., et al.: Problem definitions and evaluation criteria for the CEC 2020 special session and competition on single objective bound constrained numerical optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China, Technical report 201911 (2019)"},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.apm.2018.06.036","volume":"63","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Xiao, M., Gao, L., Pan, Q.: Queuing search algorithm: a novel metaheuristic algorithm for solving engineering optimization problems. Appl. Math. Model. 63, 464\u2013490 (2018)","journal-title":"Appl. Math. Model."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42505-9_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:35:09Z","timestamp":1730075709000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42505-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031425042","9783031425059"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42505-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zakopane","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icaisc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Custom","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"175","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":"84","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":"48% - 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":"2","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":"2","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)"}}]}}