A new memetic algorithm approach for the price based unit commitment problem

Unit commitment (UC) is a very important optimization task, which plays a major role in the daily operation planning of electric power systems that is why UC is a core research topic attracting a lot of research efforts. An innovative method based on an advanced memetic algorithm (MA) for the solution of price based unit commitment (PBUC) problem is proposed. The main contributions of this paper are: (i) an innovative two-level tournament selection, (ii) a new multiple window crossover, (iii) a novel window in window mutation operator, (iv) an innovative local search scheme called elite mutation, (v) new population initialization algorithm that is specific to PBUC problem, and (vi) new PBUC test systems including ramp up and ramp down constraints so as to provide new PBUC benchmarks for future research. The innovative two-level tournament selection mechanism contributes to the reduction of the required CPU time. The method has been applied to systems of up to 110 units and the results show that the proposed memetic algorithm is superior to other methods since it finds the optimal solution with a high success rate and within a reasonable execution time.