Abstract
This paper proposes a simulated annealing algorithm combined with a dynamic economic dispatch to consider the ramp rate constraints in the unit commitment problem. Simulated annealing is used for the scheduling of the generating units, while the economic load dispatch is performed dynamically through a quadratic programming routine. The inclusion of ramp rates is achieved by performing either a backward or a forward sequence of conventional economic dispatches with modified limits on the generators, depending on the candidate solution (schedule) provided by the simulated annealing algorithm. The proposed algorithm provides feasible near optimal solutions in reasonable time. Numerical simulations have proved the effectiveness of the proposed model.
Sign-in/Register to access full text options 
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.
