On Mixed-Integer Programming Formulations for the Unit Commitment Problem

doi:10.1287/ijoc.2019.0944

On Mixed-Integer Programming Formulations for the Unit Commitment Problem

2020-06-25

0

OA

AI

DOI：10.1287/ijoc.2019.0944

原文链接

查看原文

摘要

En 中文

We provide a comprehensive overview of mixed-integer programming formulations for the unit commitment (UC) problem. UC formulations have been an especially active area of research over the past 12 years due to their practical importance in power grid operations, and this paper serves as a capstone for this line of work. We additionally provide publicly available reference implementations of all formulations examined. We computationally test existing and novel UC formulations on a suite of instances drawn from both academic and real-world data sources. Driven by our computational experience from this and previous work, we contribute some additional formulations for both generator production upper bounds and piecewise linear production costs. By composing new UC formulations using existing components found in the literature and new components introduced in this paper, we demonstrate that performance can be significantly improved—and in the process, we identify a new state-of-the-art UC formulation.

On Mixed-Integer Programming Formulations for the Unit Commitment Problem

摘要

AI总结

期刊

机构

引用论文