Search

Isolated microgrid power systems are prone to large frequency and voltage deviations, since they have limited generation and finite inertia and may include pulse power loads and large proportion of dynamic loads. Thus, they require effective power management methods to operate optimally, while satisfying operating and security constraints. In this paper, a novel integrated security-constrained model-based power management approach is proposed for isolated microgrids in all-electric ships during the normal/alert operating state. The new power management method was formulated as a multi-objective optimal control problem. A method based on the Nondominated Sorting Genetic Algorithm II was developed to solve the problem. The developed integrated security-constrained power management approach was applied to a notional all-electric ship computer model. The simulation results, conducted in PSCAD, showed the effectiveness of the new power management method. [ABSTRACT FROM PUBLISHER]

This paper proposes a two-stage robust optimization approach to solve the N-k contingency-constrained unit commitment (CCUC) problem. In our approach, both generator and transmission line contingencies are considered. Compared to the traditional approach using a given set of components as candidates for possible failures, our approach considers all possible component failure scenarios. We consider the objectives of minimizing the total generation cost under the worst-case contingency scenario and/or the total pre-contingency cost. We formulate CCUC as a two-stage robust optimization problem and develop a decomposition framework to enable tractable computation. In our framework, the master problem makes unit commitment decisions and the subproblem discovers the worst-case contingency scenarios. By using linearization techniques and duality theory, we transform the subproblem into a mixed-integer linear program (MILP). The most violated inequalities generated from the subproblem are fed back into the master problem during each iteration. Our approach guarantees a globally optimal solution in a finite number of iterations. In reported computational experiments, we test both primal and dual decomposition approaches. Our computational results verify the effectiveness of our proposed approach. [ABSTRACT FROM PUBLISHER]

In response to the challenges brought by uncertain bus load and volatile wind power to power system security, this paper presents a novel unit commitment formulation based on interval number optimization to improve the security as well as economy of power system operation. By using full-scenario analysis, the worst-case impact of volatile node injection on unit commitment is acquired, so that the proposed model can always provide a secure and economical unit commitment result to the operators. Scenarios generation and reduction method based on interval linear programming theory are used to accelerate the solution procedure without loss of optimality. Benders decomposition is also implemented to reduce the complexity of this large-scale interval mixed integer linear programming, and prove the rationality and rigor of our proposed method. The numerical results indicate better secure and economical features of the proposed method comparing with the traditional one. [ABSTRACT FROM PUBLISHER]

This paper presents a new approach for the contingency-constrained single-bus unit commitment problem. The proposed model explicitly incorporates an n - K security criterion by which power balance is guaranteed under any contingency state comprising the simultaneous loss of up to K generation units. Instead of considering all possible contingency states, which would render the problem intractable, a novel method based on robust optimization is proposed. Using the notion of umbrella contingency, the robust counterpart of the original problem is formulated. The resulting model is a particular instance of bilevel programming which is solved by its transformation to an equivalent single-level mixed-integer programming problem. Unlike previously reported contingency-dependent approaches, the robust model does not depend on the size of the set of credible contingencies, thus providing a computationally efficient framework. Simulation results back up these conclusions. [ABSTRACT FROM PUBLISHER]