热泵机组调度的近似算法
Approximation algorithms for scheduling a group of heat pumps
摘要:
本文研究了满足住宅生活热水需求的一组供热系统的规划问题。这些系统(例如燃气或电锅炉、热泵或微型热电联产)使用外部能源来加热水并储存热水以满足家庭需求。后者在某种程度上允许热生产与热需求的解耦。我们关注的情况是,每个供暖系统都有自己的需求和缓冲,供暖系统的供应来自一个共同的来源。在实践中,共同的来源可能会导致一组供热系统规划的耦合。供应能量的瓶颈可能是分配系统(例如,电力网络或天然气网络)的容量。由于这必须针对最大消耗量来确定尺寸,因此重要的是使最大峰值最小化。这个规划问题是已知的\NP -硬。我们提出了多项式时间近似算法的四个变种的峰值最小化问题,我们确定的最坏情况下的近似误差。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。