Large-Scale Unit Commitment by Memetic Algorithm

This paper proposes the Memetic algorithm to solve the problem of large-scale unit commitment (UC), which makes the global and local optimization methods combined. During the global search process of genetic algorithm (GA), the guided local search (GLS) is introduced in the process of global search. The local extremum is removed in each iteration and the cost objective function is repaired in time to change the terrain of the search space and avoid falling into the local optimal solution. Simulation results show that the method is effective and improves the computation efficiency to a certain extent.