Using GRASP to Solve the Unit Commitment Problem

In this paper, the Unit Commitment (UC) problem is presented and solved, following an innovative approach based on a metaheuristic procedure. The problem consists on deciding which electric generators must be committed, over a given planning horizon, and on defining the production levels that are required for each generator, so that load and spinning reserve requirements are verified, at minimum production costs. Due to its complexity, exact methods proved to be inefficient when real size problems were considered. Therefore, heuristic methods have for long been developed and, in recent years, metaheuristics have also been applied with some success to the problem. Methods like Simulated Annealing, Tabu Search and Evolutionary Programming can be found in several papers, presenting results that are sufficiently interesting to justify further research in the area. In this paper, a resolution framework based on GRASP – Greedy Randomized Adaptive Search Procedure – is presented. To obtain a general optimisation tool, capable of solving different problem variants and of including several objectives, the operations involved in the optimisation process do not consider any particular characteristics of the classical UC problem. Even so, when applied to instances with very particular structures, the computational results show the potential of this approach.