A Mixed Integer‐Linear Programming Model for Solving the Hydroelectric Unit Maintenance Scheduling Problem

This paper presents an optimization modeling approach utilizing Mixed Integer Linear Programming (MILP) techniques to address the hydroelectric unit maintenance scheduling problem for British Columbia Hydro and Power Authority (BC Hydro) systems. The research leverages specialized linear formulations and algorithms to solve the combinatorial maintenance problem in large‐scale hydroelectric systems. The primary objective is to determine the optimal timing and sequencing for each unit outage within the system, ensuring system productivity, reliability, and operability. The proposed method involves a detailed MILP formulation that considers various constraints. A novel ‘maintenance shape’ algorithm is designed to handle the nonlinearity arising from the maintenance continuity preference, ensuring that all units' maintenance activities within each plant are arranged sequentially without breaks. Results from the case study illustrate the systematic effects of unit maintenance on BC Hydro's competitiveness in the electricity market. The model can be extended to include more plants and reservoirs, providing a valuable tool for BC Hydro and similar utilities in strategically managing their maintenance operations. © 2025 Institute of Electrical Engineers of Japan and Wiley Periodicals LLC.

Authors

Publication Details

Journal
IEEJ Transactions on Electrical and Electronic Engineering
Published
2025-05-01
DOI
https://doi.org/10.1002/tee.70050
Citations
1
Primary Topic
Power System Reliability and Maintenance
Type
article
Field-Weighted Citation Impact
1.30

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Mixed Integer‐Linear Programming Model for Solving the Hydroelectric Unit Maintenance Scheduling Problem

Yuehao Tang
1 citations
IEEJ Transactions on Electrical and Electronic Engineering
Power System Reliability and Maintenance
1.30
article

A Mixed Integer‐Linear Programming Model for Solving the Hydroelectric Unit Maintenance Scheduling Problem

Yuehao Tang
article en
1 citations

Abstract

This paper presents an optimization modeling approach utilizing Mixed Integer Linear Programming (MILP) techniques to address the hydroelectric unit maintenance scheduling problem for British Columbia Hydro and Power Authority (BC Hydro) systems. The research leverages specialized linear formulations and algorithms to solve the combinatorial maintenance problem in large‐scale hydroelectric systems. The primary objective is to determine the optimal timing and sequencing for each unit outage within the system, ensuring system productivity, reliability, and operability. The proposed method involves a detailed MILP formulation that considers various constraints. A novel ‘maintenance shape’ algorithm is designed to handle the nonlinearity arising from the maintenance continuity preference, ensuring that all units' maintenance activities within each plant are arranged sequentially without breaks. Results from the case study illustrate the systematic effects of unit maintenance on BC Hydro's competitiveness in the electricity market. The model can be extended to include more plants and reservoirs, providing a valuable tool for BC Hydro and similar utilities in strategically managing their maintenance operations. © 2025 Institute of Electrical Engineers of Japan and Wiley Periodicals LLC.

IEEJ Transactions on Electrical and Electronic EngineeringVol. 20(8)
Natural Science Foundation of Hubei Province
Openalex Percentile: Top 22%
Power System Reliability and Maintenance
1.30
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.