{"id":"https://openalex.org/W2136554306","doi":"https://doi.org/10.1109/tevc.2009.2033580","title":"Chemical-Reaction-Inspired Metaheuristic for Optimization","display_name":"Chemical-Reaction-Inspired Metaheuristic for Optimization","publication_year":2009,"publication_date":"2009-12-16","ids":{"openalex":"https://openalex.org/W2136554306","doi":"https://doi.org/10.1109/tevc.2009.2033580","mag":"2136554306"},"language":"en","primary_location":{"id":"doi:10.1109/tevc.2009.2033580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2009.2033580","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"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 Transactions on Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050605025","display_name":"Albert Y. S. Lam","orcid":"https://orcid.org/0000-0002-6887-9301"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Albert Y S Lam","raw_affiliation_strings":["Department of Electrical and Electronic Engineering, University of Hong Kong, Hong Kong, China","Dept. of Electr. & Electron. Engg, Univ. of Hong Kong, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]},{"raw_affiliation_string":"Dept. of Electr. & Electron. Engg, Univ. of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056877599","display_name":"Victor O. K. Li","orcid":"https://orcid.org/0000-0002-1380-9445"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Victor O K Li","raw_affiliation_strings":["Department of Electrical and Electronic Engineering, University of Hong Kong, Hong Kong, China","Dept. of Electr. & Electron. Engg, Univ. of Hong Kong, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]},{"raw_affiliation_string":"Dept. of Electr. & Electron. Engg, Univ. of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I889458895"],"apc_list":null,"apc_paid":null,"fwci":9.3731,"has_fulltext":false,"cited_by_count":589,"citation_normalized_percentile":{"value":0.98504865,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"14","issue":"3","first_page":"381","last_page":"399"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9925000071525574,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9925000071525574,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9860000014305115,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9814000129699707,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.9282070994377136},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.610114574432373},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6069239974021912},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5380401611328125},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5004703998565674},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.48822739720344543},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.47021058201789856},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.42698460817337036},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.42558497190475464},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3355645537376404},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2370430827140808}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.9282070994377136},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.610114574432373},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6069239974021912},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5380401611328125},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5004703998565674},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.48822739720344543},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.47021058201789856},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.42698460817337036},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.42558497190475464},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3355645537376404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2370430827140808},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","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/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tevc.2009.2033580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2009.2033580","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"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 Transactions on Evolutionary Computation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.313.9637","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.9637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eee.hku.hk/research/doc/tr/TR2009003_CRI_Metaheuristic_Optimization.pdf","raw_type":"text"},{"id":"pmh:oai:hub.hku.hk:10722/130634","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/130634","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6200000047683716,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W16088600","https://openalex.org/W16274536","https://openalex.org/W58335057","https://openalex.org/W62442943","https://openalex.org/W168006464","https://openalex.org/W626292722","https://openalex.org/W1497256448","https://openalex.org/W1501066815","https://openalex.org/W1503085769","https://openalex.org/W1573676079","https://openalex.org/W1639032689","https://openalex.org/W1971700807","https://openalex.org/W1973131489","https://openalex.org/W1979142433","https://openalex.org/W1993885071","https://openalex.org/W2011039300","https://openalex.org/W2013603106","https://openalex.org/W2016007273","https://openalex.org/W2024060531","https://openalex.org/W2048698391","https://openalex.org/W2053496475","https://openalex.org/W2056760934","https://openalex.org/W2065401134","https://openalex.org/W2066883591","https://openalex.org/W2070891082","https://openalex.org/W2082603400","https://openalex.org/W2086917808","https://openalex.org/W2090435272","https://openalex.org/W2092337239","https://openalex.org/W2093475907","https://openalex.org/W2097437812","https://openalex.org/W2102184039","https://openalex.org/W2108044931","https://openalex.org/W2108583366","https://openalex.org/W2111185171","https://openalex.org/W2121852392","https://openalex.org/W2122689321","https://openalex.org/W2125965138","https://openalex.org/W2142053997","https://openalex.org/W2142906016","https://openalex.org/W2146354236","https://openalex.org/W2150480157","https://openalex.org/W2151554678","https://openalex.org/W2152150600","https://openalex.org/W2154487696","https://openalex.org/W2159505773","https://openalex.org/W2339500526","https://openalex.org/W2904250082","https://openalex.org/W3023540311","https://openalex.org/W3147414854","https://openalex.org/W4212899374","https://openalex.org/W4292408555","https://openalex.org/W6606839663"],"related_works":["https://openalex.org/W1523547988","https://openalex.org/W1531056015","https://openalex.org/W1571373126","https://openalex.org/W4233053549","https://openalex.org/W3205136130","https://openalex.org/W2024358852","https://openalex.org/W1575663621","https://openalex.org/W2144557478","https://openalex.org/W2006721481","https://openalex.org/W4375949242"],"abstract_inverted_index":{"We":[0,57,88],"encounter":[1],"optimization":[2,37,65,69,100,183],"problems":[3,38,108,190],"in":[4,9,77,133,142],"our":[5],"daily":[6],"lives":[7],"and":[8,39,109,136],"various":[10],"research":[11],"domains.":[12],"Some":[13],"of":[14,36,43,75,92,103],"them":[15,104,132],"are":[16,51],"so":[17],"hard":[18,98],"that":[19,48,119],"we":[20],"can,":[21],"at":[22],"best,":[23],"approximate":[24],"the":[25,33,40,55,73,90,110,125,139,143,148,157,171,197],"best":[26,140],"solutions":[27],"with":[28,94,124,147,196],"(meta-)":[29],"heuristic":[30],"methods.":[31],"However,":[32],"huge":[34],"number":[35,42],"small":[41],"generally":[44,199],"acknowledged":[45,200],"methods":[46],"mean":[47],"more":[49],"metaheuristics":[50,167],"needed":[52],"to":[53,67,81,170],"fill":[54],"gap.":[56],"propose":[58],"a":[59,78,83,113,178],"new":[60,179],"metaheuristic,":[61],"called":[62],"chemical":[63,79],"reaction":[64,80],"(CRO),":[66],"solve":[68,188],"problems.":[70,101,184],"It":[71],"mimics":[72],"interactions":[74],"molecules":[76],"reach":[82],"low":[84],"energy":[85],"stable":[86],"state.":[87],"tested":[89],"performance":[91,141,155],"CRO":[93,120,137,151,185],"three":[95],"nondeterministic":[96],"polynomial-time":[97],"combinatorial":[99],"Two":[102],"were":[105],"traditional":[106],"benchmark":[107],"other":[111,166],"was":[112],"real-world":[114,144],"problem.":[115,145],"Simulation":[116],"results":[117],"showed":[118],"is":[121],"very":[122],"competitive":[123],"few":[126,198],"existing":[127],"successful":[128],"metaheuristics,":[129],"having":[130],"outperformed":[131],"some":[134],"cases,":[135],"achieved":[138],"Moreover,":[146],"No-Free-Lunch":[149],"theorem,":[150],"must":[152],"have":[153],"equal":[154],"as":[156],"others":[158],"on":[159],"average,":[160],"but":[161],"it":[162,176],"can":[163],"outperform":[164],"all":[165],"when":[168],"matched":[169],"right":[172],"problem":[173],"type.":[174],"Therefore,":[175],"provides":[177],"approach":[180],"for":[181],"solving":[182],"may":[186,192],"potentially":[187],"those":[189],"which":[191],"not":[193],"be":[194],"solvable":[195],"approaches.":[201]},"counts_by_year":[{"year":2026,"cited_by_count":9},{"year":2025,"cited_by_count":32},{"year":2024,"cited_by_count":37},{"year":2023,"cited_by_count":38},{"year":2022,"cited_by_count":46},{"year":2021,"cited_by_count":48},{"year":2020,"cited_by_count":44},{"year":2019,"cited_by_count":48},{"year":2018,"cited_by_count":46},{"year":2017,"cited_by_count":52},{"year":2016,"cited_by_count":44},{"year":2015,"cited_by_count":35},{"year":2014,"cited_by_count":52},{"year":2013,"cited_by_count":31},{"year":2012,"cited_by_count":14}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}