Heuristic multi-area unit commitment with economic dispatch

Stochastic Hopfield artificial neural network for unit commitment and economic power dispatch

The Economic Dispatch (ED) is one of the most important optimization problems in power systems the ultimate goal of the ED is to minimize the cost of operations in a power generation. In this paper, the Woodpecker Mating Algorithm (WMA) is used to solve the ED problem considering the nonlinear properties of generators such as valve point effects (VPE), prohibited operating zones (POZ), ramp rate limits, multiple fuel options, and transmission loss. The WMA algorithm is a novel metaheuristic algorithm inspired by the mating behavior of woodpeckers and sound intensity (a physical quantity). The WMA is implemented on six test systems of different operational dimensions and characteristics to show its capacity for solving the ED problem. The results are compared with the latest and most efficient methods introduced in the literature. Proving the efficiency of the WMA to solve the ED problem, simulation results are promising and offer the optimal fuel cost of production.

Coordinated scheduling of generators and tie lines in multi-area power systems under wind energy uncertainty

This paper deals with the so-called general machine scheduling problems. In the general machine scheduling problems, job shop type jobs and open shop type jobs are scheduled together and the imposition of precedence constraints is allowed between operations belonging to either the same job or different jobs. This paper proposes a genetic algorithm to solve such general machine scheduling problems. Some experimental results are presented to show the applicability of the proposed method. The method can be used to solve traditional job shop scheduling, flow shop scheduling, and open shop scheduling as well as general machine scheduling problems.

Economic load dispatch is one of the optimization problems in power systems. This paper presents an improved genetic algorithm for economic load dispatch with valve-point loadings. New crossover and mutation operations are introduced. The solutions of the economic load dispatch with valve-point loadings under three cases are solved by the improved genetic algorithm. Test results are given and compared with those from different published genetic algorithms. It is shown that the proposed improved genetic algorithm performs better than the published genetic algorithms.

The authors present a thermal unit commitment method for interconnected multiarea power systems. The method is a natural extension of the commitment utilization factor (CUF)-based single-area unit commitment method. CUF is extended to reflect the impact of multiarea transmission interconnection constraints on the utilization efficiency of committing a candidate unit at a given priority position. The multiarea CUF is used in conjunction with the average full load cost. (AFLC) to efficiently determine the optimal or a near-optimal multiarea priority commitment order. This priority order is then used to generate the multiarea unit commitment schedule. The excellent quality of the results of the CUF-based multiarea method is consistent with that of the previously reported single-area method.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

In traditional electricity market unit commitment (UC) is done only for the reduction of operating cost. In the deregulated electricity market, for a secure and economical hourly generation schedule of the day ahead market, independent system operator (ISO) executes the security constrained unit commitment (SCUC) problem. The objective of the paper is to develop scheduling algorithm using hybrid particle swarm optimization (PSO) for electric generation that accounts directly for system security requirements. The proposed SCUC formulation includes constraints, such as hourly power demand, system reserves, ramp up/down limits, minimum ON/OFF duration limits. The innovation of our approach is to capture the system security requirements within a network flow sub-problem that is solved in conjunction with the unit commitment problem. To solve such SCUC model, a binary coded particle swarm optimization (BPSO) is used for unit commitment master problem and real coded particle swarm optimization (RPSO) is used for the economic dispatch sub-problem. The effectiveness of the suggested method to solve the SCUC problem is validated on different test systems.

Approximations made in traditional day-ahead unit commitment model formulations can result in suboptimal or even infeasible schedules for slow-start units and inaccurate predictions of actual costs and wind curtailment. With increasing wind penetration, these errors will become economically more significant. Here, we consider inaccuracies from three approximations: the use of hourly intervals in which energy production from each generator is modeled as being constant; the disregarding of startup and shutdown energy trajectories; and optimization based on expected wind profiles. The results of unit commitment formulations with those assumptions are compared to models that: (1) use a piecewise-linear power profiles of generation, load and wind, instead of the traditional stepwise energy profiles; (2) consider startup/shutdown trajectories; and (3) include many possible wind trajectories in a stochastic framework. The day-ahead hourly schedules of slow-start generators are then evaluated against actual wind and load profiles using a model real-time dispatch and quick-start unit commitment with a 5min time step. We find that each simplification usually causes expected generation costs to increase by several percentage points, and results in significant understatement of expected wind curtailment and, in some cases, load interruptions. The inclusion of startup and shutdown trajectories often yielded the largest improvements in schedule performance.

The authors propose an algorithm to consider the ramp characteristics in starting up and shutting down the generating units as well as increasing and decreasing power generation. They consider the inclusion of ramping constraints in both unit commitment and economic dispatch. Since implementing ramp-rate constraints is a dynamic process, dynamic programming (DP) is a proper tool to treat this problem. To overcome the computational expense which is the main drawback of DP, this study initially employs artificial intelligence techniques to produce a unit commitment schedule which satisfies all system and unit operation constraints except unit ramp-rate limits. Then, a dynamic procedure is used to consider the ramp properties as units are started up and shut down. According to this adjustment, maximum generating capabilities of units will change the unit operation status instead of following a step function. Finally, a dynamic dispatch procedure is adopted to obtain a suitable power allocation which incorporates the unit generating capability information given by unit commitment and unit ramping constraints, as well as the economical considerations. Two examples are presented to demonstrate the efficiency of the method. >

Using suitable solution techniques to the unit commitment (UC) and economic load dispatch (ELD) problems play major role on finding an optimal power scheduling in electrical power system. The UC and ELD problems are to decide when and which generating units to commit and decommit, in order to minimize the total fuel cost over specified period subject to a large number of difficult constraints. Lagrangian relaxation (LR) has been widely used to solve UC and ELD. Recently bundling method (BM) has appeared to be one of the best multipliers updated techniques for LR. This method has promising and the fastest convergence characteristics for UC and ELD problems. For that reason, this paper is to solve the UC and ELD problems via LR, BM and interior point method. This paper explores also the best possible way of updating Lagrangian multipliers with minimum computation time using fast programming techniques.

In recent years, high penetration of variable generating sources, such as wind power, has challenged independent system operators (ISO) in keeping a cheap and reliable power system operation. Any deviation between expected and real wind production must be absorbed by the power system resources (reserves), which must be available and ready to be deployed in real time. To guarantee this resource availability, the system resources must be committed in advance, usually the day-ahead, by solving the so-called unit commitment (UC) problem. If the quantity of committed resources is extremely low, there will be devastating and costly consequences in the system, such as significant load shedding. On the other hand, if this quantity is extremely high, the system operation will be excessively expensive, mainly because facilities will not be fully exploited. This thesis proposes computationally efficient models for optimal day-ahead planning in (thermal) power systems to adequately face the stochastic nature of wind production in the real-time system operation. The models can support ISOs to face the new challenges in short-term planning as uncertainty increases dramatically due to the integration of variable generating resources. This thesis then tackles the UC problem in the following aspects: Power system representation: This thesis identifies drawbacks of the traditional energy-block scheduling approach, which make it unable to adequately prepare the power system to face deterministic and perfectly known events. To overcome those drawbacks, we propose the ramp-based scheduling approach that more accurately describes the system operation, thus better exploiting the system flexibility. UC computational performance: Developing more accurate models would be pointless if these models considerably increase the computational burden of the UC problem, which is already a complex integer and non-convex problem. We then devise simultaneously tight and compact formulations under the mixed-integer programming (MIP) approach. This simultaneous characteristic reinforces the convergence speed by reducing the search space (tightness) and simultaneously increasing the searching speed (compactness) with which solvers explore that reduced space. Uncertainty management in UC: By putting together the improvements in the previous two aspects, this thesis contributes to a better management of wind uncertainty in UC, even though these two aspects are in conflict and improving one often means harming the other. If compared with a traditional energy-block UC model under the stochastic (deterministic) paradigm, a stochastic (deterministic) ramp-based UC model: 1) leads to more economic operation, due to a better and more detailed system representation, while 2) being solved significantly faster, because the core of the model is built upon simultaneously tight and compact MIP formulations. To further improve the uncertainty management in the proposed ramp-based UC, we extend the formulation to a network-constrained UC with robust reserve modelling. Based on robust optimization insights, the UC solution guarantees feasibility for any realization of the uncertain wind production, within the considered uncertainty ranges. This final model remains as a pure linear MIP problem whose size does not depend on the uncertainty representation, thus avoiding the inherent computational complications of the stochastic and robust UCs commonly found in the literature.

Hybrid artificial algae algorithm for economic load dispatch

This chapter describes and formulates three important problems for the economic management of power systems, namely, the Unit Commitment (UC), the Economic Dispatch (ED), and the Network Constrained Unit Commitment (NCUC) problems. The UC problem determines the commitment of generating units with the aim of minimizing operating costs while supplying the demand and meeting technical and security constraints. Then, once the commitment of generating units is decided, the ED problem determines the actual power output of each generating unit that is needed to supply all demands at minimum cost, while complying with the technical constraints of the transmission network. Finally, if both the commitment of generating units and transmission constraints are considered simultaneously, the resulting problem is known as the NCUC problem. These three problems are mostly considered in electricity markets throughout the US.

The paper describes a procedure developed to assist a generating company in choosing the most convenient bidding strategies for a day-ahead electricity energy market. According to the proposed method, the profit maximization problem is transformed into a minimization problem that can be solved by a traditional hydro-thermal unit commitment program after implementing a few modifications. The paper describes the modifications introduced in a unit commitment program based on the Lagrangian relaxation approach and on a disaggregated Bundle method for the solution of the dual problem. It also presents some results obtained for a realistic data set of hydrothermal power plants. The results are discussed in order to emphasize how the method can be applied to assess the bidding strategy choice of a given company.

ABSTRACTWe use Monte Carlo analysis to examine the potential of increased renewable generation to provide a hedge against variability in energy prices and costs. Fuel costs, electricity demand and wind generation are allowed to vary and a unit commitment and economic dispatch algorithm is employed to produce cost-minimizing generation schedules under different levels of installed wind capacity. Increased wind capacity reduces the mean and the variance of production costs but only the variance of electricity prices. Wind generators see their market revenues increase while consumer payments and fossil generator profits do not considerably vary as wind capacity increases. Risk aversion is captured by considering the conditional value-at-risk for both consumers and producers. The optimal level of wind generation increases as risk aversion increases due to the potential of wind to act as a hedge against very high electricity prices in high fuel price scenarios.