An improved genetic algorithm of unit optimization problem

摘要

Unit combination problem is very complicated. There are a lot of variable number and constraint condition. It is a high dimension, non-convex, discrete and nonlinear optimization problem. It is difficult to find the optimal solution in theory. This paper puts forward the improved genetic algorithm, that is combine the ALOPEX algorithm and genetic algorithm to solve the complex unit commitment problem.