{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T13:22:12Z","timestamp":1778592132631,"version":"3.51.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031138317","type":"print"},{"value":"9783031138324","type":"electronic"}],"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-13832-4_69","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T11:32:22Z","timestamp":1660563142000},"page":"860-875","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Complex-Valued Crow Search Algorithm for 0\u20131 KP Problem"],"prefix":"10.1007","author":[{"given":"Yan","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongquan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qifang","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huajuan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,16]]},"reference":[{"key":"69_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.compstruc.2016.03.001","volume":"169","author":"A Askarzadeh","year":"2016","unstructured":"Askarzadeh, A.: A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput. Struct. 169, 1\u201312 (2016)","journal-title":"Comput. Struct."},{"key":"69_CR2","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.procs.2020.03.420","volume":"167","author":"S Laabadi","year":"2020","unstructured":"Laabadi, S., Naimi, M., El Amri, H., Achchab, B.: A binary crow search algorithm for solving two-dimensional bin packing problem with fixed orientation. Procedia Comput. Sci. 167, 809\u2013818 (2020)","journal-title":"Procedia Comput. Sci."},{"issue":"1","key":"69_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00521-017-2988-6","volume":"31","author":"GI Sayed","year":"2017","unstructured":"Sayed, G.I., Hassanien, A.E., Azar, A.T.: Feature selection via a novel chaotic crow search algorithm. Neural Comput. Appl. 31(1), 171\u2013188 (2017). https:\/\/doi.org\/10.1007\/s00521-017-2988-6","journal-title":"Neural Comput. Appl."},{"key":"69_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-30271-9_1","volume-title":"ARIAM 2019","author":"RM Sahoo","year":"2020","unstructured":"Sahoo, R.M., Padhy, S.K.: Improved crow search optimization for multiprocessor task scheduling: a novel approach. In: Nayak, J., Balas, V.E., Favorskaya, M.N., Choudhury, B.B., Rao, S., Naik, B. (eds.) ARIAM 2019, pp. 1\u201313. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-30271-9_1"},{"key":"69_CR5","doi-asserted-by":"crossref","unstructured":"dos Santos Coelho, L., Klein, C.E., Mariani, V.C., do Nascimento, C.A.R., Askarzadeh, A.: Electromagnetic optimization based on Gaussian crow search approach. In: 2018 International Symposium on Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM), pp 1107\u20131112. IEEE (2018)","DOI":"10.1109\/SPEEDAM.2018.8445209"},{"key":"69_CR6","first-page":"157","volume":"44","author":"J Mandala","year":"2019","unstructured":"Mandala, J., Rao, M.C.S.: Privacy preservation of data using crow search with adaptive awareness probability. J. Inf. Secur. Appl. 44, 157\u2013169 (2019)","journal-title":"J. Inf. Secur. Appl."},{"key":"69_CR7","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-030-40977-7_18","volume-title":"Applications of Hybrid Metaheuristic Algorithms for Image Processing","author":"A Lenin Fred","year":"2020","unstructured":"Lenin Fred, A., Kumar, S.N., Padmanaban, P., Gulyas, B., Ajay Kumar, H.: Fuzzy-crow search optimization for medical image segmentation. In: Oliva, D., Hinojosa, S. (eds.) Applications of Hybrid Metaheuristic Algorithms for Image Processing. SCI, vol. 890, pp. 413\u2013439. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40977-7_18"},{"key":"69_CR8","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.isatra.2019.09.004","volume":"99","author":"S Shekhawat","year":"2019","unstructured":"Shekhawat, S., Saxena, A.: Development and applications of an intelligent crow search algorithm based on opposition based learning. ISA Trans. 99, 210\u2013230 (2019)","journal-title":"ISA Trans."},{"issue":"17","key":"69_CR9","doi-asserted-by":"publisher","first-page":"13715","DOI":"10.1007\/s00521-020-04779-w","volume":"32","author":"RM Rizk-Allah","year":"2020","unstructured":"Rizk-Allah, R.M., Hassanien, A.E., Slowik, A.: Multi-objective orthogonal opposition-based crow search algorithm for large-scale multi-objective optimization. Neural Comput. Appl. 32(17), 13715\u201313746 (2020). https:\/\/doi.org\/10.1007\/s00521-020-04779-w","journal-title":"Neural Comput. Appl."},{"key":"69_CR10","doi-asserted-by":"publisher","unstructured":"Rao, Y., He, D., Qu, L.: A probabilistic simplified sine cosine crow search algorithm for global optimization problems. Eng. Comput., 1\u201319 (2022). https:\/\/doi.org\/10.1007\/s00366-021-01578-2","DOI":"10.1007\/s00366-021-01578-2"},{"key":"69_CR11","doi-asserted-by":"publisher","first-page":"2780","DOI":"10.1109\/ACCESS.2020.2968462","volume":"8","author":"HM Farh","year":"2020","unstructured":"Farh, H.M., Al-Shaalan, A.M., Eltamaly, A.M., Al-Shammaa, A.A.: A novel crow search algorithm autodrive PSO for optimal allocation and sizing of renewable distributed generation. IEEE Access 8, 2780\u201327820 (2020)","journal-title":"IEEE Access"},{"key":"69_CR12","doi-asserted-by":"publisher","first-page":"115579","DOI":"10.1016\/j.eswa.2021.115579","volume":"184","author":"LL Li","year":"2021","unstructured":"Li, L.L., Liu, Z.F., Tseng, M.L., et al.: Using enhanced crow search algorithm optimization-extreme learning machine model to forecast short-term wind power. Expert Syst. Appl. 184, 115579 (2021)","journal-title":"Expert Syst. Appl."},{"key":"69_CR13","doi-asserted-by":"publisher","unstructured":"Necira, A., Naimi, D., Salhi, A., Salhi, S., Menani, S.: Dynamic crow search algorithm based on adaptive parameters for large-scale global optimization. Evol. Intell., 1\u201317 (2021). https:\/\/doi.org\/10.1007\/s12065-021-00628-4","DOI":"10.1007\/s12065-021-00628-4"},{"issue":"2","key":"69_CR14","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11063-015-9465-y","volume":"44","author":"Y Zhou","year":"2015","unstructured":"Zhou, Y., Li, L., Ma, M.: A complex-valued encoding bat algorithm for solving 0\u20131 knapsack problem. Neural Process. Lett. 44(2), 407\u2013430 (2015). https:\/\/doi.org\/10.1007\/s11063-015-9465-y","journal-title":"Neural Process. Lett."},{"key":"69_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cie.2019.04.025","volume":"132","author":"M Abdel-Basset","year":"2019","unstructured":"Abdel-Basset, M., El-Shahat, D., Faris, H., Mirjalili, S.: A binary multi-verse optimizer for 0\u20131 multidimensional knapsack problems with application in interactive multimedia systems. Comput. Ind. Eng. 132, 187\u2013206 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"69_CR16","doi-asserted-by":"publisher","first-page":"2771","DOI":"10.1007\/s00366-020-01240-3","volume":"38","author":"N Moradi","year":"2021","unstructured":"Moradi, N., Kayvanfar, V., Rafiee, M.: An efficient population-based simulated annealing algorithm for 0\u20131 knapsack problem. Eng. Comput. 38, 2771\u20132790 (2021). https:\/\/doi.org\/10.1007\/s00366-020-01240-3","journal-title":"Eng. Comput."},{"key":"69_CR17","doi-asserted-by":"publisher","unstructured":"Abdollahzadeh, B., Barshandeh, S., Javadi, H., Epicoco, N.: An enhanced binary slime mould algorithm for solving the 0\u20131 knapsack problem. Eng. Comput., 1\u201322 (2021). https:\/\/doi.org\/10.1007\/s00366-021-01470-z","DOI":"10.1007\/s00366-021-01470-z"},{"issue":"7","key":"69_CR18","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1007\/s00521-015-2135-1","volume":"28","author":"Y Feng","year":"2015","unstructured":"Feng, Y., Wang, G.-G., Deb, S., Lu, M., Zhao, X.-J.: Solving 0\u20131 knapsack problem by a novel binary monarch butterfly optimization. Neural Comput. Appl. 28(7), 1619\u20131634 (2015). https:\/\/doi.org\/10.1007\/s00521-015-2135-1","journal-title":"Neural Comput. Appl."},{"issue":"1","key":"69_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s40747-017-0050-z","volume":"4","author":"RM Rizk-Allah","year":"2017","unstructured":"Rizk-Allah, R.M., Hassanien, A.E.: New binary bat algorithm for solving 0\u20131 knapsack problem. Complex Intell. Syst. 4(1), 31\u201353 (2017). https:\/\/doi.org\/10.1007\/s40747-017-0050-z","journal-title":"Complex Intell. Syst."},{"key":"69_CR20","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1007\/s10489-017-1025-x","volume":"48","author":"J Cao","year":"2018","unstructured":"Cao, J., Yin, B., Lu, X., Kang, Y., Chen, X.: A modified artificial bee colony approach for the 0\u20131 knapsack problem. Appl. Intell. 48, 1582\u20131595 (2018)","journal-title":"Appl. Intell."},{"key":"69_CR21","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/s10489-016-0855-2","volume":"46","author":"Y Zhou","year":"2017","unstructured":"Zhou, Y., Bao, Z., Luo, Q., Zhang, S.: A complex-valued encoding wind driven optimization for the 0\u20131 knapsack problem. Appl. Intell. 46, 684\u2013702 (2017)","journal-title":"Appl. Intell."},{"key":"69_CR22","doi-asserted-by":"crossref","unstructured":"Moradi, N., Kayvanfar, V., Rafiee, M.: An efficient population\u2011based simulated annealing algorithm for 0\u20131 knapsack problem (2021)","DOI":"10.1007\/s00366-020-01240-3"},{"key":"69_CR23","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Perth, Australia, pp. 1942\u20131948. IEEE (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"69_CR24","series-title":"SCI","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","volume-title":"NICSO 2010","author":"X-S Yang","year":"2010","unstructured":"Yang, X.-S.: A new metaheuristic bat-inspired algorithm. In: Gonz\u00e1lez, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) NICSO 2010. SCI, vol. 284, pp. 65\u201374. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12538-6_6"},{"issue":"3","key":"69_CR25","volume":"151","author":"M Abdel-Basset","year":"2020","unstructured":"Abdel-Basset, M., Mohamed, R., Mirjalili, S.: A binary equilibrium optimization algorithm for 0\u20131 knapsack problems. Comput. Ind. Eng. 151(3), 106946 (2020)","journal-title":"Comput. Ind. Eng."},{"key":"69_CR26","doi-asserted-by":"publisher","first-page":"43979","DOI":"10.1109\/ACCESS.2019.2908489","volume":"7","author":"AE Ezugwu","year":"2019","unstructured":"Ezugwu, A.E., et al.: A Comparative study of meta-heuristic optimization algorithms for 0\u20131 knapsack problem: some initial results. IEEE Access 7, 43979\u201344001 (2019)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Methodologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13832-4_69","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T19:19:02Z","timestamp":1727810342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13832-4_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031138317","9783031138324"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13832-4_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","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":"7 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2022\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"IC-ICC-CN","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"449","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":"209","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":"47% - 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.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)"}}]}}