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) method to solve the economic dispatch problem with prohibited zones and network losses. The approach employs binary variables for each prohibited zone and utilizes the B-coefficient for network losses, which can be transformed into a mixed-i...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on power systems Ročník 30; číslo 6; s. 2841 - 2855
Hlavní autori: Ding, Tao, Bo, Rui, Li, Fangxing, Sun, Hongbin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.11.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Constraints
Convergence
Economic dispatch
Economics
Heuristic
Mathematical models
mixed-integer nonlinear programming (MINLP)
Networks
Optimization
Power generation dispatch
prohibited operating zones
Quadratic programming
quadratically constrained quadratic programming (QCQP)
Relaxation methods
spatial branch-and-bound
ISSN:0885-8950, 1558-0679
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper proposes a bi-level branch-and-bound ((B&B) method to solve the economic dispatch problem with prohibited zones and network losses. The approach employs binary variables for each prohibited zone and utilizes the B-coefficient for network losses, which can be transformed into a mixed-integer quadratically constrained quadratic programming (MIQCQP), where linear relaxation technique is applied on each bilinear term. Due to the complexity in solving the MIQCQP problem, this paper proposes a bi-level B&B method to achieve global optimum. A spatial B&B method is utilized in the higher level to solve the quadratically constrained quadratic programming (QCQP) problem, whereas a simple B&B method is employed in the lower level to solve a mixed-integer quadratic programming (MIQP) problem. The bi-level B&B algorithm that combines spatial and simple B&B methods is actually a deterministic optimization method and can produce global optimal solutions. Numerical results on 6-unit, 15-unit, and 40-unit test systems show that the bi-level B&B method can solve the MIQCQP problem with superior solution quality and convergence characteristics.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.2014.2375322