{"id":"https://openalex.org/W4400275560","doi":"https://doi.org/10.1109/access.2024.3422261","title":"Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch","display_name":"Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4400275560","doi":"https://doi.org/10.1109/access.2024.3422261"},"language":"en","primary_location":{"id":"doi:10.1109/access.2024.3422261","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1109/access.2024.3422261","pdf_url":null,"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":"http://dx.doi.org/10.1109/access.2024.3422261","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036076204","display_name":"Elif Cesur","orcid":"https://orcid.org/0000-0001-5241-5628"},"institutions":[{"id":"https://openalex.org/I57913696","display_name":"Istanbul Medeniyet University","ror":"https://ror.org/05j1qpr59","country_code":"TR","type":"education","lineage":["https://openalex.org/I57913696"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Elif Cesur","raw_affiliation_strings":["Industrial Engineering Department, Istanbul Medeniyet University, İstanbul, Türkiye"],"raw_orcid":"https://orcid.org/0000-0001-5241-5628","affiliations":[{"raw_affiliation_string":"Industrial Engineering Department, Istanbul Medeniyet University, İstanbul, Türkiye","institution_ids":["https://openalex.org/I57913696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084031963","display_name":"Muhammet Ra\u015fit Cesur","orcid":"https://orcid.org/0000-0001-9941-0517"},"institutions":[{"id":"https://openalex.org/I57913696","display_name":"Istanbul Medeniyet University","ror":"https://ror.org/05j1qpr59","country_code":"TR","type":"education","lineage":["https://openalex.org/I57913696"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Muhammet Ra\u015fit Cesur","raw_affiliation_strings":["Industrial Engineering Department, Istanbul Medeniyet University, İstanbul, Türkiye"],"raw_orcid":"https://orcid.org/0000-0001-9941-0517","affiliations":[{"raw_affiliation_string":"Industrial Engineering Department, Istanbul Medeniyet University, İstanbul, Türkiye","institution_ids":["https://openalex.org/I57913696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087542455","display_name":"Ajith Abraham","orcid":"https://orcid.org/0000-0002-0169-6738"},"institutions":[{"id":"https://openalex.org/I3129773123","display_name":"Bennett University","ror":"https://ror.org/00an5hx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I3129773123"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ajith Abraham","raw_affiliation_strings":["School of Computer Science Engineering and Technology, Bennett University, Greater Noida, Uttar Pradesh, India"],"raw_orcid":"https://orcid.org/0000-0002-0169-6738","affiliations":[{"raw_affiliation_string":"School of Computer Science Engineering and Technology, Bennett University, Greater Noida, Uttar Pradesh, India","institution_ids":["https://openalex.org/I3129773123"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.5557,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.70341534,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"12","issue":null,"first_page":"93753","last_page":"93760"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9897000193595886,"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.9897000193595886,"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/T10424","display_name":"Electric Power System Optimization","score":0.977400004863739,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T12288","display_name":"Optimization and Search Problems","score":0.9613000154495239,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6203356981277466},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5961397290229797},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5914439558982849},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.577032208442688},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5687763094902039},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5397238731384277},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5245217084884644},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43905341625213623},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3408859968185425},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12002560496330261}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6203356981277466},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5961397290229797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5914439558982849},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.577032208442688},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5687763094902039},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5397238731384277},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5245217084884644},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43905341625213623},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3408859968185425},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12002560496330261},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2024.3422261","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1109/access.2024.3422261","pdf_url":null,"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:9613fb2a9f2345049bb74614497e0645","is_oa":true,"landing_page_url":"https://doaj.org/article/9613fb2a9f2345049bb74614497e0645","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"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":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 12, Pp 93753-93760 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2024.3422261","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1109/access.2024.3422261","pdf_url":null,"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":[],"awards":[{"id":"https://openalex.org/G154524172","display_name":null,"funder_award_id":"70-2021-00143","funder_id":"https://openalex.org/F4320319755","funder_display_name":"Analytical Center for the Government of the Russian Federation"}],"funders":[{"id":"https://openalex.org/F4320319755","display_name":"Analytical Center for the Government of the Russian Federation","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3146908064","https://openalex.org/W2235461833","https://openalex.org/W197700457","https://openalex.org/W4210428574","https://openalex.org/W4240870094","https://openalex.org/W2293110063","https://openalex.org/W2091012988","https://openalex.org/W2006054213","https://openalex.org/W1545330860","https://openalex.org/W4388650914"],"abstract_inverted_index":{"The":[0,131,181],"Branch":[1,116],"and":[2,17,53,73,104,117,148,177,213,223],"Bound":[3,118],"(BB)":[4],"algorithm,":[5,81],"while":[6],"ensuring":[7],"optimality,":[8],"often":[9],"encounters":[10],"performance":[11,166,222],"bottlenecks,":[12],"characterized":[13],"by":[14,37,231],"slow":[15],"execution":[16],"high":[18],"computational":[19],"overhead,":[20],"especially":[21],"when":[22],"dealing":[23],"with":[24,179,209],"intricate":[25],"or":[26],"extensive":[27],"problem":[28,40,59,142],"instances":[29],"(NP-Hard).":[30],"This":[31,204],"study":[32],"introduces":[33],"an":[34,192],"innovative":[35],"approach":[36,205],"dividing":[38],"the":[39,63,67,75,79,92,97,111,114,137,145,149,160,175,188],"into":[41,91,100],"partial":[42],"(local)":[43],"problems":[44,170,229],"in":[45,167,217],"a":[46,84,124],"manner":[47],"that":[48,171],"would":[49],"not":[50],"compromise":[51],"optimality":[52],"solving":[54,168],"sub-problems":[55],"of":[56,78,133,184,190,195],"each":[57],"local":[58],"individually,":[60],"to":[61,95,123,199,227],"shrink":[62],"solution":[64,98],"space.":[65],"In":[66,110,158],"initial":[68],"phase,":[69,113],"this":[70,134,185],"research":[71,186],"establishes":[72],"validates":[74],"mathematical":[76],"foundation":[77],"proposed":[80,150],"which":[82],"involves":[83],"pruning":[85],"approach.":[86],"Subsequently,":[87],"enhancements":[88],"are":[89],"incorporated":[90],"existing":[93],"BB":[94,147,176,178,232],"partition":[96],"space":[99],"more":[101],"manageable":[102],"sub-spaces":[103],"consolidate":[105],"solutions":[106],"from":[107],"these":[108],"sub-spaces.":[109],"final":[112],"Enhanced":[115],"(EBB)":[119],"algorithm":[120,152,162],"is":[121,187],"applied":[122],"real-world":[125],"power":[126],"dispatching":[127],"optimization":[128],"case":[129],"study.":[130],"outcomes":[132],"investigation":[135],"reveal":[136],"following:":[138],"1)":[139],"For":[140],"smaller":[141],"instances,":[143],"both":[144],"conventional":[146],"EBB":[151,161],"yield":[153],"identical":[154],"optimal":[155],"solutions.":[156],"2)":[157],"contrast,":[159],"demonstrates":[163],"significantly":[164],"improved":[165],"NP-hard":[169,202],"pose":[172],"challenges":[173],"for":[174],"pruning.":[180],"primary":[182],"contribution":[183],"introduction":[189],"EBB,":[191],"enhanced":[193],"version":[194],"BB,":[196,218],"specifically":[197],"designed":[198],"effectively":[200],"tackle":[201],"problems.":[203],"can":[206],"be":[207],"integrated":[208],"all":[210,228],"pruning,":[211],"branching,":[212],"bounding":[214],"strategies":[215],"used":[216],"thereby":[219],"boosting":[220],"its":[221],"making":[224],"it":[225],"applicable":[226],"solved":[230],"variations.":[233]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-23T23:11:35.936235","created_date":"2025-10-10T00:00:00"}