Bidding based generator maintenance scheduling with triple-objective optimization

A new bidding based generating unit maintenance scheduling method under the electricity market environment is presented in this paper. The method can balance overall reliability and economy, and ensure the fairness to all generation companies (GENCOs). The unit maintenance scheduling is modeled as a triple-objective non-convex optimization problem with discrete variables and is solved using an improved version of the Non-dominated Sorting Genetic Algorithm (NSGA-II). A non-inferior solution set is directly produced from huge combinations. A few candidate solutions are selected from the non-inferior set by independent system operator (ISO) based on the overall reliability and economy, whereas the final maintenance schedule is determined by voting of GENCOs. The shares of vote are calculated from the bidding information of GENCOs and the right of each GENCO is fairly guaranteed. A case study of 50 units demonstrates the effectiveness of the proposed method.

► A new bidding based generating unit maintenance scheduling method under the electricity market environment is presented.
► The method can balance overall reliability and economy, and ensure the fairness to all generation companies (GENCOs).
► The unit maintenance scheduling is modeled as a triple-objective optimization problem and solved using the NSGA-II algorithm.
► A case study of 50 units demonstrates the application and effectiveness of the proposed method.