{"id":"https://openalex.org/W4394939116","doi":"https://doi.org/10.1109/access.2024.3390670","title":"Leaf in Wind Optimization: A New Metaheuristic Algorithm for Solving Optimization Problems","display_name":"Leaf in Wind Optimization: A New Metaheuristic Algorithm for Solving Optimization Problems","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4394939116","doi":"https://doi.org/10.1109/access.2024.3390670"},"language":"en","primary_location":{"id":"doi:10.1109/access.2024.3390670","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2024.3390670","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/10504807.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/10504807.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013601839","display_name":"Ning Fang","orcid":"https://orcid.org/0000-0001-5937-5147"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Ning Fang","raw_affiliation_strings":["School of Electronic and Information Engineering, Beihang University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"School of Electronic and Information Engineering, Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055643461","display_name":"Qi Cao","orcid":"https://orcid.org/0009-0001-6927-9893"},"institutions":[{"id":"https://openalex.org/I181361081","display_name":"Longyan University","ror":"https://ror.org/0483s5p06","country_code":"CN","type":"education","lineage":["https://openalex.org/I181361081"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qi Cao","raw_affiliation_strings":["Longyan Tobacco Industrial Company Ltd., Longyan, China"],"affiliations":[{"raw_affiliation_string":"Longyan Tobacco Industrial Company Ltd., Longyan, China","institution_ids":["https://openalex.org/I181361081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013601839"],"corresponding_institution_ids":["https://openalex.org/I82880672"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":9.5388,"has_fulltext":true,"cited_by_count":28,"citation_normalized_percentile":{"value":0.98337518,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"12","issue":null,"first_page":"56291","last_page":"56308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.6541000008583069,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.6541000008583069,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.8581193685531616},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6060665845870972},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5967377424240112},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.4888378977775574},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.4428021311759949},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43502774834632874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4158990979194641},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.33839160203933716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24027758836746216}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.8581193685531616},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6060665845870972},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5967377424240112},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4888378977775574},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.4428021311759949},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43502774834632874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4158990979194641},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.33839160203933716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24027758836746216}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2024.3390670","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2024.3390670","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/10504807.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:d28018c3fd3143558f4f0d915d0ded12","is_oa":true,"landing_page_url":"https://doaj.org/article/d28018c3fd3143558f4f0d915d0ded12","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 12, Pp 56291-56308 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2024.3390670","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2024.3390670","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/10504807.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.8399999737739563,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4394939116.pdf","grobid_xml":"https://content.openalex.org/works/W4394939116.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W237869302","https://openalex.org/W1987491754","https://openalex.org/W2002550992","https://openalex.org/W2012115555","https://openalex.org/W2031183907","https://openalex.org/W2083100469","https://openalex.org/W2143001780","https://openalex.org/W2144317842","https://openalex.org/W2152195021","https://openalex.org/W2265628711","https://openalex.org/W2399865262","https://openalex.org/W2460998784","https://openalex.org/W2583027026","https://openalex.org/W2738900493","https://openalex.org/W2799991731","https://openalex.org/W2810255841","https://openalex.org/W2973125877","https://openalex.org/W3128686691","https://openalex.org/W3134651880","https://openalex.org/W3138197220","https://openalex.org/W4224314705","https://openalex.org/W4297509778","https://openalex.org/W4310536486","https://openalex.org/W4313563685","https://openalex.org/W4316497041","https://openalex.org/W4317206872","https://openalex.org/W4319159848","https://openalex.org/W4360610577","https://openalex.org/W4360980642","https://openalex.org/W4361009008","https://openalex.org/W4362711193","https://openalex.org/W4365815431","https://openalex.org/W4375862849","https://openalex.org/W4377821466","https://openalex.org/W4379115221","https://openalex.org/W4379534373","https://openalex.org/W4379794054","https://openalex.org/W4381745646","https://openalex.org/W4383752990","https://openalex.org/W4385212463","https://openalex.org/W4386049467","https://openalex.org/W4386781514","https://openalex.org/W4386933984"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W4236055036","https://openalex.org/W4381955442","https://openalex.org/W2462483068","https://openalex.org/W1968397678","https://openalex.org/W2795361474","https://openalex.org/W4308415747","https://openalex.org/W2986015160","https://openalex.org/W2161494499","https://openalex.org/W3212179065"],"abstract_inverted_index":{"This":[0,70],"study":[1],"introduces":[2],"a":[3,62],"novel":[4],"metaheuristic":[5],"algorithm,":[6],"Leaf":[7,174],"in":[8,19,31,157,175],"Wind":[9,176],"Optimization,":[10,128],"inspired":[11],"by":[12,36,59],"the":[13,20,26,78,146,150,183],"natural":[14],"phenomenon":[15],"of":[16,29,34,52,77,160,164],"falling":[17],"leaves":[18,30],"wind.":[21],"The":[22,47,81],"proposed":[23,151],"method":[24],"simulates":[25],"motion":[27,50],"response":[28],"varying":[32],"intensities":[33],"wind":[35],"establishing":[37],"models":[38],"for":[39,67],"light":[40],"wind-driven":[41,45],"blades":[42],"and":[43,55,75,96,141,167],"strong":[44],"blades.":[46],"algorithm":[48,152],"incorporates":[49],"modes":[51],"linear":[53],"translation":[54],"spiral":[56],"rotation":[57],"induced":[58],"wind,":[60],"offering":[61],"hybrid":[63],"search":[64,79],"framework":[65],"suitable":[66],"both":[68],"strategies.":[69],"approach":[71],"enables":[72],"enhanced":[73],"exploration":[74],"exploitation":[76],"space.":[80],"algorithm\u2019s":[82],"performance":[83],"was":[84,108],"evaluated":[85],"using":[86],"three":[87],"challenging":[88],"benchmark":[89],"test":[90],"sets,":[91],"CEC":[92,94,97],"2017,":[93],"2019":[95],"2022,":[98],"as":[99,101],"well":[100],"an":[102],"engineering":[103],"practical":[104],"problem.":[105],"Its":[106],"effectiveness":[107],"assessed":[109],"through":[110],"comparison":[111],"with":[112],"10":[113],"random":[114],"optimization":[115],"algorithms,":[116],"namely:":[117],"Tree":[118],"Seed":[119],"Algorithm,":[120,125],"Multi-Verse":[121],"Optimizer,":[122,133,136,140],"Salp":[123],"Swarm":[124],"Artificial":[126],"Ecosystem-based":[127],"Hunger":[129],"Games":[130],"Search,":[131],"Fox":[132],"Spider":[134],"Wasp":[135],"AOBLMOA,":[137],"Enhanced":[138],"Snake":[139],"IbI":[142],"Logic":[143],"Algorithm.":[144],"In":[145],"comprehensive":[147],"testing":[148],"conducted,":[149],"consistently":[153],"outperformed":[154],"other":[155],"optimizers":[156,185],"approximately":[158],"82%":[159],"comparisons.":[161],"Through":[162],"examination":[163],"convergence":[165],"curves":[166],"statistical":[168],"data,":[169],"it":[170],"is":[171],"evident":[172],"that":[173],"Optimization":[177],"demonstrates":[178],"superior":[179],"potential":[180],"compared":[181],"to":[182],"alternative":[184],"under":[186],"consideration.":[187]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":21},{"year":2024,"cited_by_count":5}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}