数学优化
计算机科学
调度(生产过程)
电力系统
整数规划
子程序
约束规划
地铁列车时刻表
网格
随机规划
数学
功率(物理)
物理
几何学
量子力学
操作系统
作者
Bahar Cennet Okumuşoğlu,Beste Basciftci,Burak Kocuk
出处
期刊:Informs Journal on Computing
日期:2024-02-26
卷期号:36 (5): 1335-1358
被引量:2
标识
DOI:10.1287/ijoc.2022.0154
摘要
Maintenance planning plays a key role in power system operations under uncertainty as it helps providers and operators ensure a reliable and secure power grid. This paper studies a short-term condition-based integrated maintenance planning with operations scheduling problem while considering the possible unexpected failure of generators as well as transmission lines. We formulate this problem as a two-stage stochastic mixed-integer program with failure scenarios sampled from the sensor-driven remaining lifetime distributions of the individual system elements whereas a joint chance constraint consisting of Poisson Binomial random variables is introduced to account for failure risks. Because of its intractability, we develop a cutting-plane method to obtain an exact reformulation of the joint chance constraint by proposing a separation subroutine and deriving stronger cuts as part of this procedure. We also derive a second-order cone programming-based safe approximation of this constraint to solve large-scale instances. Furthermore, we propose a decomposition algorithm implemented in parallel fashion for solving the resulting stochastic program, which exploits the features of the integer L-shaped method and the special structure of the maintenance and operations scheduling problem to derive valid and stronger sets of optimality cuts. We further present preprocessing steps over transmission line flow constraints to identify redundancies. To illustrate the computational performance and efficiency of our algorithm compared with more conventional maintenance approaches, we design a computational study focusing on a weekly plan with daily maintenance and hourly operational decisions involving detailed unit commitment subproblems. Our computational results on various IEEE instances demonstrate the computational efficiency of the proposed approach with reliable and cost-effective maintenance and operational schedules. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms—Discrete. Supplemental Material: The online appendix is available at https://doi.org/10.1287/ijoc.2022.0154 .
科研通智能强力驱动
Strongly Powered by AbleSci AI