Application of Artificial Bee Colony Method for Unit Commitment

In this paper, Security Constrained Unit Commitment (SCUC) problem with combined Thermal- Solar generating units is solved using Artificial Bee Colony (ABC) algorithm. SCUC problem aims to obtain minimum generation cost while satisfying the system, network and security constraints. The SCUC problem is divided into Unit Commitment Problem (UCP) which is considered as the master problem and Security Constrained Economic Dispatch (SCED) is considered as the sub problem. Here, both thermal and solar generations are considered in UCP and SCED solutions. Binary Coded ABC Algorithm is used to solve the UCP and Real Coded ABC Algorithm is used for solving the SCED problem. The constraints such as spinning reserves, hourly load demands, ramp up/ramp down limits of generators, minimum up/down limits, line flow and voltage limits are considered in the problem formulation. Beta distribution function is employed to forecast the solar power generation in different seasons. The comparison is carried out with and without incorporating solar generation. The proposed method is validated on a 6 bus system and a South Indian 86 bus utility.

Unit commitment (UC) plays a key role in power system operation and control. This paper deals with UC problem using hybrid Priority List (PL) method. Evolution Programming (EP), Hybrid Evolution Programming (HEP) and Gbest based Artificial Bee Colony (ABC) optimization algorithms are applied to 10 thermal unit system and are executed to achieve minimum operating cost by optimal scheduling of thermal units over a scheduled period. It is found from the comparison of these three algorithms that the Gbest based Artificial Bee Colony (ABC) yields the best optimum solution.

A novel projected two-binary-variable formulation for unit commitment in power systems

Mushrooms are food ingredient that is currently favored by the public. Seeing the large demand for mushrooms, many mushroom businesses have developed. The high level of demand for mushrooms by consumers in different locations results in the high time and costs spent in distributing mushrooms. In addition, determining distribution routes in mushroom marketing is still done manually based on the sender's knowledge, therefore reduces the effectiveness and efficiency of mushroom marketing because the distribution routes used are not optimal. To overcome these problems, it is necessary to determine an effective and efficient distribution route to reduce distribution costs and speed up distribution time. Based on these problems, this research uses the Artificial Bee Colony (ABC) method in determining the distribution route of mushroom harvest. The purpose of this study was to apply the ABC method in determining the distribution routes of mushroom harvest. The result of this research is a visualization of mushroom distribution routes using the ABC method, so it can help to distribute mushroom harvest effectively and efficiently. The research method consists of defining the problem, collecting data, analyzing systems and implementing methods, designing systems, building systems, and drawing conclusions.

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.

This paper presents a new approach of particle swarm optimization (PSO) algorithm for short term hydro thermal scheduling (HTS) problems. Various possible particle selections have been studied and its effects on the global optima have been discussed. The effectiveness and stochastic nature of proposed algorithm has been tested with standard test case and the results have been compared with earlier works. This paper also describes software developed for short term hydro-thermal scheduling by considering hydro economic dispatch and thermal unit commitment. The proposed algorithm is ideally suitable for hydro-thermal co-ordination problems, hydro economic dispatch problems with unit commitment, thermal economic dispatch with unit commitment problems and scheduling of hydraulically coupled plants.

This paper presents the solving unit commitment (UC) problem using Modified Subgradient Method (MSG) method combined with Simulated Annealing (SA) algorithm. UC problem is one of the important power system engineering hard-solving problems. The Lagrangian relaxation (LR) based methods are commonly used to solve the UC problem. The main disadvantage of this group of methods is the difference between the dual and the primal solution which gives some significant problems on the quality of the feasible solution. In this paper, MSG method which does not require any convexity and differentiability assumptions is used for solving the UC problem. MSG method depending on the initial value reaches zero duality gap. SA algorithm is used in order to assign the appropriate initial value for MSG method. The major advantage of the proposed approach is that it guarantees the zero duality gap independently from the size of the problem. In order to show the advantages of this proposed approach, the four-unit Tuncbilek thermal plant and ten-unit thermal plant which is usually used in literature are chosen as test systems. Penalty function (PF) method is also used to compare with our proposed method in terms of total cost and UC schedule.

A thermal unit commitment (UC) computer program has been used at the Riyadh Energy Control Centre of Saudi Consolidated Electric Company, Central Region, (SCECO Central) since 1982. Since then, system growth, plant aging, turbine degradation, ambient temperature effect on unit output, transmission constraints (line loading), MVAr/voltage control problem at light loads, and stringent operating requirements (spinning reserve, etc.) have imposed many constraints on the program, making it nearly impossible to produce a generation allocation schedule that is acceptable to system operators. A study undertaken to decide what should be done with the UC program and how the operator could be supplied with a daily generation schedule that is sufficiently accurate and practically feasible is described. Because it was not feasible to provide a new unit commitment program or to modify the existing one, it was decided to tailor the unit commitment input dataset such that the constraints are appropriately represented. In addition, it was decided to write a suite of computer programs (UCPROG) in FORTRAN that would process necessary input data and results of the UC program to achieve a more realistic, detailed, but precise unit allocation schedule.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

This paper proposes an innovative genetic algorithm (GA) approach to solve the thermal unit commitment (UC) problem in power generation industry through a constraint satisfaction technique. Due to a large variety of constraints to be satisfied, the solution space of the UC problem is highly nonconvex, and therefore the UC problem can not be solved efficiently by the standard GA. To effectively deal with the constraints of the problem and greatly reduce the search space of the GA, the minimum up- and down-time constraints are embedded in the binary strings that are coded to represent the on-off states of the generating units. The violations of the other constraints are handled by integrating penalty factors into the cost function. Numerical results on the practical Taiwan Power (Taipower) system of 38 thermal units over a 24-hour period show that the features of easy implementation, fast convergence, and highly near-optimal solution in solving the UC problem can be achieved by the proposed GA approach. >

Evaluating the impact of sub-hourly unit commitment method on spinning reserve in presence of intermittent generators

Unit commitment is an efficient method to lower the total cost of the power plant by scheduling units' generation and meeting the constraint condition. However, in practice, few power plants implement the algorithm for fear that the load response in the power plant would not be fast enough to track the unscheduled load demand from the power grid if some units of the power plant are shut down. This paper proposes a new unit commitment method that tries to solve this problem effectively. The proposed method guarantees the desired speed limit by setting the plant-level load tracking speed. In this method a ‘one-at-a-time’ unit commitment is accomplished. The most expensive unit (which is determined by computing its cost) is optimized, the unit commitment schedule is updated, and the load dispatch result is re-computed. The result will be repeatedly optimized until the spinning reserve or load tracking speed is lack. The optimization loop will breaks out as well if the unit schedules of two consecutive iterations over the time period remain unchanged. The test results from 10-machine system shows that the proposed method is easy to understand and quick to solve, and is of practical use.

A fuzzy optimization-based approach to large scale thermal unit commitment

This paper presents centralized control for a wind farm using model predictive control (MPC) method. In order to solve intra-day unit commitment (UC) problem, the UC problem is solved by using the MPC method with short-term wind power forecasting. We introduce a new dynamics model for the UC with some constraints to utilize the benefits of the MPC method. The objective function considering the operation and maintenance costs is formulated by adding a new variable in order to average the operating time of each wind turbine (WT) within the whole time. The proposed method could solve the UC problems on-line using the prediction time horizon that could be selected flexibly considering time horizon based on wind power forecasting errors. From the simulation study using 10 WTs, we observed that the proposed dynamics model of UC effectively provided the optimal solution to each scenario. Numerical study will validate that the proposed method can be applied to solving the UC problem of a large scale wind farm by aggregating WTs.

Capacitor Banks provide reactive power to improve voltage levels and will minimize power losses in the electric power system. In the South Sulawesi electric power system there are variations of buses so that the capacitor installed really needs to optimize the location and capacity of the capacitor. The Artificial Bee Colony (ABC) method is used in determining the location and magnitude of the compensator (capacitor bank) on the 150 kV high voltage transmission system in South Sulawesi. The purpose of this use is to determine the ability of ABC as a solution to the optimization method for improving voltage levels and minimizing power losses in high voltage transmissions. There are 7 scenarios carried out in this research, scenarios 2, 3, and 4 using conventional methods, scenarios 5 to 7 applying the ABC method. The results of these 6 scenarios are an increase in the voltage on the bus and the minimization of power losses in the South Sulawesi system. And the ABC method optimizes the operation of the electric power system.

A short-term fuel-constrained thermal unit commitment method which includes significant constraints such as take-or-pay gas contracts and limitations associated with the gas delivery system is described. The fuel constraints are explicitly considered in determining the short-term (e.g., daily, weekly) thermal unit commitment strategy. The method results from the extension of a novel iterative approach consisting of two phases: a sequential commitment phase and a parameter adjustment phase. The method is effective in both its computational requirements and its solution quality. Illustrative examples are presented. >