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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE access Vol. 12; pp. 93753 - 93760
Main Authors:	Cesur, Elif, Rasit Cesur, Muhammet, Abraham, Ajith
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!