Restriction techniques for the unit-commitment problem with total procurement costs

Mariusz Kaleta and Eugeniusz Toczylowski

Energy Policy, 2008, vol. 36, issue 7, 2439-2448

Abstract: Many discrete optimization problems may be solved much easier, if the solution space can be restricted in a convenient way. For a given specific problem, the restriction techniques can be helpful if an available optimization solver, perceived as a black box, is capable of solving quickly only reduced subproblems of a limited size. For the family of hard unit-commitment problems we investigate a hierarchical search algorithm, which is based on decomposition of the problem into two subproblems. The upper-level subproblem is a relatively small decision "kernel" of the problem that can be solved approximately by a search algorithm. We define an appropriate restricted decision space for this subproblem. The lower-level subproblem is an appropriate restriction of the original problem that can be solved efficiently by a dedicated solver. Our approach was analyzed on a set of historical data from the Polish electrical balancing market and the best known solutions were improved by the average of about 2-5%.

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0301-4215(08)00057-8
Full text for ScienceDirect subscribers only

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:eee:enepol:v:36:y:2008:i:7:p:2439-2448

Access Statistics for this article

Energy Policy is currently edited by N. France

More articles in Energy Policy from Elsevier
Bibliographic data for series maintained by Catherine Liu ().