An Integrated Predictive Maintenance and Operations Scheduling Framework for Power Systems Under Failure Uncertainty

数学优化 计算机科学 调度(生产过程) 电力系统 整数规划 子程序 约束规划 地铁列车时刻表 网格 随机规划 数学 功率(物理) 物理 几何学 量子力学 操作系统
作者
Bahar Cennet Okumuşoğlu,Beste Basciftci,Burak Kocuk
出处
期刊:Informs Journal on Computing 卷期号:36 (5): 1335-1358 被引量:1
标识
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 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
XWY完成签到,获得积分10
2秒前
乐乐应助枫叶采纳,获得10
3秒前
绛仙旧友发布了新的文献求助10
4秒前
TingtingGZ发布了新的文献求助10
5秒前
miao发布了新的文献求助30
5秒前
冷静机器猫完成签到,获得积分10
7秒前
dreamer完成签到 ,获得积分10
8秒前
9秒前
博博完成签到,获得积分20
11秒前
11秒前
12秒前
12秒前
虚拟的怀绿完成签到,获得积分10
12秒前
12秒前
轩轩完成签到,获得积分10
14秒前
14秒前
ryd完成签到,获得积分10
14秒前
ffchen111完成签到 ,获得积分10
15秒前
17秒前
xixi发布了新的文献求助20
17秒前
5160完成签到,获得积分10
17秒前
小肥发布了新的文献求助30
17秒前
18秒前
18秒前
枫叶发布了新的文献求助10
18秒前
wenge发布了新的文献求助10
19秒前
量子星尘发布了新的文献求助10
19秒前
19秒前
916应助重要小懒虫采纳,获得10
20秒前
BYQ发布了新的文献求助10
21秒前
22秒前
青衣北风发布了新的文献求助10
23秒前
25秒前
25秒前
周杰完成签到,获得积分10
26秒前
CodeCraft应助1111采纳,获得10
26秒前
李爱国应助niiiiii采纳,获得10
27秒前
27秒前
elizabeth339发布了新的文献求助100
28秒前
冷酷小松鼠完成签到,获得积分20
28秒前
高分求助中
传播真理奋斗不息——中共中央编译局成立50周年纪念文集 2000
The Oxford Encyclopedia of the History of Modern Psychology 2000
Chinesen in Europa – Europäer in China: Journalisten, Spione, Studenten 1200
Deutsche in China 1920-1950 1200
中共中央编译局成立四十周年纪念册 / 中共中央编译局建局四十周年纪念册 950
Applied Survey Data Analysis (第三版, 2025) 850
Mineral Deposits of Africa (1907-2023): Foundation for Future Exploration 800
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 物理 生物化学 纳米技术 计算机科学 化学工程 内科学 复合材料 物理化学 电极 遗传学 量子力学 基因 冶金 催化作用
热门帖子
关注 科研通微信公众号,转发送积分 3876293
求助须知:如何正确求助?哪些是违规求助? 3418855
关于积分的说明 10710793
捐赠科研通 3143480
什么是DOI,文献DOI怎么找? 1734384
邀请新用户注册赠送积分活动 836772
科研通“疑难数据库(出版商)”最低求助积分说明 782804