Abstract

In this work, an efficient formulation for the aggregation of multiple identical generating units for the mixed integer linear programming unit commitment problem is presented. To this end, as already done in literature identical units are clustered with a single integer variable defining the number of currently committed units. To correctly model the feasible aggregated ramp speed, a shifting generation level method with low computational effort is introduced, which is the main contribution of this work. In contrast to the reference binary formulation, the number of integer and continuous variables and constraints for the integer formulation does not scale with the number of aggregated units. Thus, depending on the UC problem, the computational effort can be drastically decreased, which is shown in test cases.

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.