{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:47:01Z","timestamp":1743083221285,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030787424"},{"type":"electronic","value":"9783030787431"}],"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-78743-1_40","type":"book-chapter","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:07:50Z","timestamp":1625612870000},"page":"441-450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fireworks Harris Hawk Algorithm Based on Dynamic Competition Mechanism for Numerical Optimization"],"prefix":"10.1007","author":[{"given":"Wenyu","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronghua","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.advengsoft.2017.05.014","volume":"114","author":"G Dhiman","year":"2017","unstructured":"Dhiman, G., Kumar, V.: Spotted hyena optimizer: a novel bio-inspired based Metaheuristic technique for engineering applications. Adv. Eng. Softw. 114, 48\u201370 (2017)","journal-title":"Adv. Eng. Softw."},{"key":"40_CR2","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm Intelligence: From Natural to Artificial Systems","author":"E Bonabeau","year":"1999","unstructured":"Bonabeau, E.: Swarm Intelligence: From Natural to Artificial Systems, vol. 1. Oxford University Press, London (1999)"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Guijarro, F., Mart\u00ednez-G\u00f3mez, M., Visbal-Cadavid, D.: A model for sector restructuring through genetic algorithm and inverse DEA. Expert Syst. Appl. 154, Art. no. 113422 (2020)","DOI":"10.1016\/j.eswa.2020.113422"},{"issue":"3","key":"40_CR4","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1016\/j.ejor.2020.02.047","volume":"285","author":"LCR Soares","year":"2020","unstructured":"Soares, L.C.R., Carvalho, M.A.M.: Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints. Eur. J. Oper. Res. 285(3), 955\u2013964 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Yuan, S., Li, T., Wang, B.: A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times. Expert Syst. Appl. 152, Art. no. 113360 (2020)","DOI":"10.1016\/j.eswa.2020.113360"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Ding, H., Wang, Z., Guo, Y.: Multi-objective optimization of fiber laser cutting based on generalized regression neural network and non-dominated sorting genetic algorithm. Infr. Phys. Technol. 108, Art. no. 103337 (2020)","DOI":"10.1016\/j.infrared.2020.103337"},{"issue":"4","key":"40_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"key":"40_CR8","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"Koza, J.R., Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection, vol. 1. MIT Press, Cambridge (1992)"},{"issue":"6","key":"40_CR9","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon, D.: \u2018Biogeography-based optimization.\u2019 IEEE Trans. Evol. Comput. 12(6), 702\u2013713 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"40_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H-G Beyer","year":"2002","unstructured":"Beyer, H.-G., Schwefel, H.-P.: \u2018Evolution strategies\u2014a comprehensive introduction.\u2019 Nat. Comput. 1(1), 3\u201352 (2002)","journal-title":"Nat. Comput."},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Beni, G.: Swarm Intelligence, pp. 1\u201328. Springer, Heidelberg (2019)","DOI":"10.1007\/978-3-642-27737-5_530-5"},{"key":"40_CR12","unstructured":"Dorigo, M., Di Caro, G.: Ant colony optimization: a new metaheuristic. In: Proceedings of The 1999 Congress on Evolutionary Computation, vol. 2, pp. 1470\u20131477. IEEE (1999)"},{"key":"40_CR13","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)","journal-title":"Future Gener. Comput. Syst."},{"key":"40_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/11499305_33","volume-title":"Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. IWINAC 2005","author":"XS Yang","year":"2005","unstructured":"Yang, X.S.: Engineering optimizations via nature-inspired virtual bee algorithms. In: Mira, J., \u00c1lvarez, J.R. (eds.) Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. IWINAC 2005. LNCS, vol. 3562, pp. 317\u2013323. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11499305_33"},{"key":"40_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-13495-1_44","volume-title":"Advances in Swarm Intelligence. ICSI 2010","author":"Y Tan","year":"2010","unstructured":"Tan, Y., Zhu, Y.: Fireworks algorithm for optimization. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) Advances in Swarm Intelligence. ICSI 2010. LNCS, vol. 6145, pp. 355\u2013364. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13495-1_44"},{"key":"40_CR16","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/TEVC.2017.2787042","volume":"22","author":"J Li","year":"2018","unstructured":"Li, J., Tan, Y.: Loser-out tournament-based fireworks algorithm for multimodal function optimization. IEEE Trans. Evol. Comput. 22, 679\u2013691 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"40_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-319-11857-4_55","volume-title":"Advances in Swarm Intelligence. ICSI 2014","author":"X Yang","year":"2014","unstructured":"Yang, X., Tan, Y.: Sample index-based encoding for clustering using evolutionary computation. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds.) Advances in Swarm Intelligence. ICSI 2014. LNCS, vol. 8794, pp. 489\u2013498. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-11857-4_55"},{"issue":"3","key":"40_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.4018\/IJSIR.2015070103","volume":"6","author":"A Rahmani","year":"2015","unstructured":"Rahmani, A., Amine, A., Hamou, R.M., Rahmani, M.E., Bouarara, H.A.: Privacy preserving through fireworks algorithm based model for image perturbation in big data. Int. J. Swarm Intell. Res. (IJSIR) 6(3), 41\u201358 (2015)","journal-title":"Int. J. Swarm Intell. Res. (IJSIR)"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78743-1_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:20:19Z","timestamp":1625613619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78743-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030787424","9783030787431"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78743-1_40","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":"7 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2021\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"177","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":"104","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":"59% - 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,5","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":"4-5","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)"}}]}}