A Cardinality Minimization Approach to Security-Constrained Economic Dispatch
A Cardinality Minimization Approach to Security-Constrained Economic Dispatch
复制标题
DOI：
10.1109/tpwrs.2021.3133379
复制
发表时间：
2022-09-01
影响因子：
6.6
通讯作者：
Gangammanavar, Harsha
中科院分区：
文献类型：
--
作者：
Troxell, David;Ahn, Miju;Gangammanavar, Harsha
针对安全约束下的经济调度问题，提出了一种基于阈值的基数最小化公式。该模型的目标是在突发事件发生时，使系统的运行成本最小化，同时减少在应急运行区域运行的线路数量。该模型允许系统操作员监控线路在紧急区域运行的持续时间，并确保它们在系统操作员确定的可接受的可靠性标准范围内。提出了基数最小化问题的连续凸差逼近问题，并给出了求解该问题的方法。同时给出了基数最小化问题的混合整数规划的重新表述。我们的数值实验表明，基数最小化方法降低了整个系统的运行成本，并避免了在突发事件期间长时间的高电价。
We present a threshold-based cardinality inimization formulation for the security-constrained economic dispatch problem. The model aims to minimize the operating cost of the system while simultaneously reducing the number of lines operating in emergency operating zones during contingency events. The model allows the system operator to monitor the duration for which lines operate in emergency zones and ensure that they are within the acceptable reliability standards determined by the system operators. We develop a continuous difference-of-convex approximation of the cardinality minimization problem and a solution method to solve the problem. We also present mixed-integer programming reformulation of the cardinality minimization problem. Our numerical experiments demonstrate that the cardinality minimization approach reduces the overall system operating cost as well as avoids prolonged periods of high electricity prices during contingency events.