{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:44:04Z","timestamp":1777704244115,"version":"3.51.4"},"reference-count":82,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2017,12]]},"abstract":"<jats:p>The flower pollination algorithm (FPA) is a recently developed meta-heuristic algorithm inspired by the pollination process of flowers. Similar to other meta-heuristic algorithms, it encounters two probable problems, i.e., entrapment in local optima and slow convergence speed, in solving challenging complex real world problems. Similar to the chaos in actual flower pollination process, this paper proposes new FPAs that employ chaotic maps for adjustment of parameters with the aim to improve the convergence rate and prevent the FPAs to get trapped on local optima. This is achieved by employing chaotic number generators every time, a random number is needed by the classical FPA. Two new chaotic FPAs have been proposed and various test problems are used for their performance evaluation. To check the effectiveness of the proposed algorithms, they are tested on various benchmark functions and engineering design problems with different characteristics having real world applications. The simulation results demonstrate that the chaotic maps are able to significantly boost the performance of FPAs.<\/jats:p>","DOI":"10.3233\/jifs-17708","type":"journal-article","created":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T12:39:23Z","timestamp":1512131963000},"page":"3853-3869","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":14,"title":["Chaos-enhanced flower pollination algorithms for global optimization"],"prefix":"10.1177","volume":"33","author":[{"given":"Sankalap","family":"Arora","sequence":"first","affiliation":[{"name":"DAV University, Punjab, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Priyanka","family":"Anand","sequence":"additional","affiliation":[{"name":"Lovely Professional University, Punjab, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2017,12]]},"reference":[{"key":"e_1_3_1_2_2","volume-title":"Meta-heuristics optimization algorithms in engineering, business, economics, and finance","author":"Vasant P.M.","year":"2012","unstructured":"VasantP.M., Meta-heuristics optimization algorithms in engineering, business, economics, and finance. IGI Global, 2012."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-4666-7258-1"},{"key":"e_1_3_1_4_2","volume-title":"Handbook of research on novel soft computing intelligent algorithms: Theory and practical applications","author":"Vasant P.","year":"2013","unstructured":"VasantP., Handbook of research on novel soft computing intelligent algorithms: Theory and practical applications, IGI Global, 2013."},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-4666-9755-3"},{"key":"e_1_3_1_6_2","volume-title":"Innovation in Power, Control, and Optimization: Emerging Energy Technologies: Emerging Energy Technologies","author":"Vasant P.","year":"2011","unstructured":"VasantP., Innovation in Power, Control, and Optimization: Emerging Energy Technologies: Emerging Energy Technologies, IGI Global, 2011."},{"key":"e_1_3_1_7_2","volume-title":"Handbook of Research on Holistic Optimization Techniques in the Hospitality, Tourism, and Travel Industry","author":"Vasant P.","year":"2016","unstructured":"VasantP., Handbook of Research on Holistic Optimization Techniques in the Hospitality, Tourism, and Travel Industry, IGI Global, 2016."},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.10.010"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-335-6.50043-X"},{"key":"e_1_3_1_10_2","unstructured":"AartsE. and KorstJ. Simulated annealing and boltzmann machines 1988."},{"key":"e_1_3_1_11_2","volume-title":"Handbook of Research on Emergent Applications of Optimization Algorithms","author":"Vasant P.","year":"2016","unstructured":"VasantP., Handbook of Research on Emergent Applications of Optimization Algorithms, IGI Global, 2016."},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-4666-9644-0"},{"key":"e_1_3_1_13_2","volume-title":"Metaheuristics in water, geotechnical and transport engineering","author":"Yang X.-S.","year":"2012","unstructured":"YangX.-S., GandomiA.H., TalatahariS. and AlaviA.H., Metaheuristics in water, geotechnical and transport engineering, Newnes, 2012."},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/MHS.1995.494215"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022602019183"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/PDGC.2014.7030711"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.5120\/11826-7528"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.03.004"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1177\/003754970107600201"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2015.1120299"},{"key":"e_1_3_1_22_2","first-page":"2015","volume-title":"Signal Processing, Computing and Control (2015 ISPCC), 2015 International Conference on","author":"Arora S.","unstructured":"AroraS. and SinghS., Butterfly algorithm with l\u2019evy flights for global optimization, in Signal Processing, Computing and Control (2015 ISPCC), 2015 International Conference on, IEEE2015."},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2012.07.010"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.12.030"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32894-7_27"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2006.873410"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.5402\/2011\/897498"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-2977-8"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.09.031"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/HIS.2013.6920491"},{"key":"e_1_3_1_31_2","volume-title":"Bioinspired computation in combinatorial optimization: Algorithms and their computational complexity","author":"Neumann F.","year":"2013","unstructured":"NeumannF. and WittC., Bioinspired computation in combinatorial optimization: Algorithms and their computational complexity, in Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation, ACM2013, pp. 567\u2013590."},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.08.009"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688362"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.11.051"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.64.821"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2006.04.057"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2012.06.009"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2012.07.017"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2007.08.040"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-16798"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.06.033"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.04.039"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.02.042"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2011.08.021"},{"key":"e_1_3_1_45_2","doi-asserted-by":"crossref","unstructured":"KohliM. and AroraS. Chaotic grey wolf optimization algorithm for constrained optimization problems Journal of Computational Design and Engineering (2017). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S2288430016301142","DOI":"10.1016\/j.jcde.2017.02.005"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.5815\/ijeme.2014.02.01"},{"issue":"3","key":"e_1_3_1_47_2","article-title":"An improved chaotic flower pollination algorithm for solving large integer programming problems","volume":"8","author":"El-henawy I.","year":"2014","unstructured":"El-henawyI. and IsmailM., An improved chaotic flower pollination algorithm for solving large integer programming problems, International Journal of Digital Content Technology & its Applications8(3) (2014).","journal-title":"International Journal of Digital Content Technology & its Applications"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.02.002"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/924652"},{"issue":"7","key":"e_1_3_1_50_2","first-page":"900","article-title":"Chaotic characteristics of a one-dimensional iterative map with infinite collapses","volume":"48","author":"He D.","year":"2001","unstructured":"HeD., HeC., JiangL.-G., ZhuH.-W. and HuG.-R., Chaotic characteristics of a one-dimensional iterative map with infinite collapses, Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on48(7) (2001), 900\u2013906.","journal-title":"Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.09.087"},{"key":"e_1_3_1_52_2","unstructured":"DoriaV.L.A. Dna computing based on chaos 1997."},{"key":"e_1_3_1_53_2","unstructured":"SuneelM. Chaotic sequences for secure cdma arXiv preprint nlin\/0602018 2006."},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00034-005-2408-5"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127400000785"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.07.030"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.9781\/ijimai.2017.442"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620210904"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-0346(02)00011-3"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-014-1640-y"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2006.03.003"},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","DOI":"10.1080\/03081070701303470"},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-3615(99)00046-9"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.11.033"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.07.105"},{"key":"e_1_3_1_68_2","volume-title":"Introduction to optimum design 2004","author":"Arora J.S.","unstructured":"AroraJ.S., Introduction to optimum design 2004, Elsevier Academic Press."},{"issue":"3","key":"e_1_3_1_69_2","first-page":"1021","article-title":"Optimal design of a class of welded structures using geometric programming","volume":"98","author":"Ragsdell K.","year":"1976","unstructured":"RagsdellK. and PhillipsD., Optimal design of a class of welded structures using geometric programming, Journal of Manufacturing Science and Engineering98(3) (1976), 1021\u20131025.","journal-title":"Journal of Manufacturing Science and Engineering"},{"key":"e_1_3_1_70_2","doi-asserted-by":"publisher","DOI":"10.1115\/1.2912596"},{"key":"e_1_3_1_71_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2004.09.007"},{"key":"e_1_3_1_72_2","doi-asserted-by":"publisher","DOI":"10.1080\/02630250008970288"},{"key":"e_1_3_1_73_2","doi-asserted-by":"publisher","DOI":"10.2514\/3.10834"},{"key":"e_1_3_1_74_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(99)00389-8"},{"key":"e_1_3_1_75_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-011-0241-y"},{"key":"e_1_3_1_76_2","doi-asserted-by":"publisher","DOI":"10.1007\/11539902_71"},{"key":"e_1_3_1_77_2","doi-asserted-by":"publisher","DOI":"10.1115\/1.2912786"},{"key":"e_1_3_1_78_2","first-page":"30","article-title":"A combined genetic adaptive search (geneas) for engineering design","volume":"26","author":"Deb K.","year":"1996","unstructured":"DebK. and GoyalM., A combined genetic adaptive search (geneas) for engineering design, Computer Science and Informatics26 (1996), 30\u201345.","journal-title":"Computer Science and Informatics"},{"key":"e_1_3_1_79_2","volume-title":"Mechanical design optimization by mixedvariable evolutionary programming","author":"Cao Y.","year":"1997","unstructured":"CaoY. and WuQ., Mechanical design optimization by mixedvariable evolutionary programming, in IEEE Conference on Evolutionary Computation IEEE Press, 1997, pp. 443\u20136."},{"key":"e_1_3_1_80_2","doi-asserted-by":"publisher","DOI":"10.1080\/03052159308940980"},{"key":"e_1_3_1_81_2","doi-asserted-by":"publisher","DOI":"10.1080\/03052159108941075"},{"key":"e_1_3_1_82_2","doi-asserted-by":"publisher","DOI":"10.1080\/03052159508941187"},{"key":"e_1_3_1_83_2","doi-asserted-by":"publisher","DOI":"10.1115\/1.2919393"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-17708","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-17708","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-17708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:40:46Z","timestamp":1777455646000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-17708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":82,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["10.3233\/JIFS-17708"],"URL":"https:\/\/doi.org\/10.3233\/jifs-17708","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12]]}}}