{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:06:41Z","timestamp":1760710001907,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811501203"},{"type":"electronic","value":"9789811501210"}],"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-981-15-0121-0_34","type":"book-chapter","created":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T23:03:21Z","timestamp":1568329401000},"page":"433-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive Flower Pollination Algorithm Based on Chaotic Map"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9748-6024","authenticated-orcid":false,"given":"Yu","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-ran","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,13]]},"reference":[{"key":"34_CR1","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"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Yang, X.S., Deb, S.: Cuckoo search via L\u00e9vy flights. In: 2009 World Congress on Nature & Biologically Inspired Computing(NaBIC), pp. 210\u2013214. IEEE, Coimbatore (2010)","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"34_CR3","first-page":"65","volume":"284","author":"XS Yang","year":"2010","unstructured":"Yang, X.S.: A new metaheuristic bat-inspired algorithm. Comput. Knowl. Technol. 284, 65\u201374 (2010)","journal-title":"Comput. Knowl. Technol."},{"issue":"1","key":"34_CR4","first-page":"317","volume":"15","author":"Y Li","year":"2019","unstructured":"Li, Y., Guo, Q., Liu, J.: Improved bat algorithm for vehicle routing problem. Int. J. Perform. Eng. 15(1), 317\u2013325 (2019)","journal-title":"Int. J. Perform. Eng."},{"issue":"1","key":"34_CR5","first-page":"861","volume":"18","author":"XS Yang","year":"2013","unstructured":"Yang, X.S., Karamanoglu, M., He, X.: Multi-objective flower algorithm for optimization. Int. Conf. Comput. Sci. 18(1), 861\u2013868 (2013)","journal-title":"Int. Conf. Comput. Sci."},{"issue":"7","key":"34_CR6","doi-asserted-by":"publisher","first-page":"2305","DOI":"10.1007\/s00521-016-2823-5","volume":"30","author":"HTT Binh","year":"2018","unstructured":"Binh, H.T.T., Hanh, N.T., Van Quan, L., Dey, N.: Improved Cuckoo search and chaotic flower pollination optimization algorithm for maximizing area coverage in Wireless Sensor Networks. Neural Comput. Appl. 30(7), 2305\u20132317 (2018)","journal-title":"Neural Comput. Appl."},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1016\/j.energy.2018.01.077","volume":"147","author":"R Peesapati","year":"2018","unstructured":"Peesapati, R., Yadav, V.K., Kumar, N.: Flower pollination algorithm based multi-objective congestion management considering optimal capacities of distributed generations. Energy 147, 980\u2013994 (2018)","journal-title":"Energy"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.patrec.2016.03.014","volume":"77","author":"AEF Sayed","year":"2016","unstructured":"Sayed, A.E.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."},{"issue":"6","key":"34_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00521-016-2524-0","volume":"29","author":"YQ Zhou","year":"2018","unstructured":"Zhou, Y.Q., Zhang, S., Luo, Q.F., Wen, C.M.: Using flower pollination algorithm and atomic potential function for shape matching. Neural Comput. Appl. 29(6), 21\u201340 (2018)","journal-title":"Neural Comput. Appl."},{"issue":"2","key":"34_CR10","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s00521-016-2457-7","volume":"29","author":"U Singh","year":"2018","unstructured":"Singh, U., Salgotra, R.: Synthesis of linear antenna array using flower pollination algorithm. Neural Comput. Appl. 29(2), 435\u2013445 (2018)","journal-title":"Neural Comput. Appl."},{"issue":"8","key":"34_CR11","doi-asserted-by":"publisher","first-page":"2607","DOI":"10.1007\/s00521-017-2890-2","volume":"30","author":"S Xu","year":"2018","unstructured":"Xu, S., Wang, Y., Liu, X.: Parameter estimation for chaotic systems via a hybrid flower pollination algorithm. Neural Comput. Appl. 30(8), 2607\u20132623 (2018)","journal-title":"Neural Comput. Appl."},{"issue":"14","key":"34_CR12","doi-asserted-by":"publisher","first-page":"4676","DOI":"10.1080\/00207543.2017.1402137","volume":"56","author":"W Zhang","year":"2018","unstructured":"Zhang, W., Yang, Y., Shuai, Z., Yu, D., Li, Y.: Correlation-aware manufacturing service composition model using an extended flower pollination algorithm. Int. J. Prod. Res. 56(14), 4676\u20134691 (2018)","journal-title":"Int. J. Prod. Res."},{"key":"34_CR13","doi-asserted-by":"publisher","unstructured":"Abdel-Basset, M., El-Shahat, D., El-Henawy, I.: Solving 0\u20131 knapsack problem by binary flower pollination algorithm. Neural Comput. Appl. 1\u201319 (2018). https:\/\/doi.org\/10.1007\/s00521-018-3375-7","DOI":"10.1007\/s00521-018-3375-7"},{"issue":"10","key":"34_CR14","first-page":"1775","volume":"32","author":"Y Li","year":"2017","unstructured":"Li, Y., Pei, Y., Liu, J.: Bat optimal algorithm combined uniform mutation with Gaussian mutation. Control Decis. 32(10), 1775\u20131781 (2017)","journal-title":"Control Decis."},{"issue":"2","key":"34_CR15","first-page":"1","volume":"4","author":"O Abdel-Raouf","year":"2014","unstructured":"Abdel-Raouf, O., Abdel-Baset, M., El-henawy, I.: A new hybrid flower pollination algorithm for solving constrained global optimization problems. Int. J. Appl. Oper. Res. 4(2), 1\u201313 (2014)","journal-title":"Int. J. Appl. Oper. Res."},{"issue":"8","key":"34_CR16","first-page":"31","volume":"4","author":"K Lenin","year":"2014","unstructured":"Lenin, K., Reddy, B.R., Kalavathi, M.S.: Shrinkage of active power loss by hybridization of flower pollination algorithm with chaotic harmony search algorithm. Control Theory Inform. 4(8), 31\u201338 (2014)","journal-title":"Control Theory Inform."},{"issue":"7","key":"34_CR17","doi-asserted-by":"publisher","first-page":"2269","DOI":"10.1007\/s00521-016-2833-3","volume":"30","author":"R Salgotra","year":"2018","unstructured":"Salgotra, R., Singh, U.: A novel bat flower pollination algorithm for synthesis of linear antenna arrays. Neural Comput. Appl. 30(7), 2269\u20132282 (2018)","journal-title":"Neural Comput. Appl."},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.eswa.2016.03.047","volume":"57","author":"E Nabil","year":"2016","unstructured":"Nabil, E.: A modified flower pollination algorithm for global optimization. Expert Syst. Appl. 57, 192\u2013203 (2016)","journal-title":"Expert Syst. Appl."},{"key":"34_CR19","first-page":"1","volume":"4","author":"R Wang","year":"2014","unstructured":"Wang, R., Zhou, Y.Q.: Flower pollination algorithm with dimension by dimension improvement. Math. Prob. Eng. 4, 1\u20139 (2014)","journal-title":"Math. Prob. Eng."},{"key":"34_CR20","unstructured":"Xiao, H.H., Wan, C.X., Duan, Y.M., Tan, Q.L.: Flower pollination algorithm based on gravity search mechanism. Acta Automatica Sinica 43(04), 576\u2013592+491+493+594 (2017)"},{"key":"34_CR21","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.eswa.2017.02.035","volume":"79","author":"R Salgotra","year":"2017","unstructured":"Salgotra, R., Singh, U.: Application of mutation operators to flower pollination algorithm. Expert Syst. Appl. 79, 112\u2013129 (2017)","journal-title":"Expert Syst. Appl."},{"key":"34_CR22","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.asoc.2015.05.015","volume":"34","author":"A Draa","year":"2015","unstructured":"Draa, A.: On the performances of the flower pollination algorithm \u2013 qualitative and quantitative analyses. Appl. Soft Comput. 34, 349\u2013371 (2015)","journal-title":"Appl. Soft Comput."},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms, 2nd edn. Discrete Applied Mathematics, New York (2004)","DOI":"10.1002\/0471671746"},{"key":"34_CR24","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1049\/iet-ipr.2018.5900","volume":"13","author":"R Li","year":"2018","unstructured":"Li, R., Liu, Q., Liu, L.: Novel image encryption algorithm based on improved logistic map. IET Image Proc. 13, 125\u2013134 (2018)","journal-title":"IET Image Proc."},{"issue":"04","key":"34_CR25","first-page":"720","volume":"37","author":"JL Fan","year":"2009","unstructured":"Fan, J.L., Zhang, X.F.: Piecewise logistic chaotic map and its performance analysis. Acta Electronica Sinica 37(04), 720\u2013725 (2009)","journal-title":"Acta Electronica Sinica"},{"key":"34_CR26","unstructured":"Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the 6th Int Symposium on Micro Machine and Human Science, pp. 39\u201343. IEEE, Piscataway (1995)"},{"key":"34_CR27","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the 1995 IEEE International Conference Neural Networks, vol. 4, no. 8, pp. 1942\u20131948 (2011)"},{"key":"34_CR28","doi-asserted-by":"crossref","unstructured":"Arora, S., Singh, S.: Butterfly algorithm with L\u00e8vy flights for global optimization. In: International Conference on Signal Processing, Computing and Control, pp. 220\u2013224. IEEE, Waknaghat (2015)","DOI":"10.1109\/ISPCC.2015.7375029"}],"container-title":["Communications in Computer and Information Science","Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-0121-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:55:39Z","timestamp":1709823339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-15-0121-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811501203","9789811501210"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-0121-0_34","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPCSEE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of Pioneering Computer Scientists, Engineers and Educators","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guilin","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":"20 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpcsee2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.icpcsee.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}