Abstract

This paper presents an improved priority list and neighborhood search (IPL-NS) method for ramp rate constrained unit commitment (RUC). The IPL-NS consists of two steps. At the first step, an IPL based on a mixed integer linear programming (MILP) formulation for UC is proposed to get unit status for UC without ramp rate constraints. At the second step, a neighborhood search (NS) algorithm based on three neighborhoods is produced to get unit status for RUC. The IPL-NS approach is applied to solve several popular test systems of up to 1000 units and the simulation results confirm the superiority of the proposed method. At the same time, the numerical results show that the proposed IPL can commit the most economic unit first much better than other existing PL methods. The results also indicate that the presented NS can handle the ramp rate constraints efficiently.

Full Text
Paper version not known

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 call

Disclaimer: 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.