The deterministic methods generally used to solve DC optimal power flow (OPF) do not fully capture the uncertainty information in wind power, and thus their solutions could be suboptimal. However, the stochastic dynamic AC OPF problem can be used to find an optimal solution by fully capturing the uncertainty information of wind power. That uncertainty information of future wind power can be wel...

This paper proposes three strong second order cone programming (SOCP) relaxations for the AC optimal power flow (OPF) problem. These three relaxations are incomparable to each other and two of them are incomparable to the standard SDP relaxation of OPF. Extensive computational experiments show that these relaxations have numerous advantages over existing convex relaxations in the literature: (i...

The optimal power flow (OPF) problem determines an optimal operating point of the power network that minimizes a certain objective function subject to physical and network constraints. There has been a great deal of attention in convex relaxation of the OPF problem in recent years, and it has been shown that a semidefinite programming (SDP) relaxation can solve different classes of the nonconve...

Optimal power flow (OPF) is the most requisite tool in the power system analysis. The OPF is relatively a difficult constrained optimization problem and broadly solved by conventional as well as modern intelligent methods. In this paper the authors proposed a levy flight spider monkey optimization (LFSMO) algorithm to solve the standard OPF problem for IEEE 30-bus system, which is proposed to i...

 Abstract-In this paper, we develop semidefinite programming (SDP) models aimed at solving optimal power flow (OPF) problems in distribution systems. We propose two models: the symmetrical SDP model which modifies the existing BFM-SDP model. Then based on the symmetrical SDP model, we develop a voltage regulation model that solves OPF problems with binding voltage constraints. To evaluate the ...

The paper presents a Jacobian smoothing nonlinear complementarity method for solving large nonlinear optimal power flow (OPF) problems. By using (smooth or non-smooth) nonlinear complementarity (NC) functions we reformulate the OPF problem as a (smooth or non-smooth) nonlinear system of equations, which, in turn, can be solved by well-known methods. The Jacobian smoothing method computes the se...

This paper proposes a multiobjective harmony search (MOHS) algorithm for optimal power flow (OPF) problem. OPF problem is formulated as a nonlinear constrained multiobjective optimization problem where different objectives and different constraints have been considered. Fast elitist non dominated sorting and crowding distance have been used to find and manage the Pareto optimal front. Finally, ...

This paper presents three efficient approaches for solving the Optimal Power Flow (OPF) problem using the meta-heuristic algorithms. Mathematically, OPF is formulated as non-linear equality and inequality constrained optimization problem. The main drawback of meta-heuristic algorithm based OPF is the excessive execution time required due to the large number of load flows/power flows needed in t...

Exeoutive Summary Modern computation tools, such as the Optimal Power Flow (OPF) and Automatic Contingency Analysis (ACA), reduce significantly the time required to develop reliable and economical transmission plans. The traditional use of multiple power flows for planning large power systems with complex interconnections is very labor intensive and time consuming and limits the number of optio...