This paper deals with the problem of optimal allocation (siting and sizing) of storage resources in unbalanced three-phase low voltage microgrids. The siting and sizing problem is formulated as a mixed, non-linear, constrained optimization problem whose objective function deals with economic issues and whose constraints involve technical limitations of both network and distributed resources. Emphasis is given to the power quality issue with particular attention to unbalance reduction and voltage profile improvement. Technological issues, such as those related to the preservation of batteries’ lifetime, were also taken into account. The planning problem is solved by means of a genetic algorithm which includes an inner algorithm based on sequential quadratic programming. In order to limit the processing time while maintaining reasonable accuracy, the genetic algorithm search space is significantly reduced identifying a subset of candidate buses for the siting of the storage resources. The Inherent Structure Theory of Networks and the Loading Constraints Criterion were used to identify the candidate buses. The proposed method has been applied to a low voltage test network demonstrating the effectiveness of the procedure in terms of computational burden while also preserving the accuracy of the solution.
A Hybrid Method for Optimal Siting and Sizing of Battery Energy Storage Systems in Unbalanced Low Voltage Microgrids
Varilone, Pietro
2018-01-01
Abstract
This paper deals with the problem of optimal allocation (siting and sizing) of storage resources in unbalanced three-phase low voltage microgrids. The siting and sizing problem is formulated as a mixed, non-linear, constrained optimization problem whose objective function deals with economic issues and whose constraints involve technical limitations of both network and distributed resources. Emphasis is given to the power quality issue with particular attention to unbalance reduction and voltage profile improvement. Technological issues, such as those related to the preservation of batteries’ lifetime, were also taken into account. The planning problem is solved by means of a genetic algorithm which includes an inner algorithm based on sequential quadratic programming. In order to limit the processing time while maintaining reasonable accuracy, the genetic algorithm search space is significantly reduced identifying a subset of candidate buses for the siting of the storage resources. The Inherent Structure Theory of Networks and the Loading Constraints Criterion were used to identify the candidate buses. The proposed method has been applied to a low voltage test network demonstrating the effectiveness of the procedure in terms of computational burden while also preserving the accuracy of the solution.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.