{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:24:59Z","timestamp":1743125099204,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030267629"},{"type":"electronic","value":"9783030267636"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26763-6_71","type":"book-chapter","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T23:18:04Z","timestamp":1564442284000},"page":"739-748","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["BFPA: Butterfly Strategy Flower Pollination Algorithm"],"prefix":"10.1007","author":[{"given":"Mengyi","family":"Lei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qifang","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongquan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengmei","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanyuan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"71_CR1","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, vol. IV, pp. 1942\u20131948 (1995)"},{"issue":"4","key":"71_CR2","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M Srinivas","year":"1994","unstructured":"Srinivas, M., Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. Syst. Man Cybern. 24(4), 656\u2013667 (1994)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"71_CR3","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1016\/j.ejor.2006.06.046","volume":"185","author":"K Socha","year":"2008","unstructured":"Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. Eur. J. Oper. Res. 185(3), 1155\u20131173 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"71_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-32894-7_27","volume-title":"Unconventional Computation and Natural Computation","author":"X-S Yang","year":"2012","unstructured":"Yang, X.-S.: Flower pollination algorithm for global optimization. In: Durand-Lose, J., Jonoska, N. (eds.) UCNC 2012. LNCS, vol. 7445, pp. 240\u2013249. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32894-7_27"},{"issue":"3","key":"71_CR5","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s00500-018-3102-4","volume":"23","author":"A Sankalap","year":"2018","unstructured":"Sankalap, A., Satvir, S.: Butterfly optimization algorithm: a novel approach for global optimization. Soft Comput. 23(3), 715\u2013734 (2018). https:\/\/doi.org\/10.1007\/s00500-018-3102-4","journal-title":"Soft Comput."},{"issue":"1","key":"71_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5430\/ijrc.v1n1p1","volume":"1","author":"X Jiang","year":"2018","unstructured":"Jiang, X., Li, S.: BAS: beetle antennae search algorithm for optimization problems. Int. J. Robot. Control 1(1), 1\u20135 (2018)","journal-title":"Int. J. Robot. Control"},{"key":"71_CR7","doi-asserted-by":"publisher","unstructured":"Lu, K., Li, H.: Quantum-behaved flower pollination algorithm. In: 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (2015). https:\/\/doi.org\/10.1109\/dcabes.2015.24","DOI":"10.1109\/dcabes.2015.24"},{"key":"71_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/j.enconman.2016.12.082","volume":"135","author":"JP Ram","year":"2017","unstructured":"Ram, J.P., Babu, T.S., Dragicevic, T., Rajasekar, N.: A new hybrid bee pollinator flower pollination algorithm for solar PV parameter estimation. Energy Convers. Manag. 135, 463\u2013476 (2017)","journal-title":"Energy Convers. Manag."},{"key":"71_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.patrec.2016.03.014","volume":"77","author":"SAF Sayed","year":"2016","unstructured":"Sayed, S.A.F., Nabil, E., Badr, A.: A binary clonal flower pollination algorithm for feature selection. Pattern Recogn. Lett. 77, 21\u201327 (2016)","journal-title":"Pattern Recogn. Lett."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26763-6_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T13:20:43Z","timestamp":1617283243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26763-6_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030267629","9783030267636"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26763-6_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","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":"Nanchang","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2019\/index.htm","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":"ICIC Website","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"609","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":"217","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":"36% - 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.43","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}