Referenced Items are not available for this document.
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 electric 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
Published in:
Power Systems, IEEE Transactions on
(Volume:11
,
Issue:
3
)
Date of Publication: Aug 1996
- Page(s):
- 1359 - 1370
- ISSN :
- 0885-8950
- INSPEC Accession Number:
- 5372435
- Digital Object Identifier :
- 10.1109/59.536120
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Aug 1996
- Sponsored by :
- IEEE Power & Energy Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
