On Solving Unit Commitment with Alternating Current Optimal Power Flow on GPU
Abstract: We consider the unit commitment (UC) problem that employs the alternating current optimal power flow (ACOPF) constraints, which is formulated as a mixed-integer nonlinear programming problem and thus challenging to solve in practice. We develop a new scalable algorithm based on alternating direction method of multiplier (ADMM), which enables quickly finding a good feasible solution of the UC-ACOPF problem. Our algorithm employs the component-based decomposition that solves a large number of independent small subproblems, each of which represents an individual grid component (e.g., generator, bus, and transmission line), as well as the UC subproblem. We implement the algorithm in Julia, as part of the existing package \texttt{ExaAdmm.jl}, which can efficiently run on GPUs as well as CPUs. The numerical results are reported by using IEEE test instances.
- W. Sauer, “Uplift in RTO and ISO markets,” Federal Energy Regulatory Commision, Tech. Rep., 2014.
- A. Castillo, C. Laird, C. A. Silva-Monroy, J.-P. Watson, and R. P. O’Neill, “The unit commitment problem with AC optimal power flow constraints,” IEEE Transactions on Power Systems, vol. 31, no. 6, pp. 4853–4866, 2016.
- M. B. Cain, R. P. O’neill, A. Castillo et al., “History of optimal power flow and formulations,” Federal Energy Regulatory Commission, vol. 1, pp. 1–36, 2012.
- B. Kocuk, S. S. Dey, and X. A. Sun, “Strong SOCP relaxations for the optimal power flow problem,” Operations Research, vol. 64, no. 6, pp. 1177–1196, 2016.
- G. E. Constante-Flores, A. J. Conejo, and F. Qiu, “AC network-constrained unit commitment via relaxation and decomposition,” IEEE Transactions on Power Systems, vol. 37, no. 3, pp. 2187–2196, 2021.
- X. Bai and H. Wei, “Semi-definite programming-based method for security-constrained unit commitment with operational and optimal power flow constraints,” IET Generation, Transmission & Distribution, vol. 3, no. 2, pp. 182–197, 2009.
- J. Liu, C. D. Laird, J. K. Scott, J.-P. Watson, and A. Castillo, “Global solution strategies for the network-constrained unit commitment problem with AC transmission constraints,” IEEE Transactions on Power Systems, vol. 34, no. 2, pp. 1139–1150, 2018.
- Y. Kim, F. Pacaud, K. Kim, and M. Anitescu, “Leveraging GPU batching for scalable nonlinear programming through massive lagrangian decomposition,” arXiv preprint arXiv:2106.14995, 2021.
- Y. Kim and K. Kim, “Accelerated computation and tracking of AC optimal power flow solutions using GPUs,” in Workshop Proceedings of the 51st International Conference on Parallel Processing, 2022, pp. 1–8.
- D. A. Tejada-Arango, S. Wogrin, P. Sánchez-Martın, and A. Ramos, “Unit commitment with ACOPF constraints: Practical experience with solution techniques,” 2019 IEEE Milan PowerTech, pp. 1–6, 2019.
- S. Mhanna, G. Verbič, and A. C. Chapman, “Adaptive ADMM for distributed ac optimal power flow,” IEEE Transactions on Power Systems, vol. 34, no. 3, pp. 2025–2035, 2018.
- K. Sun and X. A. Sun, “A two-level ADMM algorithm for AC OPF with global convergence guarantees,” IEEE Transactions on Power Systems, vol. 36, no. 6, pp. 5271–5281, 2021.
- O. Kröger, C. Coffrin, H. Hijazi, and H. Nagarajan, “Juniper: An open-source nonlinear branch-and-bound solver in Julia,” in Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Springer International Publishing, 2018, pp. 377–386.
- S. Zeng, A. Kody, Y. Kim, K. Kim, and D. K. Molzahn, “A reinforcement learning approach to parameter selection for distributed optimal power flow,” Electric Power Systems Research, vol. 212, p. 108546, 2022.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.