Multi-Objective Security Constrained Unit Commitment via Hybrid Evolutionary Algorithms

Aamir Ali

doi:10.1109/ACCESS.2024.3351710

2024-01-01

Aamir Ali

Arslan Shah

Muhammad Usman Keerio

DOI：10.1109/ACCESS.2024.3351710

原文链接

原文求助

摘要

En 中文

This paper addresses the challenging problem of Unit Commitment (UC), which involves the optimal scheduling of power generation units while adhering to numerous network operational constraints called security-constrained UC (SCUC). SCUC problem aims to minimize costs subject to turning on economically efficient generators and turning off expensive ones. These operational constraints include load balancing, voltage level at buses, minimum up and down time requirements, spinning reserve, and ramp up and down constraints. The SCUC problem, subject to these operational constraints, is a complex mixed-integer nonlinear problem (MINLP). There has been a growing interest in using evolutionary algorithms (EAs) to tackle large-scale multi-objective MINLP problems in recent two decades. This paper introduces a novel approach to address the SCUC problem, which is further complicated by including network constraints. They are pioneering the integration of single and multi-objective EAs to solve the SCUC problem while incorporating AC network constraints through hybrid binary and real coded operators. The development of an ensemble algorithm that combines mixed real and binary coded operators, extended by a bidirectional coevolutionary algorithm to tackle multi-objective SCUC problems. The paper implements a new formulation based on three conflicting objective functions: cost of energy supplied, startup and shutdown costs of generators, energy loss, and voltage deviation to solve the SCUC problem. Implementing a new formulation also addresses the solution of single and multi-objective SCUC problems using a combination of proposed technical and economic objective functions. The proposed algorithm is rigorously tested on a 10-unit IEEE RTS system and a 6-unit IEEE 30-bus test system, both with and without security constraints, addressing week-ahead and day-ahead SCUC scenarios. Simulation results show that the proposed algorithm finds near-global optimal solutions compared to other state-of-the-art EAs. Additionally, the research demonstrates the effectiveness of the proposed search operator by integrating it with a multi-objective coevolutionary algorithm driven by both feasible and infeasible solutions, showcasing superior performance in solving multi-objective SCUC problems. These results are compared with various recently implemented Multi-Objective Evolutionary Algorithms (MOEAs), demonstrating the superiority of

Keyword:

Security constrained unit commitment

evolutionary algorithms

optimal power flow

constraint handling techniques

multi-objective optimization