As an aggregator of distributed energy resources (DERs) such as distributed generator, energy storage, and load, the virtual power plant (VPP) enables these small DERs participating in system operation. One of the critical issues is how to aggregate DERs to form VPPs appropriately. To improve the controllability and reduce the operation cost of VPP, the complementary DERs with close electrical distances should be aggregated in the same VPP. In this paper, it is formulated as an optimal network partition model for minimizing the voltage deviation inside VPPs and the fluctuation of injection power at the point of common coupling (PCC). A new convex formulation of network reconfiguration strategy is incorporated in this approach which can guarantee the components of the same VPP connected and further improve the performance of VPPs. The proposed approach is cast as an instance of mixed-integer linear programming (MILP) and can be effectively solved. Moreover, a scenario reduction method is developed to reduce the computation burden based on the k-shape algorithm. Numerical tests on the 13-bus and 70-bus distribution networks justify the effectiveness of the proposed approach.

中文翻译：

---

考虑网络重构的虚拟电厂最优汇聚方法

作为分布式能源（DER）（例如分布式发电机，能源存储和负载）的聚集器，虚拟电厂（VPP）使这些小型DER参与系统运行。关键问题之一是如何聚合DER以适当地形成VPP。为了提高VPP的可控性并降低其运行成本，应在同一VPP中汇总电气距离较近的互补DER。在本文中，将其制定为最佳网络分区模型，以最小化VPP内部的电压偏差和在公共耦合点（PCC）处注入功率的波动。这种方法采用了新的网络重构策略的凸形式，可以保证连接同一VPP的组件，并进一步提高VPP的性能。所提出的方法是混合整数线性规划（MILP）的实例，可以有效解决。此外，基于k形算法，开发了一种减少场景的方法来减少计算负担。在13总线和70总线配电网络上进行的数值测试证明了该方法的有效性。