{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:19:02Z","timestamp":1753885142010,"version":"3.41.2"},"reference-count":33,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comp. Intel. Appl."],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:p> This paper presents a modified metaheuristic algorithm named the modified Firefly algorithm. Any metaheuristic algorithm will have exploration and exploitation steps, and the goal of modification is to maintain a balance between them. The improvement relies on movement equations, alterations to the algorithm\u2019s structure by introducing a single loop, and a selection of movement equations at random. Two movement equations are included in the improved method and are randomly selected. This guarantees both regionally and globally focused solution-finding. This prevents the algorithm from getting stuck at a local minimum. Comparing the modified version to the original Firefly method, just one for loop is used, reducing the algorithm\u2019s complexity. The algorithm\u2019s performance is evaluated with 35 traditional benchmark test functions and 10 CEC2019 test functions. According to the findings, the suggested method performed optimally in 24 traditional benchmark test functions and best in the six remaining benchmark test functions. The improved algorithm produced the best outcomes in seven of the 10 CEC2019 test functions. In contrast, the Firefly algorithm produced optimal results in 18 classical benchmark test functions and the best results in 6 CEC2019 test functions. The proposed algorithm is compared with other variants of the Firefly algorithm for common test functions in the literature. The results show that the proposed algorithm outperforms other variants in most test functions. <\/jats:p>","DOI":"10.1142\/s1469026824500123","type":"journal-article","created":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T08:54:45Z","timestamp":1713430485000},"source":"Crossref","is-referenced-by-count":0,"title":["A Modified Firefly Algorithm for Solving Optimization Problems"],"prefix":"10.1142","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2378-7745","authenticated-orcid":false,"given":"Kaylash","family":"Chaudhary","sequence":"first","affiliation":[{"name":"The University of the South Pacific, Suva, Fiji"}]}],"member":"219","published-online":{"date-parts":[[2024,4,18]]},"reference":[{"volume-title":"Adaption of Simulated Annealing to Chemical Optimization Problems","year":"1995","author":"Kalivas J. H.","key":"S1469026824500123BIB001"},{"key":"S1469026824500123BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.mbs.2006.11.012"},{"key":"S1469026824500123BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3108177"},{"key":"S1469026824500123BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103731"},{"key":"S1469026824500123BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114576"},{"key":"S1469026824500123BIB006","doi-asserted-by":"publisher","DOI":"10.48084\/etasr.3832"},{"key":"S1469026824500123BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04944-6_14"},{"key":"S1469026824500123BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"S1469026824500123BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"S1469026824500123BIB010","doi-asserted-by":"publisher","DOI":"10.4249\/scholarpedia.6915"},{"key":"S1469026824500123BIB011","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2011.042259"},{"key":"S1469026824500123BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2023.e16086"},{"key":"S1469026824500123BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107517"},{"key":"S1469026824500123BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.06.007"},{"key":"S1469026824500123BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-020-09498-y"},{"key":"S1469026824500123BIB016","first-page":"214","volume":"263","author":"Yu S.","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"S1469026824500123BIB017","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2014.907405"},{"key":"S1469026824500123BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2012.06.009"},{"key":"S1469026824500123BIB019","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2016.074630"},{"key":"S1469026824500123BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.12.024"},{"key":"S1469026824500123BIB021","unstructured":"I. Fister,  X.S. Yang,  I. Fister and  J. Brest ,  Memetic firefly algorithm for combinatorial optimization, preprint (2012), arXiv:1204.5165."},{"key":"S1469026824500123BIB022","doi-asserted-by":"publisher","DOI":"10.3390\/electronics7080132"},{"key":"S1469026824500123BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.10.032"},{"key":"S1469026824500123BIB024","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9809-y"},{"key":"S1469026824500123BIB025","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113216"},{"key":"S1469026824500123BIB026","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2019.01.006"},{"key":"S1469026824500123BIB027","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-0306-1_6"},{"key":"S1469026824500123BIB028","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1371-3"},{"key":"S1469026824500123BIB029","doi-asserted-by":"publisher","DOI":"10.3390\/w15101906"},{"key":"S1469026824500123BIB030","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120027"},{"key":"S1469026824500123BIB031","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04441-0"},{"key":"S1469026824500123BIB032","doi-asserted-by":"publisher","DOI":"10.3390\/s21165267"},{"key":"S1469026824500123BIB033","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2022.e11027"}],"container-title":["International Journal of Computational Intelligence and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1469026824500123","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T12:58:36Z","timestamp":1727182716000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1469026824500123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,18]]},"references-count":33,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["10.1142\/S1469026824500123"],"URL":"https:\/\/doi.org\/10.1142\/s1469026824500123","relation":{},"ISSN":["1469-0268","1757-5885"],"issn-type":[{"type":"print","value":"1469-0268"},{"type":"electronic","value":"1757-5885"}],"subject":[],"published":{"date-parts":[[2024,4,18]]},"article-number":"2450012"}}