Minimization of the distribution operating costs with D-STATCOMS: A mixed-integer conic model
This paper addresses the problem of determining the optimal location and operation of distribution static synchronous compensators (D-STATCOMs) in power distribution networks. Metaheuristic algorithms have been conventionally used to solve this mixed-integer nonlinear programming problem. In contras...
Saved in:
Published in | Electric power systems research Vol. 212; p. 108346 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.11.2022
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper addresses the problem of determining the optimal location and operation of distribution static synchronous compensators (D-STATCOMs) in power distribution networks. Metaheuristic algorithms have been conventionally used to solve this mixed-integer nonlinear programming problem. In contrast, we propose a mixed-integer second-order cone programming (MI-SOCP) model that guarantees global optimum and fast convergence of the algorithms in optimization solvers. The model seeks to minimize the annual installation cost and the operating cost, subject to active and reactive power balance constraints, voltage regulation bounds, devices capabilities, and the number of D-STATCOMs available to be connected. The multiobjective nature of the problem is also analyzed and solved using the proposed MI-SOCP model. An extensive set of simulations on the IEEE-33 nodes test system demonstrate the advantages of this approach compared to conventional heuristic algorithms and with solutions given by algebraic modeling software.
•D-STACOMs permit annual operative costs reduction in distribution grids.•MI-SOCP formulation allows finding the global optimal solution of the exact MINLP model through solution space convexification.•The proposed optimization model does not require statistical evaluation to validate its efficiency since it is mixed-integer convex in nature. |
---|---|
ISSN: | 0378-7796 1873-2046 |
DOI: | 10.1016/j.epsr.2022.108346 |