论文标题
用于局部供暖的贪婪算法
A Greedy algorithm for local heating
论文作者
论文摘要
本文研究了在家庭环境中提供热水的计划问题。因此，使用锅炉（例如气体或电动锅炉，热泵或微琴）来加热水，并将其存储在国内需求中。我们考虑一个简单的锅炉，该锅炉要么打开或关闭，并连接到容量有限的缓冲区。必须购买运行锅炉所需的能量，例如在白天的市场上，因此我们有兴趣一项计划，该计划最大程度地减少了为锅炉提供能源以满足给定的热量需求的成本。我们为这个加热问题提供了一种贪婪的算法，其时间复杂性为O（tα（t）），其中t是时间间隔的数量，而α是Ackermann功能的倒数。
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 α(T )) where T is the number of time intervals and α is the inverse of Ackermann function.
