Unit commitment problem is an optimization problem to determine the start-up and shut-down schedule of thermal units while satisfying various constraints, for example, generation-demand balance, unit minimum up/down time, system reserve, and so on. Since this problem involves a large number of 0–1 type variables that represent up/down status of the unit and continuous variables expressing generation output, it is a difficult combinatorial optimization problem to solve. The study at present concerns the method for requiring the suboptimum solution efficiently.
Unit commitment method widely used solves the problem without consideration of voltage, reactive power, and transmission constraints. In this paper, we will propose a solution of unit commitment with voltage and transmission constraints, based on the unit decommitment procedure (UDP) method, heuristic method, and optimal power flow (OPF). In this method, initial unit status will be determined from random numbers and the feasibility will be checked for minimum start-up/shut-down time and demand-generation balance. If the solution is infeasible, the initial solution will be regenerated until a feasible solution can be found. Next, OPF is applied for each time period with the temporary unit status. Then, the units that have less contribution to the cost are detected and will be shut down based on the unit decommitment rules. This process will be repeated until suboptimal solution is obtained.
The proposed method has been applied to the IEEE 118-bus test system with 36 generating units with successful result. © 2003 Wiley Periodicals, Inc. Electr Eng Jpn, 144(3): 36–45, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/eej.10187
[1]
J. J. Shaw,et al.
A direct method for security-constrained unit commitment
,
1995
.
[2]
Walter L. Snyder,et al.
Dynamic Programming Approach to Unit Commitment
,
1987,
IEEE Transactions on Power Systems.
[3]
D. Bertsekas,et al.
Solution of Large-Scale Optimal Unit Commitment Problems
,
1982,
IEEE Transactions on Power Apparatus and Systems.
[4]
Anastasios G. Bakirtzis,et al.
A genetic algorithm solution to the unit commitment problem
,
1996
.
[5]
Gerald B. Sheblé,et al.
Genetic-based unit commitment algorithm
,
1996
.
[6]
P. Luh,et al.
Nonlinear approximation method in Lagrangian relaxation-based algorithms for hydrothermal scheduling
,
1995
.
[7]
S. M. Shahidehpour,et al.
Unit commitment with transmission security and voltage constraints
,
1999
.
[8]
Hiroshi Sasaki,et al.
A solution method of unit commitment by artificial neural networks
,
1992
.
[9]
A. K. Ghosh,et al.
Distribution circuit state estimation using a probabilistic approach
,
1997
.
[10]
Hua Wei,et al.
An interior point nonlinear programming for optimal power flow problems with a novel data structure
,
1997
.
[11]
A. Merlin,et al.
A New Method for Unit Commitment at Electricite De France
,
1983,
IEEE Transactions on Power Apparatus and Systems.