Dynamic framework for crew dispatch optimization in power distribution fault inspection

• Fault location: This paper presents a framework for locating faults using inspection crews. • Bayes’ Theorem: Trouble calls are used to estimate the posterior probability of faults. • Multi-objective model: A multi-objective model is proposed for dispatching inspection crews. • Dynamic framework: A dynamic method updates the posterior fault probabilities using field information provided by crews and updates routes accordingly. • Efficiency: The use of posterior probability can reduce inspection time. The increasing frequency of natural disasters in recent years has significantly affected electrical distribution networks. A growing body of research has focused on dispatching crews to inspect and repair the electrical grid. While some studies estimate fault probabilities, others incorporate trouble calls or propose dynamic, multi-objective approaches. However, existing studies do not integrate all these aspects into a unified framework that simultaneously refines fault probabilities based on trouble calls, updates them dynamically using field inspection information, and embeds the updated probabilities into a multi-objective optimization model. Most existing approaches address these elements separately, for example by estimating prior fault probabilities without dynamic updating or by optimizing crew routing primarily based on shortest paths. As a result, such approaches may delay the inspection of the most likely fault locations and limit the effectiveness of inspection. This gap is addressed in this work and validated through numerical experiments. This paper proposes a dynamic bi-objective model for dispatching crews to inspect outaged areas, aiming to minimize routing efforts while prioritizing areas with higher fault probabilities. The problem is addressed using a lexicographic method, which first optimizes one objective and then solves the second without altering the result of the first. To support the model, posterior fault probabilities are estimated using Bayes’ theorem and updated with trouble call and field information, allowing adaptive crew routing. Numerical experiments on the IEEE-34 and IEEE-126 test systems demonstrate that dynamic refinement of fault probabilities, driven by inspection crew feedback, leads to substantial improvements in fault detection time.

Authors

Institutions

Publication Details

Journal
Reliability Engineering & System Safety
Published
2026-03-07
DOI
https://doi.org/10.1016/j.ress.2026.112527
Primary Topic
Power System Reliability and Maintenance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic framework for crew dispatch optimization in power distribution fault inspection

Michel Bessani, Lucas S. Batista, Marcus V.F. Diadelmo
Reliability Engineering & System Safety
Power System Reliability and Maintenance
article

Dynamic framework for crew dispatch optimization in power distribution fault inspection

Michel Bessani, Lucas S. Batista, Marcus V.F. Diadelmo
article en

Abstract

• Fault location: This paper presents a framework for locating faults using inspection crews. • Bayes’ Theorem: Trouble calls are used to estimate the posterior probability of faults. • Multi-objective model: A multi-objective model is proposed for dispatching inspection crews. • Dynamic framework: A dynamic method updates the posterior fault probabilities using field information provided by crews and updates routes accordingly. • Efficiency: The use of posterior probability can reduce inspection time. The increasing frequency of natural disasters in recent years has significantly affected electrical distribution networks. A growing body of research has focused on dispatching crews to inspect and repair the electrical grid. While some studies estimate fault probabilities, others incorporate trouble calls or propose dynamic, multi-objective approaches. However, existing studies do not integrate all these aspects into a unified framework that simultaneously refines fault probabilities based on trouble calls, updates them dynamically using field inspection information, and embeds the updated probabilities into a multi-objective optimization model. Most existing approaches address these elements separately, for example by estimating prior fault probabilities without dynamic updating or by optimizing crew routing primarily based on shortest paths. As a result, such approaches may delay the inspection of the most likely fault locations and limit the effectiveness of inspection. This gap is addressed in this work and validated through numerical experiments. This paper proposes a dynamic bi-objective model for dispatching crews to inspect outaged areas, aiming to minimize routing efforts while prioritizing areas with higher fault probabilities. The problem is addressed using a lexicographic method, which first optimizes one objective and then solves the second without altering the result of the first. To support the model, posterior fault probabilities are estimated using Bayes’ theorem and updated with trouble call and field information, allowing adaptive crew routing. Numerical experiments on the IEEE-34 and IEEE-126 test systems demonstrate that dynamic refinement of fault probabilities, driven by inspection crew feedback, leads to substantial improvements in fault detection time.

Reliability Engineering & System SafetyVol. 272
Universidade Federal de Minas Gerais (BR), Instituto Federal de Educação, Ciência e Tecnologia de Minas Gerais (BR)
Climate action
Openalex Percentile: Top 45%
Power System Reliability and Maintenance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.