A solution of unit commitment with transmission and voltage constraints by heuristic method and optimal power flow
Authors:
- T. YamamotoTYT. Yamamoto
- J. KubokawaJKJ. Kubokawa
- T. NagataTNT. Nagata
- H. FujitaHFH. Fujita
- 11 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 357-362
Abstract
In this paper, a heuristic algorithm combined with OPF is proposed for short-term unit commitment problem with transmission and voltage constraints. Being a very complicated combinatorial optimization problem, unit commitment is very difficult to solve, especially, for large-scale power system with network constraints. We have proposed a heuristic algorithm based on the average full load cost without network constraints. In this study, we propose a solution of unit commitment problem with network constraints using combination of heuristic algorithm and OPF. The proposed algorithm has been applied to the IEEE 118 test system with 36 generators over a 24-h period. The result shows that the proposed algorithm is capable of obtaining satisfactory schedules without any constraint violation.Keywords
This publication has 10 references indexed in Scilit:
- Unit commitment with transmission security and voltage constraintsIEEE Transactions on Power Systems, 1999
- An interior point nonlinear programming for optimal power flow problems with a novel data structureIEEE Transactions on Power Systems, 1998
- A genetic algorithm solution to the unit commitment problemIEEE Transactions on Power Systems, 1996
- Genetic-based unit commitment algorithmIEEE Transactions on Power Systems, 1996
- Nonlinear approximation method in Lagrangian relaxation-based algorithms for hydrothermal schedulingIEEE Transactions on Power Systems, 1995
- A solution method of unit commitment by artificial neural networksIEEE Transactions on Power Systems, 1992
- Dynamic Programming Approach to Unit CommitmentIEEE Transactions on Power Systems, 1987
- A New Method for Unit Commitment at Electricite De FranceIEEE Transactions on Power Apparatus and Systems, 1983
- A Branch-and-Bound Algorithm for Unit CommitmentIEEE Transactions on Power Apparatus and Systems, 1983
- Solution of Large-Scale Optimal Unit Commitment ProblemsIEEE Transactions on Power Apparatus and Systems, 1982