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

Bahar Cennet Okumuşoğlu (), Beste Basciftci () and Burak Kocuk ()
Additional contact information
Bahar Cennet Okumuşoğlu: Industrial Engineering Program, Sabancı University, 34956 Istanbul, Turkey
Beste Basciftci: Department of Business Analytics, Tippie College of Business, University of Iowa, Iowa City, Iowa 52242
Burak Kocuk: Industrial Engineering Program, Sabancı University, 34956 Istanbul, Turkey

INFORMS Journal on Computing, 2024, vol. 36, issue 5, 1335-1358

Abstract: 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.

Keywords: stochastic programming; mixed-integer programming; joint chance constraints; condition-based maintenance; unit commitment; power systems (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2022.0154 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:36:y:2024:i:5:p:1335-1358

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().