Chaotic Arithmetic Optimization Algorithm for Optimal Sizing of Security Constrained Unit Commitment Problem in Integrated Power System

The operation of unit commitment in power systems is a challenging task, involving intricate nonlinearities and constrained optimization. The decision-making process of committing and de-committing units poses a binary problem that necessitates optimization techniques. This research introduces a novel hybrid chaotic arithmetic optimization algorithm (hCAOA) to tackle the security constraints unit commitment (SCUC) problem. The chaotic arithmetic optimization algorithm falls under the umbrella of metaheuristic optimization approaches, drawing inspiration from arithmetic operations like division, multiplication, addition, and subtraction. To address the SCUCP, the arithmetic operators are used for the optimal sizing of unit commitment problems integrated with RES and PEVs for small, medium, and large systems. Subsequently, the CAOA is applied to a test system comprising ten, to twenty thermal units with wind and PEVs case. To evaluate the efficacy of the CAOA, the algorithm's performance is tested on systems ranging from 10 to 40 units. A comprehensive set of numerical experiments is conducted to assess the effectiveness of the CAOA, and the simulation results are subjected to statistical analysis. The findings from the simulations are presented, discussed, and compared against various classical and heuristic approaches. These comparisons demonstrate the superior performance of the CAOA in solving the SCUCP problem, emphasizing its potential as an efficient optimization approach.