TY - JOUR
T1 - Alternating direction method of multipliers for the optimal siting, sizing, and technology selection of Li-ion battery storage
AU - Sayfutdinov, Timur
AU - Ali, Mazhar
AU - Khamisov, Oleg
N1 - Publisher Copyright:
© 2020 Elsevier B.V.
PY - 2020/8
Y1 - 2020/8
N2 - The present paper addresses the problem of optimal siting, sizing, and technology selection of Li-ion battery storage, employing a mathematical programming approach. The methodology extends the state-of-the-art by considering a nonlinear degradation mechanism of Li-ion batteries from the state of charge, depth of discharge, and storage temperature. Particularly, Mixed-Integer Convex Programming (MICP) problem formulation has been proposed to consider a nonlinear degradation behaviour of Li-ion battery storage with a piecewise quadratic approximation to meet the convexity requirements. The main drawback of the piecewise approximation resides in the inclusion of integer variables what increases a computational burden significantly. For the particular problem, it may easily become intractable with the increase of network size and a number of storage technologies considered. To overcome the issue of tractability and scalability of the combinatorial problem, the MICP problem has been decomposed per energy storage unit and resolved using the Alternating Direction Method of Multipliers. Finally, a sensitivity analysis has been performed within the proposed framework to evaluate the performance value of second-life energy storage solutions.
AB - The present paper addresses the problem of optimal siting, sizing, and technology selection of Li-ion battery storage, employing a mathematical programming approach. The methodology extends the state-of-the-art by considering a nonlinear degradation mechanism of Li-ion batteries from the state of charge, depth of discharge, and storage temperature. Particularly, Mixed-Integer Convex Programming (MICP) problem formulation has been proposed to consider a nonlinear degradation behaviour of Li-ion battery storage with a piecewise quadratic approximation to meet the convexity requirements. The main drawback of the piecewise approximation resides in the inclusion of integer variables what increases a computational burden significantly. For the particular problem, it may easily become intractable with the increase of network size and a number of storage technologies considered. To overcome the issue of tractability and scalability of the combinatorial problem, the MICP problem has been decomposed per energy storage unit and resolved using the Alternating Direction Method of Multipliers. Finally, a sensitivity analysis has been performed within the proposed framework to evaluate the performance value of second-life energy storage solutions.
KW - Battery storage
KW - Mathematical programming
KW - Problem decomposition
UR - http://www.scopus.com/inward/record.url?scp=85084941517&partnerID=8YFLogxK
U2 - 10.1016/j.epsr.2020.106388
DO - 10.1016/j.epsr.2020.106388
M3 - Article
AN - SCOPUS:85084941517
SN - 0378-7796
VL - 185
JO - Electric Power Systems Research
JF - Electric Power Systems Research
M1 - 106388
ER -