不相交集
可分离空间
正多边形
资源配置
区间(图论)
数学优化
凸分析
分界
次导数
数学
组合数学
凸优化
上下界
凸组合
计算机科学
数学分析
计算机网络
几何学
作者
Martijn H. H. Schoot Uiterkamp
标识
DOI:10.1287/ijoc.2023.0263
摘要
Motivated by the problem of scheduling electric vehicle (EV) charging with a minimum charging threshold in smart distribution grids, we introduce the resource allocation problem (RAP) with a symmetric separable convex objective function and disjoint interval bound constraints. In this RAP, the aim is to allocate an amount of resource over a set of n activities, in which each individual allocation is restricted to a disjoint collection of m intervals. This is a generalization of classic RAPs studied in the literature in which, in contrast, each allocation is only restricted by simple lower and upper bounds, that is, m = 1. We propose an exact algorithm that, for four special cases of the problem, returns an optimal solution in [Formula: see text] time, where the term nF represents the number of flops required for one evaluation of the separable objective function. In particular, the algorithm runs in polynomial time when the number of intervals m is fixed. Moreover, we show how this algorithm can be adapted also to output an optimal solution to the problem with integer variables without increasing its time complexity. Computational experiments demonstrate the practical efficiency of the algorithm for small values of m and, in particular, for solving EV charging problems. History: Accepted by Antonio Frangioni, Area Editor for Design & Analysis of Algorithms–Continuous. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0263 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0263 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
科研通智能强力驱动
Strongly Powered by AbleSci AI