共 50 条
Risk-based stochastic day-ahead operation for data centre virtual power plants
被引:14
|作者:
Zhang, Haifeng
[1
,2
]
Xu, Ting
[1
]
Wu, Hongyu
[2
]
Liu, Bo
[2
]
Faqiry, M. Nazif
[2
]
机构:
[1] Shanghai Univ Engn Sci, Sch Mech & Automot Engn, 333 Longteng Rd, Shanghai 201620, Peoples R China
[2] Kansas State Univ, Dept Elect & Comp Engn, 1707D Platt St, Manhattan, KS 66506 USA
基金:
中国国家自然科学基金;
关键词:
pricing;
stochastic programming;
power generation scheduling;
integer programming;
scheduling;
computer centres;
power generation economics;
linear programming;
distributed power generation;
renewable energy sources;
electricity prices;
risk level;
water price;
optimal day-ahead schedules;
risk-based stochastic day-ahead operation;
virtual power plant;
data centres;
increasing demand;
cloud services;
water consumption;
DC operating costs;
grid-connected mode;
day-ahead operation problem;
two-stage stochastic mixed integer linear programming model;
DEMAND RESPONSE;
WORKLOAD MANAGEMENT;
ENERGY;
STRATEGY;
RESERVE;
D O I:
10.1049/iet-rpg.2018.5736
中图分类号:
X [环境科学、安全科学];
学科分类号:
08 ;
0830 ;
摘要:
Data centres (DCs) have rapidly expanded in recent years due to increasing demand for cloud services. The costs incurred by electricity and water consumption contribute to a major portion of DC operating costs. This article addresses the day-ahead operation of a DC in the context of a virtual power plant (VPP) under the grid-connected mode. The day-ahead operation problem is formulated as a two-stage stochastic mixed integer linear programming (MILP) model that considers workload schedules among server clusters, water consumption, and uncertainties of onsite renewable energy and electricity prices. In addition, the conditional value at risk (CVaR) is utilised to manage the risk caused by various uncertainties that challenge DCs, especially electricity prices. The impacts of the risk level, the water price, and uncertainty on the day-ahead operation of the DC are studied. The numerical test results show that the proposed model can efficiently generate optimal day-ahead schedules.
引用
收藏
页码:1660 / 1669
页数:10
相关论文