Stochastic Maintenance Schedules of Active Distribution Networks Based on Monte-Carlo Tree Search

The integration of volatile distributed energy resources (DERs) brings new challenges for the active distribution network maintenance scheduling (DN-MS). Conventionally, the DN-MS is formulated as a deterministic optimization model without considering the uncertainties of DERs. In this paper, the DN...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power systems Vol. 35; no. 5; pp. 3940 - 3952
Main Authors: Shang, Yuwei, Wu, Wenchuan, Liao, Jiawei, Guo, Jianbo, Su, Jian, Liu, Wei, Huang, Yu
Format: Journal Article
Language:English
Published: New York IEEE 01.09.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Computational modeling
Computer simulation
Constraints
distributed generation
Distribution network
electric vehicles
Energy sources
Heuristic methods
maintenance
Maintenance costs
Maintenance engineering
Maintenance management
Mathematical analysis
Mixed integer
Monte Carlo simulation
Monte-Carlo tree search
Network reliability
Nonlinear programming
Optimization
Power system reliability
Reliability
Schedules
Searching
Stochastic processes
Switches
Uncertainty
ISSN:0885-8950, 1558-0679
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The integration of volatile distributed energy resources (DERs) brings new challenges for the active distribution network maintenance scheduling (DN-MS). Conventionally, the DN-MS is formulated as a deterministic optimization model without considering the uncertainties of DERs. In this paper, the DN-MS is formulated as a multistage stochastic optimization problem, which is cast as a stochastic mixed-integer nonlinear programming model. It aims to reduce the total maintenance cost constrained by the reliability indices. To capture the operational characteristics of active distribution networks, the uncertainties of DERs and post-outage operation strategies of switching devices are incorporated into the model. In general, this type of model is intractable and mainly solved by heuristic search methods with low efficiency. Recently, Monte-Carlo tree search (MCTS) is emerging as a scalable and promising reinforcement learning approach. We propose a stochastic MCTS solution to this problem. In the tree search procedure, a sample average approximation technique is developed to estimate multistage maintenance costs considering uncertainties. To speed up the MCTS, the complicated constraints of the original problem are transformed to penalty or heuristics functions. This approach can asymptotically approximate the optimum with promising computation efficiency. Numerical test results demonstrate the superiority of the proposed method over benchmark methods.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.2020.2973761