A method is presented for solution of the generation unit commitment problem. The binary search is structured to allow incorporation of an existing dispatch algorithm. An example is presented illustrating the method's speed advantage over the branch and bound technique when an initial upper bound is not known.
Get full access to this article
View all access options for this article.
References
1.
LoweryP. G., ‘Generating unit commitment by dynamic programming’, IEEE Trans., PAS-85, pp. 422–426 (1966).
2.
DillonT. S.EdwinK. W.KochsH.-D. and TaudR. J., ‘Integer programming approach to the problem of optimal unit commitment with probabilistic reserve determination’, IEEE Trans., PAS-97, pp. 2154–2163 (1978).
3.
HamamK.HamamY. M.HindiK. S. and BramellerA., ‘Unit commitment of thermal generation’, IEE Proc., 127C, pp. 3–8 (1980).
4.
BondS. D. and FoxB., ‘Constraint directed search technique for generating unit commitment’, 19th UPEC, University of Dundee (April, 1984).
5.
StottB. and MarinhoJ. L., ‘Linear programming for power system security applications’, IEEE Trans., PAS-98, pp. 837–847 (1979).
