{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:26:24Z","timestamp":1743153984741,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031154706"},{"type":"electronic","value":"9783031154713"}],"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-15471-3_42","type":"book-chapter","created":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T09:04:42Z","timestamp":1662887082000},"page":"494-504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Comparison of\u00a0Meta-heuristic Based Optimization Methods Using Standard Benchmarks"],"prefix":"10.1007","author":[{"given":"Enol","family":"Garc\u00eda","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 R.","family":"Villar","sequence":"additional","affiliation":[]},{"given":"Camelia","family":"Chira","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Sedano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,12]]},"reference":[{"issue":"1","key":"42_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02936173","volume":"16","author":"ZN Azimi","year":"2004","unstructured":"Azimi, Z.N.: Comparison of metaheuristic algorithms for examination timetabling problem. J. Appl. Math. Comput. 16(1), 337 (2004). https:\/\/doi.org\/10.1007\/BF02936173","journal-title":"J. Appl. Math. Comput."},{"issue":"5","key":"42_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.compstruc.2009.10.007","volume":"88","author":"MW Bloomfield","year":"2010","unstructured":"Bloomfield, M.W., Herencia, J.E., Weaver, P.M.: Analysis and benchmarking of meta-heuristic techniques for lay-up optimization. Comput. Struct. 88(5), 272\u2013282 (2010). https:\/\/doi.org\/10.1016\/j.compstruc.2009.10.007","journal-title":"Comput. Struct."},{"key":"42_CR3","doi-asserted-by":"publisher","unstructured":"Dorigo, M., Di Caro, G.: Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol. 2, pp. 1470\u20131477 (1999). https:\/\/doi.org\/10.1109\/CEC.1999.782657","DOI":"10.1109\/CEC.1999.782657"},{"key":"42_CR4","doi-asserted-by":"publisher","unstructured":"Fadakar, E., Ebrahimi, M.: A new metaheuristic football game inspired algorithm. In: 2016 1st Conference on Swarm Intelligence and Evolutionary Computation (CSIEC), pp. 6\u201311 (2016). https:\/\/doi.org\/10.1109\/CSIEC.2016.7482120","DOI":"10.1109\/CSIEC.2016.7482120"},{"issue":"2","key":"42_CR5","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60\u201368 (2001). https:\/\/doi.org\/10.1177\/003754970107600201","journal-title":"Simulation"},{"issue":"2","key":"42_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968). https:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou, A.: Black hole: a new heuristic optimization approach for data clustering. Inf. Sci. 222, 175\u2013184 (2013). https:\/\/doi.org\/10.1016\/j.ins.2012.08.023. Including Special Section on New Trends in Ambient Intelligence and Bio-inspired Systems","journal-title":"Inf. Sci."},{"issue":"21","key":"42_CR8","doi-asserted-by":"publisher","first-page":"5663","DOI":"10.1016\/j.ces.2005.05.028","volume":"60","author":"R Irizarry","year":"2005","unstructured":"Irizarry, R.: A generalized framework for solving dynamic optimization problems using the artificial chemical process paradigm: applications to particulate processes and discrete dynamic systems. Chem. Eng. Sci. 60(21), 5663\u20135681 (2005). https:\/\/doi.org\/10.1016\/j.ces.2005.05.028","journal-title":"Chem. Eng. Sci."},{"issue":"4598","key":"42_CR9","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.advengsoft.2015.01.010","volume":"83","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili, S.: The ant lion optimizer. Adv. Eng. Softw. 83, 80\u201398 (2015). https:\/\/doi.org\/10.1016\/j.advengsoft.2015.01.010","journal-title":"Adv. Eng. Softw."},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili, S.: Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl.-Based Syst. 89, 228\u2013249 (2015). https:\/\/doi.org\/10.1016\/j.knosys.2015.07.006","journal-title":"Knowl.-Based Syst."},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S.: SCA: a sine cosine algorithm for solving optimization problems. Knowl.-Based Syst. 96, 120\u2013133 (2016). https:\/\/doi.org\/10.1016\/j.knosys.2015.12.022","journal-title":"Knowl.-Based Syst."},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51\u201367 (2016). https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.008","journal-title":"Adv. Eng. Softw."},{"key":"42_CR14","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). https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007","journal-title":"Adv. Eng. Softw."},{"issue":"3","key":"42_CR15","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/s10489-017-0903-6","volume":"47","author":"SJ Mousavirad","year":"2017","unstructured":"Mousavirad, S.J., Ebrahimpour-Komleh, H.: Human mental search: a new population-based metaheuristic optimization algorithm. Appl. Intell. 47(3), 850\u2013887 (2017). https:\/\/doi.org\/10.1007\/s10489-017-0903-6","journal-title":"Appl. Intell."},{"issue":"3","key":"42_CR16","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00500-011-0754-8","volume":"16","author":"JA Parejo","year":"2012","unstructured":"Parejo, J.A., Ruiz-Cort\u00e9s, A., Lozano, S., Fernandez, P.: Metaheuristic optimization frameworks: a survey and benchmarking. Soft. Comput. 16(3), 527\u2013561 (2012). https:\/\/doi.org\/10.1007\/s00500-011-0754-8","journal-title":"Soft. Comput."},{"issue":"10","key":"42_CR17","doi-asserted-by":"publisher","first-page":"5265","DOI":"10.1007\/s13369-018-3080-y","volume":"43","author":"M Sonmez","year":"2018","unstructured":"Sonmez, M.: Performance comparison of metaheuristic algorithms for the optimal design of space trusses. Arab. J. Sci. Eng. 43(10), 5265\u20135281 (2018). https:\/\/doi.org\/10.1007\/s13369-018-3080-y","journal-title":"Arab. J. Sci. Eng."},{"issue":"7","key":"42_CR18","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1016\/S0031-3203(98)00152-6","volume":"32","author":"ML Williams","year":"1999","unstructured":"Williams, M.L., Wilson, R.C., Hancock, E.R.: Deterministic search for relational graph matching. Pattern Recogn. 32(7), 1255\u20131271 (1999). https:\/\/doi.org\/10.1016\/S0031-3203(98)00152-6","journal-title":"Pattern Recogn."},{"key":"42_CR19","unstructured":"Wu, G., Mallipeddi, R., Suganthan, P.: Problem definitions and evaluation criteria for the CEC 2017 competition and special session on constrained single objective real-parameter optimization. Technical report, IEEE Congress on Evolutionary Computation (2016)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15471-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T09:09:03Z","timestamp":1662887343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15471-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031154706","9783031154713"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15471-3_42","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":"12 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Hybrid Artificial Intelligence Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Salamancaa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"5 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hais2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2022.haisconference.eu\/","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":"67","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":"43","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":"64% - 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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}