Using GRASP to Solve the Unit Commitment Problem

Ana Viana (), Jorge de Sousa () and Manuel Matos ()

Annals of Operations Research, 2003, vol. 120, issue 1, 117-132

Abstract: 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. Copyright Kluwer Academic Publishers 2003

Keywords: unit commitment; metaheuristics; GRASP (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1023326413273 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:120:y:2003:i:1:p:117-132:10.1023/a:1023326413273

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1023326413273

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().