2 research outputs found
A Greedy algorithm for local heating
This paper studies a planning problem for supplying hot water in domestic
environment. Hereby, boilers (e.g. gas or electric boilers, heat pumps or
microCHPs) are used to heat water and store it for domestic demands. We
consider a simple boiler which is either turned on or turned off and is
connected to a buffer of limited capacity. The energy needed to run the boiler
has to be bought e.g. on a day-ahead market, so we are interested in a planning
which minimizes the cost to supply the boiler with energy in order to fulfill
the given heat demand. We present a greedy algorithm for this heating problem
whose time complexity is O(T {\alpha}(T )) where T is the number of time
intervals and {\alpha} is the inverse of Ackermann function.Comment: 11 pages, no pictur
Approximation algorithms for scheduling a group of heat pumps
This paper studies planning problems for a group of heating systems which
supply the hot water demand for domestic use in houses. These systems (e.g. gas
or electric boilers, heat pumps or microCHPs) use an external energy source to
heat up water and store this hot water for supplying the domestic demands. The
latter allows to some extent a decoupling of the heat production from the heat
demand. We focus on the situation where each heating system has its own demand
and buffer and the supply of the heating systems is coming from a common
source. In practice, the common source may lead to a coupling of the planning
for the group of heating systems. The bottleneck to supply the energy may be
the capacity of the distribution system (e.g. the electricity networks or the
gas network). As this has to be dimensioned for the maximal consumption, it is
important to minimize the maximal peak. This planning problem is known to be
\NP-hard. We present polynomial-time approximation algorithms for four variants
of peak minimization problems, and we determine the worst-case approximation
error.Comment: 15 pages, 1 figur