Generalizing Unit Commitment Problem Solving via SAT-based Decoupling
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917417563717632 |
|---|---|
| author | Zhao, Yuxin Huang, Han Fu, Fangji Hao, Zhifeng |
| author_facet | Zhao, Yuxin Huang, Han Fu, Fangji Hao, Zhifeng |
| contents | As the cornerstone of modern power systems, the Unit Commitment Problem (UC) is critical for ensuring operational security and economic efficiency in the ongoing global energy transition. However, existing UC studies typically propose specialized algorithms for specific variants and operational requirements, tightly coupling the algorithms to their target models and limiting their applicability to other variants. To address this issue, this paper proposes a method that uses SAT-based reduction to decouple the algorithm from the problem, which allows a single algorithm to solve multiple UC variants. By uniformly reducing all UC variants to SAT instances solvable by standard SAT solvers, this method makes the solving algorithm independent of the original UC variant, thus granting it broad applicability across diverse variants. Experimental results show that our method achieves better solution quality than specialized algorithms and demonstrates stronger generalizability. This work offers a fast and flexible framework for addressing newly emerging UC formulations in evolving power systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_16489 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Generalizing Unit Commitment Problem Solving via SAT-based Decoupling Zhao, Yuxin Huang, Han Fu, Fangji Hao, Zhifeng Logic in Computer Science Computational Engineering, Finance, and Science As the cornerstone of modern power systems, the Unit Commitment Problem (UC) is critical for ensuring operational security and economic efficiency in the ongoing global energy transition. However, existing UC studies typically propose specialized algorithms for specific variants and operational requirements, tightly coupling the algorithms to their target models and limiting their applicability to other variants. To address this issue, this paper proposes a method that uses SAT-based reduction to decouple the algorithm from the problem, which allows a single algorithm to solve multiple UC variants. By uniformly reducing all UC variants to SAT instances solvable by standard SAT solvers, this method makes the solving algorithm independent of the original UC variant, thus granting it broad applicability across diverse variants. Experimental results show that our method achieves better solution quality than specialized algorithms and demonstrates stronger generalizability. This work offers a fast and flexible framework for addressing newly emerging UC formulations in evolving power systems. |
| title | Generalizing Unit Commitment Problem Solving via SAT-based Decoupling |
| topic | Logic in Computer Science Computational Engineering, Finance, and Science |
| url | https://arxiv.org/abs/2604.16489 |