A Caltech Library Service

Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging

Sun, Bo and Zeynali, Ali and Li, Tongxin and Hajiesmaili, Mohammad and Wierman, Adam and Tsang, Danny H. K. (2020) Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 4 (3). Art. No. 51. ISSN 2476-1249. doi:10.1145/3428336.

[img] PDF - Published Version
See Usage Policy.

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


We introduce and study a general version of the fractional online knapsack problem with multiple knapsacks, heterogeneous constraints on which items can be assigned to which knapsack, and rate-limiting constraints on the assignment of items to knapsacks. This problem generalizes variations of the knapsack problem and of the one-way trading problem that have previously been treated separately, and additionally finds application to the real-time control of electric vehicle (EV) charging. We introduce a new algorithm that achieves a competitive ratio within an additive factor of one of the best achievable competitive ratios for the general problem and matches or improves upon the best-known competitive ratio for special cases in the knapsack and one-way trading literatures. Moreover, our analysis provides a novel approach to online algorithm design based on an instance-dependent primal-dual analysis that connects the identification of worst-case instances to the design of algorithms. Finally, we illustrate the proposed algorithm via trace-based experiments of EV charging.

Item Type:Article
Related URLs:
URLURL TypeDescription Paper ItemConference Paper
Sun, Bo0000-0003-3172-7811
Li, Tongxin0000-0002-9806-8964
Hajiesmaili, Mohammad0000-0001-9278-2254
Tsang, Danny H. K.0000-0003-0135-7098
Additional Information:© 2020 Copyright held by the owner/author(s). Publication rights licensed to ACM. Bo Sun and Danny H.K. Tsang acknowledge the support received from the Hong Kong Research Grant Council (RGC) General Research Fund (Project 16202619 and Project 16211220). Ali Zeynali and Mohammad Hajiesmaili’s research is supported by NSF CNS-1908298. Tongxin Li’s research is supported by NSF grants (CPS ECCS 1932611 and CPS ECCS 1739355). Adam Wierman acknowledges the support received from NSF grants (AitF-1637598 and CNS-1518941). Bo Sun would also like to thank Dr. Xiaoqi Tan (University of Toronto) for insightful and useful discussions.
Funding AgencyGrant Number
Hong Kong Research Grant Council16202619
Hong Kong Research Grant Council16211220
Subject Keywords:online knapsack problems; one-way trading; online algorithms; electric vehicle charging; online primal dual analysis
Issue or Number:3
Record Number:CaltechAUTHORS:20201014-142839691
Persistent URL:
Official Citation:Bo Sun, Ali Zeynali, Tongxin Li, Mohammad Hajiesmaili, Adam Wierman, and Danny H.K. Tsang. 2020. Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging. Proc. ACM Meas. Anal. Comput. Syst. 4, 3, Article 51 (December 2020), 32 pages. 1145/3428336
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:106066
Deposited By: Tony Diaz
Deposited On:14 Oct 2020 21:49
Last Modified:16 Nov 2021 18:49

Repository Staff Only: item control page