Paul Kaufmann
ABSTRACT
In the domain of power grid systems, scheduling tasks are widespread. Typically, linear programming (LP) techniques are used to solve these tasks. For cases with high complexity, linear system modeling is often cumbersome. There, other modeling approaches allow for a more compact representation being typically also more accurate as non-linear dependencies can be captured natively.
In this work, we focus on the optimization of a power plant start-up sequence, which is part of the network restoration process of a power system after a blackout. Most large power plants cannot start on their own without cranking energy from the outside grid. These are the non-black start (NBS) units. As after a blackout we assume all power plants being shut down, self-contained power plants (black start (BS) units), such as the hydroelectric power plants, start first and boot the NBS units one after each other. Once a NBS unit is restored, it supports the restoration process and because an average NBS unit is much larger than a BS unit, NBS unit's impact on the restoration process is typically dominant. The overall restoration process can take, depending on the size of the blackout region and the damaged components, some hours to weeks. And as the blackout time corresponds directly to economic and life losses, its reduction, even by some minutes, is worthwhile.
In this work we compare two popular metaheuristics, the genetic (GA) and simulated annealing (SA) algorithms on start-up sequence optimization and conclude that an efficient restoration plan can be evolved reliably and, depending on the implementation, in a very short period of time allowing for an integration into a real-time transmission system operation tool.
- M. Bruch, V. Münch, M. Aichinger, M. Kuhn, M. Weymann, and G. Schmid. Power Blackout Risks. Allianz, 2011.Google Scholar
- J. Hou, Z. Xu, Z. Y. Dong, and K. P. Wong. Permutation-based Power System Restoration in Smart Grid Considering Load Prioritization. Electric Power Components and Systems, 42(3-4):361--371, 2014.Google ScholarCross Ref
- J. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992. Google ScholarDigital Library
- W. Liu and Z. Lin. Analysis and Optimization of the Preferences of Decision-Makers in Black-Start Group Decision-Making. IET Generation, Transmission & Distribution, 7:pp.14--23, 2012.Google ScholarCross Ref
- W. Liu, Z. Lin, and F. Wen. Intuitionistic Fuzzy Choquet Integral Operator-based Approach for Black-start Decision-making. IET Generation, Transmission & Distribution, 6:378--386, 2012.Google ScholarCross Ref
- New York Independent System Operator. Interim Report on the August 14, 2003 Blackout. Harvard Kennedy School, 2004.Google Scholar
- North American Rockwell Corporation and Edison Electric Institute. On-line Stability Analysis Study: RP90--1. North American Rockwell Information Systems Company, October 12, 1970.Google Scholar
- Power Systems Engineering Research Center. Selected Information About The July 31 Blackout in India Affecting the Northern and Eastern Regions. Arizona State University, 2012.Google Scholar
- C. Shen, P. Kaufmann, and M. Braun. A New Distribution Network Reconfiguration and Restoration Path Selection Algorithm. In Power Systems Computation Conference (PSCC). IEEE, 2014.Google ScholarCross Ref
- C. Shen, P. Kaufmann, and M. Braun. Optimizing the Generator Start-up Sequence After a Power System Blackout. In IEEE Power and Energy Society General Meeting (IEEE GM), 2014.Google ScholarCross Ref
- S. Wei and L. Chen-Ching. Optimal Generator Start-Up Strategy for Bulk Power System Restoration. IEEE Transactions on Power Systems, 26(3):1357--1366, 2011.Google ScholarCross Ref
- S. Zeng, Z. Lin, and F. Wen. A New Approach for Power System Black-Start Decision-Making With Vague Set Theory. International Journal of Electrical Power & Energy Systems, 34:114--120, 2012.Google ScholarCross Ref
Index Terms
- Generator Start-up Sequences Optimization for Network Restoration Using Genetic Algorithm and Simulated Annealing
Recommendations
Comparison of a genetic algorithm and simulated annealing in an application to statistical image reconstruction
Genetic algorithms (GAs) are adaptive search techniques designed to find near-optimal solutions of large scale optimization problems with multiple local maxima. Standard versions of the GA are defined for objective functions which depend on a vector of ...
Development of a parallel optimization method based on genetic simulated annealing algorithm
This paper presents a parallel genetic simulated annealing (PGSA) algorithm that has been developed and applied to optimize continuous problems. In PGSA, the entire population is divided into sub-populations, and in each sub-population the algorithm ...
Genetic algorithms to solve the power system restoration planning problem
This study reports the use of a Genetic Algorithm (GA) to solve the Power System Restoration Planning Problem (PSRP). The solution to the PSRP is described by a series of operations or a plan to be used by the Power System operator immediately on the ...
Comments