Symmetric separable convex resource allocation problems with structured disjoint interval bound constraints
Martijn H. H. Schoot Uiterkamp

TL;DR
This paper introduces an exact polynomial-time algorithm for a generalized resource allocation problem with structured disjoint interval constraints, motivated by electric vehicle charging scheduling in smart grids.
Contribution
It presents a novel algorithm for symmetric separable convex RAP with disjoint interval bounds, extending classical RAPs and applicable to EV charging scheduling.
Findings
Algorithm efficiently solves special cases with fixed number of intervals.
The method adapts to integer variables without increased complexity.
Computational experiments confirm practical efficiency for small number of intervals.
Abstract
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 activities, where each individual allocation is restricted to a disjoint collection of intervals. This is a generalization of classical RAPs studied in the literature where in contrast each allocation is only restricted by simple lower and upper bounds, i.e., . We propose an exact algorithm that, for four special cases of the problem, returns an optimal solution in time, where the term represents the number of flops required for one evaluation of the separable objective…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsElectric Vehicles and Infrastructure · Advanced Battery Technologies Research · Vehicle Routing Optimization Methods
