{"id":"https://openalex.org/W2904025449","doi":"https://doi.org/10.3934/mfc.2018017","title":"An effective hybrid firefly algorithm with the cuckoo search for engineering optimization problems","display_name":"An effective hybrid firefly algorithm with the cuckoo search for engineering optimization problems","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2904025449","doi":"https://doi.org/10.3934/mfc.2018017","mag":"2904025449"},"language":"en","primary_location":{"id":"doi:10.3934/mfc.2018017","is_oa":true,"landing_page_url":"https://doi.org/10.3934/mfc.2018017","pdf_url":"https://www.aimsciences.org/article/exportPdf?id=ec2a71cf-2dfa-4020-b676-765562c9e19b","source":{"id":"https://openalex.org/S4210238810","display_name":"Mathematical Foundations of Computing","issn_l":"2577-8838","issn":["2577-8838"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315844","host_organization_name":"American Institute of Mathematical Sciences","host_organization_lineage":["https://openalex.org/P4310315844"],"host_organization_lineage_names":["American Institute of Mathematical Sciences"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Foundations of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.aimsciences.org/article/exportPdf?id=ec2a71cf-2dfa-4020-b676-765562c9e19b","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041766787","display_name":"Mohamed A. Tawhid","orcid":"https://orcid.org/0000-0002-3231-0594"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mohamed A. Tawhid","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5000081746","display_name":"Ahmed F. Ali","orcid":"https://orcid.org/0000-0003-1479-7148"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ahmed F. Ali","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041766787"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4887,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7400799,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":"4","first_page":"349","last_page":"368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983999729156494,"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.9983999729156494,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.982699990272522,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11801","display_name":"Reservoir Engineering and Simulation Methods","score":0.9368000030517578,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/firefly-algorithm","display_name":"Firefly algorithm","score":0.9593976736068726},{"id":"https://openalex.org/keywords/cuckoo-search","display_name":"Cuckoo search","score":0.9062130451202393},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6183594465255737},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5813597440719604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5559223890304565},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5285460352897644},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5053539872169495},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.463636577129364},{"id":"https://openalex.org/keywords/cuckoo","display_name":"Cuckoo","score":0.46262574195861816},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.457030713558197},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"Premature convergence","score":0.4477720260620117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26319825649261475},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.0868055522441864},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.07391759753227234}],"concepts":[{"id":"https://openalex.org/C154982244","wikidata":"https://www.wikidata.org/wiki/Q5451844","display_name":"Firefly algorithm","level":3,"score":0.9593976736068726},{"id":"https://openalex.org/C117241572","wikidata":"https://www.wikidata.org/wiki/Q5192379","display_name":"Cuckoo search","level":3,"score":0.9062130451202393},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6183594465255737},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5813597440719604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5559223890304565},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5285460352897644},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5053539872169495},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.463636577129364},{"id":"https://openalex.org/C2776810535","wikidata":"https://www.wikidata.org/wiki/Q26381","display_name":"Cuckoo","level":2,"score":0.46262574195861816},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.457030713558197},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.4477720260620117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26319825649261475},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.0868055522441864},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.07391759753227234},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C90856448","wikidata":"https://www.wikidata.org/wiki/Q431","display_name":"Zoology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3934/mfc.2018017","is_oa":true,"landing_page_url":"https://doi.org/10.3934/mfc.2018017","pdf_url":"https://www.aimsciences.org/article/exportPdf?id=ec2a71cf-2dfa-4020-b676-765562c9e19b","source":{"id":"https://openalex.org/S4210238810","display_name":"Mathematical Foundations of Computing","issn_l":"2577-8838","issn":["2577-8838"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315844","host_organization_name":"American Institute of Mathematical Sciences","host_organization_lineage":["https://openalex.org/P4310315844"],"host_organization_lineage_names":["American Institute of Mathematical Sciences"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Foundations of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.3934/mfc.2018017","is_oa":true,"landing_page_url":"https://doi.org/10.3934/mfc.2018017","pdf_url":"https://www.aimsciences.org/article/exportPdf?id=ec2a71cf-2dfa-4020-b676-765562c9e19b","source":{"id":"https://openalex.org/S4210238810","display_name":"Mathematical Foundations of Computing","issn_l":"2577-8838","issn":["2577-8838"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315844","host_organization_name":"American Institute of Mathematical Sciences","host_organization_lineage":["https://openalex.org/P4310315844"],"host_organization_lineage_names":["American Institute of Mathematical Sciences"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Foundations of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2904025449.pdf","grobid_xml":"https://content.openalex.org/works/W2904025449.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3183935101","https://openalex.org/W2234623360","https://openalex.org/W2792775317","https://openalex.org/W3004779303","https://openalex.org/W2765530022","https://openalex.org/W4309048563","https://openalex.org/W2755443890","https://openalex.org/W2570351209","https://openalex.org/W2991413231","https://openalex.org/W2980152930"],"abstract_inverted_index":{"Firefly":[0],"and":[1,18,46,57,70,84,143,159,164,185],"cuckoo":[2,48,127],"search":[3,49,128],"algorithms":[4,13,168],"are":[5],"two":[6],"of":[7,30,93],"the":[8,43,47,76,82,85,94,106,126,136,178,188],"most":[9],"widely":[10],"used":[11],"nature-inspired":[12],"due":[14],"to":[15,25,51,101,122,134,139,144,153,169],"their":[16],"simplicity":[17],"inexpensive":[19],"computational":[20],"cost":[21],"when":[22,105],"they":[23],"applied":[24,152],"solve":[26,52],"a":[27,35,79,182,195],"wide":[28],"range":[29],"problems.":[31,61],"In":[32,75,120],"this":[33,124],"article,":[34],"new":[36,107],"hybrid":[37],"algorithm":[38,45,50,64,96,138,150,180,184],"is":[39,65,88,97,99,109,132,151,181],"suggested":[40],"by":[41],"combining":[42],"firefly":[44,95,137],"constrained":[53,156],"optimization":[54,60,157,162],"problems":[55,158,163],"(COPs)":[56],"real-world":[58],"engineering":[59,161],"The":[62,90,148,173],"proposed":[63,149,179],"called":[66],"Hybrid":[67],"FireFly":[68],"Algorithm":[69],"Cuckoo":[71],"Search":[72],"(HFFACS)":[73],"algorithm.":[74],"HFFACS":[77],"algorithm,":[78],"balance":[80],"between":[81],"exploration":[83],"exploitation":[86],"processes":[87],"considered.":[89],"main":[91],"drawback":[92],"it":[98],"easy":[100],"fall":[102],"into":[103],"stagnation":[104,142],"solution":[108,116,193],"not":[110],"better":[111],"than":[112],"its":[113,171],"previous":[114],"best":[115],"for":[117],"several":[118],"generations.":[119],"order":[121],"avoid":[123,145],"problem,":[125],"with":[129],"L\u00e8vy":[130],"flight":[131],"invoked":[133],"force":[135],"escape":[140],"from":[141],"premature":[146],"convergence.":[147],"six":[154],"benchmark":[155],"five":[160],"compared":[165],"against":[166],"four":[167],"investigate":[170],"performance.":[172],"numerical":[174],"experimental":[175],"results":[176],"show":[177],"promising":[183],"can":[186],"obtain":[187],"optimal":[189,192],"or":[190],"near":[191],"within":[194],"reasonable":[196],"time.":[197]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}