Abstract
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.
- Jacob D Abernethy, Elad Hazan, and Alexander Rakhlin. 2009. Competing in the dark: An efficient algorithm for bandit linear optimization. (2009).Google Scholar
- Micah Adler, Ramesh K Sitaraman, and Harish Venkataramani. 2011. Algorithms for optimizing the bandwidth cost of content delivery. Computer Networks , Vol. 55, 18 (2011), 4007--4020. Google Scholar
Digital Library
- Muhammad Abdullah Adnan, Ryo Sugihara, and Rajesh K Gupta. 2012. Energy efficient geographical load balancing via dynamic deferral of workload. In 2012 IEEE Fifth International Conference on Cloud Computing. IEEE, 188--195. Google Scholar
Digital Library
- Shipra Agrawal, Zizhuo Wang, and Yinyu Ye. 2014. A dynamic near-optimal algorithm for online linear programming. Operations Research , Vol. 62, 4 (2014), 876--890. Google Scholar
Digital Library
- Bahram Alinia, Mohammad H Hajiesmaili, and Noël Crespi. 2019. Online EV charging scheduling with on-arrival commitment. IEEE Transactions on Intelligent Transportation Systems , Vol. 20, 12 (2019), 4524--4537.Google Scholar
Digital Library
- Bahram Alinia, Mohammad H Hajiesmaili, Zachary J Lee, Noel Crespi, and Enrique Mallada. 2020. Online EV scheduling algorithms for adaptive charging networks with global peak constraints. IEEE Transactions on Sustainable Computing (2020).Google Scholar
- Bahram Alinia, Mohammad Sadegh Talebi, Mohammad H Hajiesmaili, Ali Yekkehkhany, and Noel Crespi. 2018. Competitive online scheduling algorithms with applications in deadline-constrained EV charging. In 2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS). IEEE, 1--10.Google Scholar
Cross Ref
- Stephen Boyd, Stephen P Boyd, and Lieven Vandenberghe. 2004. Convex optimization .Cambridge university press. Google Scholar
Digital Library
- Niv Buchbinder and Joseph Naor. 2009a. The design of competitive online algorithms via a primal-dual approach .Now Publishers Inc. Google Scholar
Digital Library
- Niv Buchbinder and Joseph Naor. 2009b. Online primal-dual algorithms for covering and packing. Mathematics of Operations Research , Vol. 34, 2 (2009), 270--286. Google Scholar
Digital Library
- Deeparnab Chakrabarty, Yunhong Zhou, and Rajan Lukose. 2008. Online knapsack problems. In Workshop on internet and network economics (WINE) .Google Scholar
- Junting Chen and Vincent KN Lau. 2011. Convergence analysis of saddle point problems in time varying wireless systems?Control theoretical approach. IEEE Transactions on Signal Processing , Vol. 60, 1 (2011), 443--452. Google Scholar
Digital Library
- Francis YL Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang, Guohui Lin, Hing-Fung Ting, Luping Zhang, Yong Zhang, et almbox. 2015. Competitive algorithms for unbounded one-way trading. Theoretical Computer Science , Vol. 607 (2015), 35--48. Google Scholar
Digital Library
- Nikhil R. Devanur and Kamal Jain. 2012. Online Matching with Concave Returns. In Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (New York, New York, USA) (STOC '12). Association for Computing Machinery, New York, NY, USA, 137--144. Google Scholar
Digital Library
- Ran El-Yaniv, Amos Fiat, Richard M Karp, and Gordon Turpin. 2001. Optimal search and one-way trading online algorithms. Algorithmica , Vol. 30, 1 (2001), 101--139.Google Scholar
Cross Ref
- Hiroshi Fujiwara, Kazuo Iwama, and Yoshiyuki Sekiguchi. 2011. Average-case competitive analyses for one-way trading. Journal of Combinatorial Optimization , Vol. 21, 1 (2011), 83--107. Google Scholar
Digital Library
- Edward F Grove. 1991. The harmonic online k-server algorithm is competitive. In Proceedings of the twenty-third annual ACM symposium on Theory of computing. 260--266. Google Scholar
Digital Library
- Linqi Guo, Karl F Erliksson, and Steven H Low. 2017. Optimal online adaptive electric vehicle charging. In 2017 IEEE Power & Energy Society General Meeting. IEEE, 1--5.Google Scholar
Cross Ref
- Vani Gupta, Prashant Shenoy, and Ramesh K Sitaraman. 2019. Combining Renewable Solar and Open Air Cooling for Greening Internet-Scale Distributed Networks. In Proc. of ACM eEnergy. 303--314. Google Scholar
Digital Library
- Kazuo Iwama and Shiro Taketomi. 2002. Removable online knapsack problems. In International Colloquium on Automata, Languages, and Programming. Springer, 293--305. Google Scholar
Digital Library
- G Stephen Jones. 1964. Fundamental inequalities for discrete and discontinuous functional equations. J. Soc. Indust. Appl. Math. , Vol. 12, 1 (1964), 43--57.Google Scholar
Cross Ref
- Hans Kellerer, Ulrich Pferschy, and David Pisinger. 2004. Multiple Knapsack Problems .Springer Berlin Heidelberg, Berlin, Heidelberg, 285--316.Google Scholar
- Zachary Lee, Tongxin Li, and S. H. Low. 2019. ACN-Data charging dataset: analysis and applications. In Proc. of ACM eEnergy .Google Scholar
- Zachary J Lee, Daniel Chang, Cheng Jin, George S Lee, Rand Lee, Ted Lee, and Steven H Low. 2018. Large-scale adaptive electric vehicle charging. In 2018 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm). IEEE, 1--7.Google Scholar
- Qiulin Lin, Hanling Yi, John Pang, Minghua Chen, Adam Wierman, Michael Honig, and Yuanzhang Xiao. 2019. Competitive online optimization under inventory constraints. Proceedings of the ACM on Measurement and Analysis of Computing Systems , Vol. 3, 1 (2019), 1--28. Google Scholar
Digital Library
- Zhenhua Liu, Minghong Lin, Adam Wierman, Steven Low, and Lachlan LH Andrew. 2014. Greening geographical load balancing. IEEE/ACM Transactions on Networking , Vol. 23, 2 (2014), 657--671. Google Scholar
Digital Library
- Brendan Lucier, Ishai Menache, Joseph Naor, and Jonathan Yaniv. 2013. Efficient online scheduling for deadline-sensitive jobs. In Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures . 305--314. Google Scholar
Digital Library
- George S Lueker. 1998. Average-case analysis of off-line and on-line knapsack problems. Journal of Algorithms , Vol. 29, 2 (1998), 277--305. Google Scholar
Digital Library
- Jianying Luo, Lei Rao, and Xue Liu. 2013. Temporal load balancing with service delay guarantees for data center energy cost optimization. IEEE Transactions on Parallel and Distributed Systems , Vol. 25, 3 (2013), 775--784. Google Scholar
Digital Library
- Dragoslav S Mitrinovic, Josip Pecaric, and Arlington M Fink. 1991. Inequalities involving functions and their integrals and derivatives. Vol. 53. Springer Science & Business Media.Google Scholar
- John Noga and Veerawan Sarbua. 2005. An online partially fractional knapsack problem. In 8th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'05). IEEE, 5--pp. Google Scholar
Digital Library
- S. Paris, J. Leguay , L. Maggi, M. Draief, and S. Chouvardas. 2016. Online experts for admission control in SDN. In NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium. 1003--1004.Google Scholar
- David Pisinger. 2005. Where are the hard knapsack problems? Computers & Operations Research , Vol. 32, 9 (2005), 2271--2284. Google Scholar
Digital Library
- Guannan Qu and Na Li. 2018. On the exponential stability of primal-dual gradient dynamics. IEEE Control Systems Letters , Vol. 3, 1 (2018), 43--48.Google Scholar
Cross Ref
- Asfandyar Qureshi, Rick Weber, Hari Balakrishnan, John Guttag, and Bruce Maggs. 2009. Cutting the electric bill for internet-scale systems. In Proceedings of the ACM SIGCOMM 2009 conference on Data communication. 123--134. Google Scholar
Digital Library
- Pascal Schroeder, Robert Dochow, and Günter Schmidt. 2018. Optimal solutions for the online time series search and one-way trading problem with interrelated prices and a profit function. Computers & Industrial Engineering , Vol. 119 (2018), 465--471.Google Scholar
Cross Ref
- Kevin Spiteri, Rahul Urgaonkar, and Ramesh K Sitaraman. 2020. BOLA: Near-Optimal Bitrate Adaptation for Online Videos. IEEE/ACM Transactions on Networking (2020).Google Scholar
- Bo Sun, Tongxin Li, Steven H Low, and Danny HK Tsang. 2020. ORC: An Online Competitive Algorithm for Recommendation and Charging Schedule in Electric Vehicle Charging Network. In Proceedings of the Eleventh ACM International Conference on Future Energy Systems. 144--155. Google Scholar
Digital Library
- X. Tan, A. Leon-Garcia, Y. Wu, and D. H. K. Tsang. 2020. Online Combinatorial Auctions for Resource Allocation With Supply Costs and Capacity Limits. IEEE Journal on Selected Areas in Communications , Vol. 38, 4 (2020), 655--668.Google Scholar
Cross Ref
- Xiaoqi Tan, Bo Sun, Alberto Leon-Garcia, Yuan Wu, and Danny H.K. Tsang. 2020. Mechanism Design for Online Resource Allocation: A Unified Approach. In Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems (Boston, MA, USA) (SIGMETRICS '20). Association for Computing Machinery, New York, NY, USA, 11--12. Google Scholar
Digital Library
- Cong Wang and Michael Zink. 2019. Sustainable Cloud Encoding for Adaptive Bitrate Streaming over CDNs. In 2019 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) . 1--6.Google Scholar
Cross Ref
- Wei Wang, Liying Wang, Yingjie Lan, and Jean X Zhang. 2016. Competitive difference analysis of the one-way trading problem with limited information. European Journal of Operational Research , Vol. 252, 3 (2016), 879--887.Google Scholar
Cross Ref
- Lin Yang, Mohammad H Hajiesmaili, Ramesh Sitaraman, Adam Wierman, Enrique Mallada, and Wing S Wong. 2020. Online Linear Optimization with Inventory Management Constraints. Proceedings of the ACM on Measurement and Analysis of Computing Systems , Vol. 4, 1 (2020), 1--29. Google Scholar
Digital Library
- Lin Yang, Mohammad H Hajiesmaili, and Wing S Wong. 2019. Online Linear Programming with Uncertain Constraints. In 2019 53rd Annual Conference on Information Sciences and Systems (CISS). IEEE, 1--6.Google Scholar
- Zijun Zhang, Zongpeng Li, and Chuan Wu. 2017. Optimal Posted Prices for Online Cloud Resource Allocation. Proc. ACM Meas. Anal. Comput. Syst. , Vol. 1, 1 (June 2017), bibinfonumpages26 pages. Google Scholar
Digital Library
- Zizhan Zheng and Ness Shroff. 2014. Online welfare maximization for electric vehicle charging with electricity cost. In Proceedings of the 5th international conference on Future energy systems . 253--263. Google Scholar
Digital Library
- Zizhan Zheng and Ness B Shroff. 2016. Online multi-resource allocation for deadline sensitive jobs with partial values in the cloud. In IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications. IEEE, 1--9.Google Scholar
Digital Library
- Yunhong Zhou, Deeparnab Chakrabarty, and Rajan Lukose. 2008. Budget constrained bidding in keyword auctions and online knapsack problems. In International Workshop on Internet and Network Economics. Springer, 566--576. Google Scholar
Digital Library
Index Terms
Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
Recommendations
Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
SIGMETRICS '21We 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 ...
Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
SIGMETRICS '21: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer SystemsWe 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 ...
Online Knapsack Revisited
We investigate the online variant of the (Multiple) Knapsack Problem: an algorithm is to pack items, of arbitrary sizes and profits, in k knapsacks (bins) without exceeding the capacity of any bin. We study two objective functions: the sum and the ...






Comments