{"id":"https://openalex.org/W7131284987","doi":"https://doi.org/10.71448/bcds2342-1","title":"A Hybrid Chemical Reaction Optimization Algorithm with Local Refinement for the Maximum Independent Set Problem","display_name":"A Hybrid Chemical Reaction Optimization Algorithm with Local Refinement for the Maximum Independent Set Problem","publication_year":2023,"publication_date":"2023-12-30","ids":{"openalex":"https://openalex.org/W7131284987","doi":"https://doi.org/10.71448/bcds2342-1"},"language":null,"primary_location":{"id":"doi:10.71448/bcds2342-1","is_oa":true,"landing_page_url":"https://doi.org/10.71448/bcds2342-1","pdf_url":null,"source":{"id":"https://openalex.org/S7407053757","display_name":"Bulletin of Computer and Data Sciences","issn_l":"3072-2926","issn":["3072-2926"],"is_oa":false,"is_in_doaj":false,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of Computer and Data Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.71448/bcds2342-1","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126677306","display_name":"Lena Paul","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lena Paul","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126087019","display_name":"Mia Katharina","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mia Katharina","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5126677306"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.56037448,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"2","first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10621","display_name":"Gene Regulatory Network Analysis","score":0.09929999709129333,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10621","display_name":"Gene Regulatory Network Analysis","score":0.09929999709129333,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.08030000329017639,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12029","display_name":"DNA and Biological Computing","score":0.062199998646974564,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.608299970626831},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5835000276565552},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5777999758720398},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5164999961853027},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44200000166893005},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.44179999828338623},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.42739999294281006},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.364300012588501}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6164000034332275},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.608299970626831},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5835000276565552},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5777999758720398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5684000253677368},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5164999961853027},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4909999966621399},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44200000166893005},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.44179999828338623},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.42739999294281006},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.364300012588501},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3440000116825104},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.3343000113964081},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30649998784065247},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.28839999437332153},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.26460000872612},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.25450000166893005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.71448/bcds2342-1","is_oa":true,"landing_page_url":"https://doi.org/10.71448/bcds2342-1","pdf_url":null,"source":{"id":"https://openalex.org/S7407053757","display_name":"Bulletin of Computer and Data Sciences","issn_l":"3072-2926","issn":["3072-2926"],"is_oa":false,"is_in_doaj":false,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of Computer and Data Sciences","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.71448/bcds2342-1","is_oa":true,"landing_page_url":"https://doi.org/10.71448/bcds2342-1","pdf_url":null,"source":{"id":"https://openalex.org/S7407053757","display_name":"Bulletin of Computer and Data Sciences","issn_l":"3072-2926","issn":["3072-2926"],"is_oa":false,"is_in_doaj":false,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of Computer and Data Sciences","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.40902480483055115}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,88],"maximum":[1],"independent":[2,59,94],"set":[3],"(MIS)":[4],"problem":[5,10,73],"is":[6,80,192],"a":[7,64,83],"classical":[8],"NP-hard":[9],"that":[11,157,186],"appears":[12],"in":[13,74,166],"diverse":[14],"applications":[15],"such":[16],"as":[17,149,151],"scheduling,":[18],"wireless":[19],"sensor":[20],"networks,":[21],"resource":[22],"allocation,":[23],"and":[24,49,96,104,147,173],"bioinformatics.":[25],"Metaheuristic":[26],"approaches,":[27],"including":[28],"Chemical":[29],"Reaction":[30],"Optimization":[31],"(CRO),":[32],"have":[33],"shown":[34],"promising":[35],"results":[36,140],"on":[37,45,132,141,152],"medium-sized":[38],"instances;":[39],"however,":[40],"plain":[41],"CRO":[42,69,118,160,165,191],"typically":[43],"relies":[44],"stochastic":[46],"structural":[47],"modifications":[48],"may":[50],"require":[51],"multiple":[52],"runs":[53,176],"to":[54,101,178,196],"reach":[55,179],"optimal":[56],"or":[57],"near-optimal":[58],"sets.":[60],"This":[61],"paper":[62],"proposes":[63],"hybrid":[65,159],"(memetic)":[66],"variant":[67],"of":[68,108,117,122,144,168,175],"for":[70],"the":[71,106,109,113,120,125,158,163,180],"MIS":[72],"which":[75],"each":[76],"newly":[77],"generated":[78],"molecule":[79],"passed":[81],"through":[82],"problem-specific":[84],"local":[85,89,123],"refinement":[86],"procedure.":[87],"step":[90],"greedily":[91],"expands":[92],"partial":[93],"sets":[95],"applies":[97],"1-swap/2-swap":[98],"neighborhood":[99],"moves":[100],"remove":[102],"conflicts":[103,136],"increase":[105],"cardinality":[107],"set.":[110],"By":[111],"combining":[112],"global":[114],"exploration":[115],"capability":[116],"with":[119],"intensification":[121],"search,":[124],"proposed":[126],"method":[127],"achieves":[128],"higher-quality":[129],"solutions,":[130],"especially":[131],"dense":[133],"graphs":[134,143],"where":[135],"are":[137],"frequent.":[138],"Experimental":[139],"synthetic":[142],"varying":[145],"sizes":[146],"densities,":[148],"well":[150],"standard":[153],"benchmark":[154],"instances,":[155],"show":[156],"consistently":[161],"outperforms":[162],"baseline":[164],"terms":[167],"best":[169,181],"solution,":[170,172],"average":[171],"number":[174],"needed":[177],"MIS.":[182],"These":[183],"findings":[184],"indicate":[185],"embedding":[187],"domain":[188],"knowledge":[189],"into":[190],"an":[193],"effective":[194],"way":[195],"improve":[197],"robustness":[198],"without":[199],"losing":[200],"generality.":[201]},"counts_by_year":[],"updated_date":"2026-02-25T21:11:00.739837","created_date":"2026-02-25T00:00:00"}