{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:31:35Z","timestamp":1743154295906,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031096761"},{"type":"electronic","value":"9783031096778"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09677-8_10","type":"book-chapter","created":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T18:33:51Z","timestamp":1656182031000},"page":"117-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Hydrologic Cycle Optimization Algorithm for Solving Engineering Optimization Problems"],"prefix":"10.1007","author":[{"given":"Haiyun","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bowen","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianwei","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junrui","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,26]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0010-4485(01)00210-X","volume":"35","author":"LM Zhu","year":"2003","unstructured":"Zhu, L.M., Ding, H., Xiong, Y.L.: A steepest descent algorithm for circularity evaluation. Comput. Aided Des. 35(3), 255\u2013265 (2003)","journal-title":"Comput. Aided Des."},{"issue":"10","key":"10_CR2","doi-asserted-by":"publisher","first-page":"2864","DOI":"10.1109\/TPAS.1984.318284","volume":"103","author":"DI Sun","year":"1984","unstructured":"Sun, D.I., Ashley, B., Brewer, B., Hughes, A., Tinney, W.F.: Optimal power flow by newton approach. IEEE Trans. Power Appar. Syst. 103(10), 2864\u20132880 (1984)","journal-title":"IEEE Trans. Power Appar. Syst."},{"issue":"6","key":"10_CR3","first-page":"613","volume":"36","author":"A Zilinskas","year":"2006","unstructured":"Zilinskas, A.: Practical mathematical optimization: an introduction to basic optimization theory and classical and new gradient-based algorithms. Interfaces 36(6), 613\u2013615 (2006)","journal-title":"Interfaces"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Genetic algorithms. Sci. Am. 267(1), 66\u201372 (1992)","journal-title":"Sci. Am."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the ICNN 1995-International Conference on Neural Networks, vol. 4, pp. 1942\u20131948, Perth, Australia. IEEE (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4","key":"10_CR6","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 - a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"key":"10_CR7","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."},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s00366-019-00729-w","volume":"36","author":"M Sheikhi Azqandi","year":"2019","unstructured":"Sheikhi Azqandi, M., Delavar, M., Arjmand, M.: An enhanced time evolutionary optimization for solving engineering design problems. Eng. Comput. 36(2), 763\u2013781 (2019). https:\/\/doi.org\/10.1007\/s00366-019-00729-w","journal-title":"Eng. Comput."},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Yan, X., Niu, B., Chai, Y., Zhang, Z., Zhang, L.: An adaptive hydrologic cycle optimization algorithm for numerical optimization and data clustering. Int. J. Intell. Syst. 1\u201329 (2022). https:\/\/doi.org\/10.1002\/int.22836","DOI":"10.1002\/int.22836"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"102497","DOI":"10.1109\/ACCESS.2021.3096726","volume":"9","author":"M Azizi","year":"2021","unstructured":"Azizi, M., Talatahari, S., Giaralis, A.: Optimization of engineering design problems using atomic orbital search algorithm. IEEE Access 9, 102497\u2013102519 (2021)","journal-title":"IEEE Access"},{"key":"10_CR12","unstructured":"Shi, Y., Eberhart, R.C.: Empirical study of particle swarm optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC 1999, pp. 1945\u20131950 (1999)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.compstruc.2012.07.010","volume":"110","author":"H Eskandar","year":"2012","unstructured":"Eskandar, H., Sadollah, A., Bahreininejad, A., Hamdi, M.: Water cycle algorithm - a novel metaheuristic optimization method for solving constrained engineering optimization problems. Comput. Struct. 110, 151\u2013166 (2012)","journal-title":"Comput. Struct."}],"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-031-09677-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T20:28:15Z","timestamp":1727468895000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09677-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031096761","9783031096778"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09677-8_10","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":"26 June 2022","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":"Xi'an","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2022\/","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":"171","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":"85","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":"50% - 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.6","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-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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}