Energy-Workload Coupled Migration Optimization Strategy for Virtual Power Plants with Data Centers Considering Fuzzy Chance Constraints
Jia-Kai Wu, Zhi-Wei Liu, Yong Zhao, Yan-Wu Wang, Fan-Rong Qu, Chaojie Li
TL;DR
The paper tackles precise demand response for CDL-based DR by jointly optimizing energy sharing and workload migration across a network of geo-distributed data centers within a virtual power plant. It develops an antisymmetric bidirectional migration framework, converts fuzzy chance constraints into deterministic equivalents to obtain a tractable SOCP formulation, and employs a distributed ADMM solver to handle high-dimensional coupling. An improved Shapley-value-based profit allocation balances fairness and scalability, with a VPPO intermediary reducing computation from exponential to linear in the number of VPPs. Simulations on Google's DC data demonstrate improved CDL tracking and reduced operational costs, validating the approach’s scalability and practical relevance for large-scale VPP-DC partnerships.
Abstract
This paper proposes an energy-workload coupled migration optimization strategy for virtual power plants (VPPs) with data centers (DCs) to enhance resource scheduling flexibility and achieve precise demand response (DR) curve tracking. A game-based coupled migration framework characterized by antisymmetric matrices is first established to facilitate the coordination of cross-regional resource allocation between VPPs. To address the challenge posed to conventional probabilistic modeling by the inherent data sparsity of DC workloads, deterministic equivalent transformations of fuzzy chance constraints are derived based on fuzzy set theory, and non-convex stochastic problems are transformed into a solvable second-order cone program. To address the multi-player interest coordination problem in cooperative games, an improved Shapley value profit allocation method with the VPP operator as intermediary is proposed to achieve a balance between theoretical fairness and computational feasibility. In addition, the alternating direction method of multipliers with consensus-based variable splitting is introduced to solve the high-dimensional non-convex optimization problem, transforming coupled antisymmetric constraints into separable subproblems with analytical solutions. Simulations based on real data from Google's multiple DCs demonstrate the effectiveness of the proposed method in improving DR curve tracking precision and reducing operational costs.
