{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:17:36Z","timestamp":1743099456060,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030879853"},{"type":"electronic","value":"9783030879860"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-87986-0_37","type":"book-chapter","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T11:10:30Z","timestamp":1633432230000},"page":"415-423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Harris Hawks Optimisation: Using of an Archive"],"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"}]}],"member":"297","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","unstructured":"Alabool, H., Al-Arabiat, D., Abualigah, L., Heidari, A.A.: Harris hawks optimization: a comprehensive review of recent variants and applications. Neural Comput. Appl. (2021). https:\/\/doi.org\/10.1007\/s00521-021-05720-5","DOI":"10.1007\/s00521-021-05720-5"},{"key":"37_CR2","doi-asserted-by":"publisher","unstructured":"Bujok, P.: Enhanced tree-seed algorithm solving real-world problems, pp. 12\u201316 (2020). https:\/\/doi.org\/10.1109\/ISCMI51676.2020.9311593","DOI":"10.1109\/ISCMI51676.2020.9311593"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"100490","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":"37_CR4","unstructured":"Das, S., Suganthan, P.N.: Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems. Jadavpur University, India and Nanyang Technological University, Singapore, Technical report (2010)"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari, A.A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., Chen, H.: Harris hawks optimization: algorithm and applications. Future Gener. Comput. Syst. 97, 849\u2013872 (2019). https:\/\/doi.org\/10.1016\/j.future.2019.02.028","journal-title":"Future Gener. Comput. Syst."},{"issue":"19","key":"37_CR6","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":"37_CR7","doi-asserted-by":"publisher","unstructured":"Wang, G.G., Deb, S., Coelho, L.D.S.: Elephant herding optimization. In: 2015 3rd International Symposium on Computational and Business Intelligence (ISCBI), pp. 1\u20135 (2015). https:\/\/doi.org\/10.1109\/ISCBI.2015.8","DOI":"10.1109\/ISCBI.2015.8"},{"key":"37_CR8","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. Univ Laguna; Carnary Govt; Spanish Govt (2010). International Workshop on Nature Inspired Cooperative Strategies for Optimization NICSO 2008, Tenerife, Spain, 2008","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"37_CR9","volume-title":"Nature-Inspired Optimization Algorithms","author":"XS Yang","year":"2014","unstructured":"Yang, X.S.: Nature-Inspired Optimization Algorithms. Elsevier, Amsterdam (2014)"}],"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-030-87986-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T12:08:39Z","timestamp":1633435719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87986-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030879853","9783030879860"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87986-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 October 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icaisc2021.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":"Own Online System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"195","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":"89","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":"46% - 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)"}}]}}