Genetic-based unit commitment algorithm
Journal Article
·
· IEEE Transactions on Power Systems
- Iowa State Univ., Ames, IA (United States). Dept. of Electrical Engineering
This paper presents a new unit commitment scheduling algorithm. The proposed algorithm consist of using a genetic algorithm with domain specific mutation operators. The proposed algorithm can easily accommodate any constraint that can be true costed. Robustness of the proposed algorithm is demonstrated by comparison to a Lagrangian relaxation unit commitment algorithm on three different utilities. Results show the proposed algorithm finds good unit commitment schedules in a reasonable amount of computation time. Included in the appendix is an explanation of the true costing approach.
- OSTI ID:
- 390014
- Report Number(s):
- CONF-950727--
- Journal Information:
- IEEE Transactions on Power Systems, Journal Name: IEEE Transactions on Power Systems Journal Issue: 3 Vol. 11; ISSN ITPSEG; ISSN 0885-8950
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimization of the unit commitment problem by a coupled gradient network and by a genetic algorithm. Final report
A genetic algorithm solution to the unit commitment problem
A genetic algorithm for solving the unit commitment problem of a hydro-thermal power system
Technical Report
·
Thu Mar 31 23:00:00 EST 1994
·
OSTI ID:10142459
A genetic algorithm solution to the unit commitment problem
Journal Article
·
Wed Jan 31 23:00:00 EST 1996
· IEEE Transactions on Power Systems
·
OSTI ID:244732
A genetic algorithm for solving the unit commitment problem of a hydro-thermal power system
Journal Article
·
Sun Oct 31 23:00:00 EST 1999
· IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers)
·
OSTI ID:20013171