51 research outputs found

    Optimal Power Flow with Step-Voltage Regulators in Multi-Phase Distribution Networks

    Full text link
    This paper develops a branch-flow based optimal power flow (OPF) problem for multi-phase distribution networks that allows for tap selection of wye, closed-delta, and open-delta step-voltage regulators (SVRs). SVRs are assumed ideal and their taps are represented by continuous decision variables. To tackle the non-linearity, the branch-flow semidefinite programming framework of traditional OPF is expanded to accommodate SVR edges. Three types of non-convexity are addressed: (a) rank-1 constraints on non-SVR edges, (b) nonlinear equality constraints on SVR power flows and taps, and (c) trilinear equalities on SVR voltages and taps. Leveraging a practical phase-separation assumption on the SVR secondary voltage, novel McCormick relaxations are provided for (c) and certain rank-1 constraints of (a), while dropping the rest. A linear relaxation based on conservation of power is used in place of (b). Numerical simulations on standard distribution test feeders corroborate the merits of the proposed convex formulation.Comment: This manuscript has been submitted to IEEE Transactions on Power System

    Disaggregated Bundle Methods for Distributed Market Clearing in Power Networks

    Full text link
    A fast distributed approach is developed for the market clearing with large-scale demand response in electric power networks. In addition to conventional supply bids, demand offers from aggregators serving large numbers of residential smart appliances with different energy constraints are incorporated. Leveraging the Lagrangian relaxation based dual decomposition, the resulting optimization problem is decomposed into separate subproblems, and then solved in a distributed fashion by the market operator and each aggregator aided by the end-user smart meters. A disaggregated bundle method is adapted for solving the dual problem with a separable structure. Compared with the conventional dual update algorithms, the proposed approach exhibits faster convergence speed, which results in reduced communication overhead. Numerical results corroborate the effectiveness of the novel approach.Comment: To appear in GlobalSIP 201
    corecore