局部加热的贪心算法
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
