Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > A dynamic regrouping based seq...

A dynamic regrouping based sequential dynamic programming algorithm for unit commitment of combined heat and power systems

Aiying Rong, Henri Hakonen, Risto Lahdelma, A dynamic regrouping based sequential dynamic programming algorithm for unit commitment of combined heat and power systems. Energy Conversion and Management 50(4), 1108–1115, 2009.

Abstract:

This paper addresses the unit commitment (UC) in multi-period combined heat and power (CHP) production planning under the deregulated power market. In CHP plants (units), generation of heat and power follows joint characteristics, which implies that it is difficult to determine the relative cost efficiency of the plants. We introduce in this paper the DRDP-RSC algorithm, which is a dynamic regrouping based dynamic programming (DP) algorithm based on linear relaxation of the ON/OFF states of the units, sequential commitment of units in small groups. Relaxed states of the plants are used to reduce the dimension of the UC problem and dynamic regrouping is used to improve the solution quality. Numerical results based on real-life data sets show that this algorithm is efficient and optimal or near-optimal solutions with very small optimality gap are obtained.

BibTeX entry:

@ARTICLE{jRoHaLa09a,
  title = {A dynamic regrouping based sequential dynamic programming algorithm for unit commitment of combined heat and power systems},
  author = {Rong, Aiying and Hakonen, Henri and Lahdelma, Risto},
  journal = {Energy Conversion and Management},
  volume = {50(4)},
  pages = {1108–1115},
  year = {2009},
  keywords = {Combined heat and power; Dynamic programming; Unit commitment; Relaxed state; Dynamic regrouping},
}

Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI)

Publication Forum rating of this publication: level 2

Edit publication