Search

In this paper, we propose a distributed recharging rate control algorithm which combines the objectives of regulating frequency and improving the utilization of electric generators. An incentive policy \kappa is created that encourages electric vehicles (EVs) to demand energy when non-EV demand is low and electric generators are underutilized. EVs also act as frequency regulators which can control their participation role by modifying their respective payment rate wi. The proposed distributed recharging rate control algorithm can realize a Demand Management solution for EVs and does not require explicit real time communication from the electric generators or between the recharging sockets. A mechanism is presented that can trade off an ideal incentive policy with its approximation and enable the integration of the proposed controller with legacy protection system. Simulation is used to assess the algorithm and to highlight its embedded characteristics. [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]

This paper proposes an active-reactive power dispatch procedure that is expressed via a bilevel optimization problem whose upper and lower level criteria are, respectively, the minimum opportunity cost and minimum offered price of active power. It analyzes the impact of minimizing such criteria on system operation, and it investigates the behavior of marginal prices and opportunity costs and their use in mechanisms to compensate generators for power provision. The bilevel problem is solved using a version of interior point methods derived for mathematical programs with complementarity constraints. Results obtained with three test systems are analyzed. [ABSTRACT FROM PUBLISHER]

In this paper, a receding-horizon multi-step optimization is proposed to correct nonviable transmission voltages and prevent long-term voltage instability. The proposed control scheme is based on real-time control, inspired by model predictive control, and steady state power-flow-based equations. In order to anticipate load behavior and avoid using dynamic equations in the control scheme, explicit formulations are used to model evolution of load with time. The simulation results of the proposed technique are presented on the Nordic32 test system. [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]

The extensive installation of gas-fired power plants in many parts of the world has led electric systems to depend heavily on reliable gas supplies. The use of gas-fired generators for peak load and reserve provision causes high intraday variability in withdrawals from high-pressure gas transmission systems. Such variability can lead to gas price fluctuations and supply disruptions that affect electric generator dispatch, electricity prices, and threaten the security of power systems and gas pipelines. These infrastructures function on vastly different spatio-temporal scales, which prevents current practices for separate operations and market clearing from being coordinated. In this paper, we apply new techniques for control of dynamic gas flows on pipeline networks to examine day-ahead scheduling of electric generator dispatch and gas compressor operation for different levels of integration, spanning from separate forecasting, and simulation to combined optimal control. We formulate multiple coordination scenarios and develop tractable physically accurate computational implementations. These scenarios are compared using an integrated model of test networks for power and gas systems with 24 nodes and 24 pipes, respectively, which are coupled through gas-fired generators. The analysis quantifies the economic efficiency and security benefits of gas–electric coordination and dynamic gas system operation. [ABSTRACT FROM AUTHOR]

This letter proposes a methodology for finding the equilibrium point of a microgrid operating in a wide range of loading levels, which includes the possible exhaustion of the power reserve of some of the generating units. The search of the equilibrium would require the use of two different models when using Newton-Raphson-like methods. It is shown herein that the problem can be reformulated instead within the nonlinear constrained minimization framework by employing a complementarity condition. [ABSTRACT FROM PUBLISHER]