Scalable Distributed Optimization Combining Conic Projection and Linear Programming for Energy Community Scheduling

11Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

In this paper, a new method to address the scheduling problem of a renewable energy community while considering network constraints and users' privacy preservation is proposed. The method decouples the optimization solution into two interacting procedures: conic projection (CP) and linear programming (LP) optimization. A new optimal CP method is proposed based on local computations and on the calculation of the roots of a fourth-order polynomial for which a closed-form solution is known. Computational tests conducted on both 14-bus and 84-bus distribution networks demonstrate the effectiveness of the proposed method in obtaining the same quality of solutions compared with that by a centralized solver. The proposed method is scalable and has features that can be implemented on microcontrollers since both LP and CP procedures require only simple matrix-vector multiplications.

Cite

CITATION STYLE

APA

Dolatabadi, M., Borghetti, A., & Siano, P. (2023). Scalable Distributed Optimization Combining Conic Projection and Linear Programming for Energy Community Scheduling. Journal of Modern Power Systems and Clean Energy, 11(6), 1814–1826. https://doi.org/10.35833/MPCE.2022.000783

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free