PROJECT TITLE :
A Bi-Level Branch and Bound Method for Economic Dispatch With Disjoint Prohibited Zones Considering Network Losses
This paper proposes a bi-level branch-and-bound ((B&B) technique to resolve the economic dispatch drawback with prohibited zones and network losses. The approach employs binary variables for each prohibited zone and utilizes the B-coefficient for network losses, that can be transformed into a mixed-integer quadratically constrained quadratic programming (MIQCQP), where linear relaxation technique is applied on each bilinear term. Because of the complexity in solving the MIQCQP drawback, this paper proposes a bi-level B&B methodology to attain world optimum. A spatial B&B method is utilised in the higher level to unravel the quadratically constrained quadratic programming (QCQP) drawback, whereas a easy B&B methodology is used within the lower level to unravel a mixed-integer quadratic programming (MIQP) problem. The bi-level B&B algorithm that combines spatial and easy B&B methods is truly a deterministic optimization technique and can manufacture international optimal solutions. Numerical results on vi-unit, 15-unit, and forty-unit take a look at systems show that the bi-level B&B methodology will solve the MIQCQP drawback with superior solution quality and convergence characteristics.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here