Abstract: With regard to the characteristics of the unit commitment problem, a hybrid crisscross optimization algorithm (CSO) is proposed, discrete CSO and continuous CSO are used for the unit status scheduling and power economic dispatch, respectively. In the process of evolution, horizontal crossover performs crossover on the same dimension of different particles to guarantee the global convergence ability, and vertical crossover performs crossover on different dimensions of the same particle to overcome the local optimal convergence, and the perfect combination of the two crossovers by a competitive algorithm not only speeds up the convergence rate but also ensures the ability of the global constraints. The heuristic strategy is introduced to modify the constraint conditions, such as the minimum up and down time and the power balance, which can effectively improve the accuracy of the solution. The feasibility and superiority of the proposed algorithm are verified by the simulation of two examples and the comparison with other algorithms.

Key words: unit commitment, crisscross, horizontal crossover, vertical crossover, heuristic strategy