Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch

The Branch and Bound (BB) algorithm, while ensuring optimality, often encounters performance bottlenecks, characterized by slow execution and high computational overhead, especially when dealing with intricate or extensive problem instances (NP-Hard). This study introduces an innovative approach by...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE access Ročník 12; s. 93753 - 93760
Hlavní autori:	Cesur, Elif, Rasit Cesur, Muhammet, Abraham, Ajith
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Branch and bound algorithm Branch and bound methods Dispatching enhanced branch and bound algorithm Machine learning algorithms NP-hard problem Optimization Power dispatch power dispatching optimization Power distribution Problem-solving pruning strategy Search problems Solution space Surveys
ISSN:	2169-3536, 2169-3536
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!