Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
