Mixed Integer Linear Programming for Maintenance Scheduling in Power System Planning

Abstract

This paper discussed the merit of mixed-integer linear programming (MILP)-based approach against Lagrangian relaxation (LR)-based approach in solving generation and transmission maintenance scheduling problem. MILP provides a straightforward solution by formulating coupling constraints equations so that these sub-problems can be solved simultaneously without involving multipliers. In LR-based approach, generation and transmission maintenance scheduling, and security-constrained unit commitment have been solved individually and the integration was realized through a series of multipliers which has caused computational burden to the system. Numerical case studies were evaluated on the 6-bus system. A comparative study is carried out between the MILP and LR approaches. Simulation results indicate that the maintenance schedule derived by the proposed MILP approach outperforms the LR in terms of operational cost savings and gap tolerance. The operating cost could be saved up to 5% and the gap tolerance achieved is 0.01% as compared to 0.14% by LR.