An application of genetic and evolutive algorithms to unit commitment problem

Abstract

 Here is introduced an application of the Genetic and Evolutive Algorithms to the Unit Commitment Problem. It is a mixed integer problem of constrained non linear combinatorial optimization. The many constraints make the problem very complex.

Three cases of study on the problem have been faced, characterized by crescent grades of completeness/ difficulties in order to understand which are the advantages and the difficulties which arise from the evolutive approach. In the cases of study have been faced dimensions of the problem significant in practice: from 10 up to 1000 generators.