A New Peak-Shaving Model Based on Mixed Integer Linear Programming with Variable Peak-Shaving Order

Abstract

Peak-shaving is a very efficient and practical strategy for a day-ahead hydropower scheduling in power systems, usually aiming to appropriately schedule hourly (or in less time interval) power generations of individual plants so as to smooth the load curve while enforcing the energy production target of each plant. Nowadays, the power marketization and booming development of renewable energy resources are complicating the constraints and diversifying the objectives, bringing challenges for the peak-shaving method to be more flexible and efficient. Without a pre-set or fixed peak-shaving order of plants, this paper formulates a new peak-shaving model based on the mixed integer linear programming (MILP) to solve the scheduling problem in an optimization way. Compared with the traditional peak-shaving methods that need to determine the order of plants to peak-shave the load curve one by one, the present model has better flexibility as it can handle the plant-based operating zones and prioritize the constraints and objectives more easily. With application to six cascaded hydropower reservoirs on the Lancang River in China, the model is tested efficient and practical in engineering perspective.

Keywords

• peak-shaving
• short-term scheduling
• mixed integer linear programming (MILP)
• Lancang hydropower cascade