In the resource allocation problem (RAP), the goal is to divide a given amount of a resource over a set of activities while minimizing the cost of this allocation and possibly satisfying constraints on allocations to subsets of the activities. Most solution approaches for the RAP and its extensions allow each activity to have its own cost function. However, in many applications, often the structure of the objective function is the same for each activity, and the difference between the cost functions lies in different parameter choices, such as, for example, the multiplicative factors. In this article, we introduce a new class of objective functions that captures a significant number of the objectives occurring in studied applications. These objectives are characterized by a shared structure of the cost function depending on two input parameters. We show that, given the two input parameters, there exists a solution to the RAP that is optimal for any choice of the shared structure. As a consequence, this problem reduces to the quadratic RAP, making available the vast amount of solution approaches and algorithms for the latter problem. We show the impact of our reduction result on several applications, and in particular, we improve the best-known worst-case complexity bound of two problems in vessel routing and processor scheduling from [Formula: see text] to [Formula: see text]. Summary of Contribution: The resource allocation problem (RAP) with submodular constraints and its special cases are classic problems in operations research. Because these problems are studied in many different scientific disciplines, many conceptual insights, structural properties, and solution approaches have been reinvented and rediscovered many times. The goal of this article is to reduce the amount of future reinventions and rediscoveries by bringing together these different perspectives on RAPs in a way that is accessible to researchers with different backgrounds. The article serves as an exposition on RAPs and on their wide applicability in many areas, including telecommunications, energy, and logistics. In particular, we provide tools and examples that can be used to formulate and solve problems in these areas as RAPs. To accomplish this, we make three concrete contributions. First, we provide a survey on algorithms and complexity results for RAPs and discuss several recent advances in these areas. Second, we show that many objectives for RAPs can be reduced to a (simpler) quadratic objective function, which makes available the extensive collection of fast and efficient algorithms for quadratic RAPs to solve these problems. Third, we discuss the impact that RAPs and the aforementioned reduction result can make in several application areas.
The increasing penetration of electric vehicles (EVs) requires the development of smart charging strategies that accommodate the increasing load of these EVs on the distribution grid. Many existing charging strategies assume that an EV is allowed to charge at any rate up to a given maximum rate. However, in practice, charging at low rates is inefficient and often even impossible. Therefore, this paper presents an efficient algorithm for scheduling an EV within a decentralized energy management system that allows only charging above a given threshold. We show that the resulting optimal EV schedule is characterized by an activation level and a fill-level. Moreover, based on this result, we derive an online approach that does not require predictions of uncontrollable loads as input, but merely a prediction of these two characterizing values. Simulation results show that the online algorithm is robust against prediction errors in these values and can produce near-optimal online solutions.
Due to the large increase in electric vehicles (EVs), smart charging strategies are required in order for the distribution grid to accommodate all these EVs. Many charging strategies either assume that future loads are known in advance, or use predictions of these loads as input. However, accurate prediction of uncontrollable load is very difficult. Online valleyfilling algorithms circumvent this problem by determining the charging profile based on a prediction of the fill-level: a single parameter that characterizes the optimal EV schedule. This paper presents a simple, but accurate, method to predict this fill-level. We show that near-optimal charging profiles with an optimality gap of less than 1% can be realized when our method is used to predict the input level for the online valley-filling approach. Furthermore, our method is very fast and thus suitable for use in decentralized energy management systems that employ the online valley-filling approach.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.