Papers › New efficient ADMM algorithm for the Unit Commitment Problem
New efficient ADMM algorithm for the Unit Commitment Problem
Rogier Hans Wuijts, Marjan van den Akker, Machteld van den Broek
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The unit commitment problem (UC) is an optimization problem concerning the operation of electrical generators. Many algorithms have been proposed for the UC and in recent years a more decentralized approach, by solving the UC with alternating direction method of multipliers (ADMM), has been investigated. For convex problems ADMM is guaranteed to find an optimal solution. However, because UC is non-convex additional steps need to be taken in order to ensure convergence to a feasible solution of high quality. Therefore, solving UC by a MIL(Q)P formulation and running an off-the-shelf solver like Gurobi until now seems to be the most efficient approach to obtain high quality solutions. In this paper, we introduce a new and efficient way to solve the UC with ADMM to near optimality. We relax the supply-demand balance constraint and deal with the non-convexity by iteratively increasing a penalty coefficient until we eventually force convergence and feasibility. At each iteration the subproblems are solved by our efficient algorithm for the single UC subproblem developed in earlier work and our new ADMM algorithm for the transmission subproblems. Computational experiments on benchmark instances demonstrated that our algorithm produces high-quality solutions. The computation time seems to grow practically linear with the length of the time horizon. For the case with quadratic generation cost our algorithm is significantly faster than solving the problem by a state-of-the-art MIL(Q)P formulation. For the case of linear generation cost, it outperforms the MILP approach for longer time horizons.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections