arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.03880math.OC
收藏

带嵌套约束的二次资源分配问题的快速算法

A fast algorithm for quadratic resource allocation problems with nested constraints

Martijn H. H. Schoot Uiterkamp, Johann L. Hurink, Marco E. T. Gerards

摘要:

研究了变量和套上具有上下约束的二次资源分配问题及其变形。这个问题出现在许多应用中,特别是智能电网的分散式能量管理(DEM)中的电池调度。我们提出了一个算法,这个问题,运行在$O(n \log n)$的时间,并在现有的算法相比,这个问题,实现这个时间复杂性,使用相对简单,易于实现的子程序和数据结构。这使得我们的算法非常有吸引力的现实生活中的适应和实施。数值比较我们的算法与电池调度的子程序在现有的工具DEM研究表明,我们的算法显着减少了DEM系统的整体执行时间,特别是当电池预计将完全充满或空多次在最佳时间表。此外,模拟数据的计算实验表明,我们的算法优于目前最有效的算法超过一个数量级。特别是,我们的算法是能够解决所有考虑的情况下,多达一百万个变量在小于17秒的个人电脑上。

英文摘要:

We study the quadratic resource allocation problem and its variant with lower and upper constraints on nested sums of variables. This problem occurs in many applications, in particular battery scheduling within decentralized energy management (DEM) for smart grids. We present an algorithm for this problem that runs in $O(n \log n)$ time and, in contrast to existing algorithms for this problem, achieves this time complexity using relatively simple and easy-to-implement subroutines and data structures. This makes our algorithm very attractive for real-life adaptation and implementation. Numerical comparisons of our algorithm with a subroutine for battery scheduling within an existing tool for DEM research indicates that our algorithm significantly reduces the overall execution time of the DEM system, especially when the battery is expected to be completely full or empty multiple times in the optimal schedule. Moreover, computational experiments with synthetic data show that our algorithm outperforms the currently most efficient algorithm by more than one order of magnitude. In particular, our algorithm is able to solves all considered instances with up to one million variables in less than 17 seconds on a personal computer.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑