{"id":"https://openalex.org/W4414600664","doi":"https://doi.org/10.1007/s10586-025-05600-w","title":"C-MOBRO: constrained multi-objective Battle Royale Optimization algorithm","display_name":"C-MOBRO: constrained multi-objective Battle Royale Optimization algorithm","publication_year":2025,"publication_date":"2025-09-29","ids":{"openalex":"https://openalex.org/W4414600664","doi":"https://doi.org/10.1007/s10586-025-05600-w"},"language":"en","primary_location":{"id":"doi:10.1007/s10586-025-05600-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10586-025-05600-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10586-025-05600-w.pdf","source":{"id":"https://openalex.org/S106148199","display_name":"Cluster Computing","issn_l":"1386-7857","issn":["1386-7857","1573-7543"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cluster Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10586-025-05600-w.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093068999","display_name":"Sait Alp","orcid":"https://orcid.org/0000-0003-2462-6166"},"institutions":[{"id":"https://openalex.org/I162720556","display_name":"Karadeniz Technical University","ror":"https://ror.org/03z8fyr40","country_code":"TR","type":"education","lineage":["https://openalex.org/I162720556"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Sait Alp","raw_affiliation_strings":["Department of Artificial Intelligence Engineering, Trabzon University, Trabzon, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Artificial Intelligence Engineering, Trabzon University, Trabzon, Turkey","institution_ids":["https://openalex.org/I162720556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039520935","display_name":"Rahim Dehkharghani","orcid":"https://orcid.org/0000-0002-9619-8247"},"institutions":[{"id":"https://openalex.org/I132286405","display_name":"Kadir Has University","ror":"https://ror.org/03zzckc47","country_code":"TR","type":"education","lineage":["https://openalex.org/I132286405"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Rahim Dehkharghani","raw_affiliation_strings":["Department of Computer Engineering, Kadirhas University, Istanbul, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kadirhas University, Istanbul, Turkey","institution_ids":["https://openalex.org/I132286405"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083608225","display_name":"Taymaz Akan","orcid":"https://orcid.org/0000-0003-4070-1058"},"institutions":[{"id":"https://openalex.org/I67581229","display_name":"Istanbul University","ror":"https://ror.org/03a5qrr21","country_code":"TR","type":"education","lineage":["https://openalex.org/I67581229"]},{"id":"https://openalex.org/I81020160","display_name":"Louisiana State University Health Sciences Center Shreveport","ror":"https://ror.org/03151rh82","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I81020160"]}],"countries":["TR","US"],"is_corresponding":false,"raw_author_name":"Taymaz Akan","raw_affiliation_strings":["Department of Medicine, Louisiana State University Health Sciences Center, 71103, Shreveport, USA","Department of Software Engineering, Istanbul Topkapi University, Istanbul, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Medicine, Louisiana State University Health Sciences Center, 71103, Shreveport, USA","institution_ids":["https://openalex.org/I81020160"]},{"raw_affiliation_string":"Department of Software Engineering, Istanbul Topkapi University, Istanbul, Turkey","institution_ids":["https://openalex.org/I67581229"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5093068999"],"corresponding_institution_ids":["https://openalex.org/I162720556"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2790},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2790},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.35673841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"14","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13371","display_name":"Military Defense Systems Analysis","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13371","display_name":"Military Defense Systems Analysis","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.9940000176429749,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9871000051498413,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.8673999905586243},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.635200023651123},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5767999887466431},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5745999813079834},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5734999775886536},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.5422000288963318},{"id":"https://openalex.org/keywords/constrained-optimization-problem","display_name":"Constrained optimization problem","score":0.48539999127388},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.475600004196167}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.8673999905586243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8245999813079834},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6521999835968018},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.635200023651123},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5767999887466431},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5745999813079834},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5734999775886536},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.5422000288963318},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.48539999127388},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.475600004196167},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.41990000009536743},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39149999618530273},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.35519999265670776},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.33730000257492065},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3224000036716461},{"id":"https://openalex.org/C2778627824","wikidata":"https://www.wikidata.org/wiki/Q178561","display_name":"Battle","level":2,"score":0.31949999928474426},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.3075000047683716},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.3046000003814697},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.29760000109672546},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.263700008392334}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10586-025-05600-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10586-025-05600-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10586-025-05600-w.pdf","source":{"id":"https://openalex.org/S106148199","display_name":"Cluster Computing","issn_l":"1386-7857","issn":["1386-7857","1573-7543"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cluster Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10586-025-05600-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10586-025-05600-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10586-025-05600-w.pdf","source":{"id":"https://openalex.org/S106148199","display_name":"Cluster Computing","issn_l":"1386-7857","issn":["1386-7857","1573-7543"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cluster Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414600664.pdf"},"referenced_works_count":55,"referenced_works":["https://openalex.org/W120014323","https://openalex.org/W161551212","https://openalex.org/W1561610472","https://openalex.org/W1599673523","https://openalex.org/W1651089295","https://openalex.org/W1898436154","https://openalex.org/W1976656630","https://openalex.org/W2014526894","https://openalex.org/W2022485595","https://openalex.org/W2038420231","https://openalex.org/W2053900989","https://openalex.org/W2085507535","https://openalex.org/W2108968575","https://openalex.org/W2126105956","https://openalex.org/W2143381319","https://openalex.org/W2143585163","https://openalex.org/W2151554678","https://openalex.org/W2165171393","https://openalex.org/W2165613966","https://openalex.org/W2167159964","https://openalex.org/W2174096823","https://openalex.org/W2475393579","https://openalex.org/W2556663394","https://openalex.org/W2593665141","https://openalex.org/W2751605210","https://openalex.org/W2912180855","https://openalex.org/W3036925570","https://openalex.org/W3102622641","https://openalex.org/W3185346377","https://openalex.org/W3195664246","https://openalex.org/W4200253302","https://openalex.org/W4210573949","https://openalex.org/W4210773564","https://openalex.org/W4211154164","https://openalex.org/W4214941022","https://openalex.org/W4294904107","https://openalex.org/W4311255556","https://openalex.org/W4312000417","https://openalex.org/W4313176599","https://openalex.org/W4372292092","https://openalex.org/W4386283310","https://openalex.org/W4389941293","https://openalex.org/W4393253095","https://openalex.org/W4399116693","https://openalex.org/W4399338032","https://openalex.org/W4400321648","https://openalex.org/W4403924949","https://openalex.org/W4404105693","https://openalex.org/W4404515902","https://openalex.org/W4404517748","https://openalex.org/W4404869361","https://openalex.org/W4405933181","https://openalex.org/W4406334766","https://openalex.org/W4407783029","https://openalex.org/W4407937732"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"The":[1,101,174],"recently":[2],"proposed":[3,22],"Battle":[4],"Royale":[5],"Optimization":[6],"(BRO)":[7],"algorithm":[8],"provided":[9],"an":[10],"acceptable":[11],"trade-off":[12],"between":[13],"exploration":[14],"and":[15,26,99,127,162,171],"exploitation.":[16],"In":[17,44],"our":[18],"previous":[19],"work,":[20],"we":[21],"single-objective":[23],"binary,":[24],"multimodal,":[25],"unconstrained":[27],"multi-objective":[28,41,45,125,141,190],"versions":[29],"of":[30,35,55,103,118,122,186],"this":[31],"algorithm.":[32],"However,":[33],"most":[34],"the":[36,78,104,146,149,154,179,187],"real-world":[37,123],"problems":[38,93],"are":[39,58],"constrained":[40,124,140,189],"in":[42,60],"nature.":[43],"optimization,":[46],"it":[47],"is":[48,70,106,181],"necessary":[49],"to":[50,89],"simultaneously":[51],"optimize":[52],"a":[53,66,84,119],"number":[54],"objectives,":[56],"which":[57,112],"typically":[59],"conflict":[61],"with":[62,137,184],"each":[63],"other,":[64],"over":[65],"feasible":[67],"set":[68],"that":[69,178],"determined":[71],"by":[72,95],"constraint":[73],"functions.":[74],"This":[75,130,143],"paper":[76],"introduces":[77],"Constrained":[79],"Multi-Objective":[80],"BRO":[81],"(C-MOBRO)":[82],"algorithm,":[83],"novel":[85],"computational":[86],"approach":[87],"designed":[88],"address":[90],"complex":[91],"optimization":[92,128,191],"characterized":[94],"multiple":[96],"conflicting":[97],"objectives":[98],"constraints.":[100],"performance":[102,151],"C-MOBRO":[105,147,180],"evaluated":[107],"on":[108],"CEC2021":[109,155],"benchmark":[110,115,131],"problems,":[111],"includes":[113],"50":[114],"suits":[116],"consisting":[117],"wide":[120],"range":[121],"engineering":[126],"challenges.":[129],"suite":[132],"has":[133],"also":[134],"been":[135],"experimented":[136],"several":[138],"state-of-the-art":[139],"algorithms.":[142,192],"study":[144],"evaluates":[145],"using":[148],"same":[150],"metrics":[152],"as":[153,168],"benchmark:":[156],"Hyper-Volume":[157],"(HV),":[158],"Feasibility":[159],"Rate":[160],"(FR),":[161],"Constraint":[163],"Violation":[164],"(CV),":[165],"separately":[166],"calculated":[167],"best,":[169],"worst":[170],"mean":[172],"values.":[173],"obtained":[175],"results":[176],"show":[177],"competitive":[182],"edge":[183],"state":[185],"art":[188]},"counts_by_year":[],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2025-10-10T00:00:00"}