Abstract
This paper considers the problem of online linear optimization with inventory management constraints. Specifically, we consider an online scenario where a decision maker needs to satisfy her time-varying demand for some units of an asset, either from a market with a time-varying price or from her own inventory. In each time slot, the decision maker is presented a (linear) price and must immediately decide the amount to purchase for covering the demand and/or for storing in the inventory for future use. The inventory has a limited capacity and can be used to buy and store assets at low price and cover the demand when the price is high. The ultimate goal of the decision maker is to cover the demand at each time slot while minimizing the cost of buying assets from the market. We propose ARP, an online algorithm for linear programming with inventory constraints, and ARPRate, an extended version that handles rate constraints to/from the inventory. Both ARP and ARPRate achieve optimal competitive ratios, meaning that no other online algorithm can achieve a better theoretical guarantee. To illustrate the results, we use the proposed algorithms in a case study focused on energy procurement and storage management strategies for data centers.
- 2016. Wholesale Electricity Market Design Initiatives in the United States: Survey and Research Needs. EPRI,Technical Results, available at https://www.epri.com/ pages/ product/ 000000003002009273/ (2016).Google Scholar
- 2020. Eastern and Western Data Sets. available at https://www.nrel.gov/grid/eastern-western-wind-data.html.Google Scholar
- 2020. Environmental Responsibility Report - Apple. available at https://www.apple.com/environment/pdf/Apple_ Environmental_Responsibility_Report_2018.pdf.Google Scholar
- 2020. Google Data Center in Changhua County, Taiwan. available at https://www.google.com/about/datacenters/ inside/locations/changhua-county/.Google Scholar
- 2020. Google Data Center in St. Ghislain, Belgium. available at https://www.google.com/about/datacenters/inside/ locations/st-ghislain/.Google Scholar
- 2020. Open Power System Data. available at https://data.open-power-system-data.org/.Google Scholar
- 2020. Tesla's Powerpack proposes battery power for data centers. available at https://www.datacenterdynamics.com/ analysis/teslas-powerpack-proposes-battery-power-for-data-centers/.Google Scholar
- Sohaib Ahmad, Arielle Rosenthal, Mohammad H Hajiesmaili, and Ramesh K Sitaraman. 2019. Learning from Optimal: Energy Procurement Strategies for Data Centers. In Proc. of ACM eEnergy. 326--330.Google Scholar
Digital Library
- M Ajtai, N Megiddo, and OWaarts. 2001. Improved algorithms and analysis for secretary problems and generalizations. SIAM Journal on Discrete Mathematics 14, 1 (2001), 1--27.Google Scholar
Digital Library
- Susanne Albers. 2017. On Energy Conservation in Data Centers. In Proc. of ACM SPAA. 35--44.Google Scholar
Digital Library
- Susanne Albers and Jens Quedenfeld. 2018. Optimal Algorithms for Right-Sizing Data Centers. In Proc. of ACM SPAA. 363--372.Google Scholar
Digital Library
- 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 Proc. of IEEE/ACM IWQoS. 1--10.Google Scholar
Cross Ref
- Baruch Awerbuch and Robert Kleinberg. 2008. Online linear optimization and adaptive routing. J. Comput. System Sci. 74, 1 (2008), 97--114.Google Scholar
Digital Library
- Moshe Babaioff, Nicole Immorlica, David Kempe, and Robert Kleinberg. 2008. Online auctions and generalized secretary problems. ACM SIGecom Exchanges 7, 2 (2008), 7.Google Scholar
Digital Library
- Luiz André Barroso and Urs Hölzle. 2007. The case for energy-proportional computing. Computer 12 (2007), 33--37.Google Scholar
Digital Library
- H Böckenhauer, D Komm, R Královi, and P Rossmanith. 2014. The online knapsack problem: Advice and randomization. Theoretical Computer Science 527 (2014), 61--72.Google Scholar
Cross Ref
- A. Borodin and R El-Yaniv. 1998. Online computation and competitive analysis. Cambridge University Press.Google Scholar
Digital Library
- Niv Buchbinder and Joseph Naor. 2009. Online primal-dual algorithms for covering and packing. Mathematics of Operations Research 34, 2 (2009), 270--286.Google Scholar
Digital Library
- CAISO 2020. CAISO electricity market. available at https://www.caiso.com/.Google Scholar
- Santosh Chalise, Amir Golshani, Shekhar Raj Awasthi, Shanshan Ma, Bijen Raj Shrestha, Labi Bajracharya, Wei Sun, and Reinaldo Tonkoski. 2015. Data center energy systems: Current technology and future direction. In Proc. of IEEE PES.Google Scholar
Cross Ref
- Chi-Kin Chau and Lin Yang. 2016. Competitive online algorithms for geographical load balancing in data centers with energy storage. In Proceedings of the 5th International Workshop on Energy Efficient Data Centres. 1.Google Scholar
Digital Library
- Chi-Kin Chau, Guanglin Zhang, and Minghua Chen. 2016. Cost minimizing online algorithms for energy storage management with worst-case guarantee. IEEE Transactions on Smart Grid 7, 6 (2016), 2691--2702.Google Scholar
Cross Ref
- Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, and Shenghuo Zhu. 2012. Online optimization with gradual variations. In Proc. of COLT. 6--1.Google Scholar
- Aron Dobos. 2014. PVWatts version 5 manual. National Renewable Energy Laboratory Golden, CO.Google Scholar
- R. El-Yaniv, A. Fiat, R. M. Karp, and G Turpin. 2001. Optimal search and one-way trading online algorithms. Algorithmica 30, 1 (2001), 101--139.Google Scholar
Cross Ref
- ERCOT 2020. ERCOT Electricity Market. available at http://www.ercot.com.Google Scholar
- Richard Evans and Jim Gao. 2016. DeepMind AI Reduces Google Data Centre Cooling Bill by 40%. https://deepmind.com/blog/deepmind-ai-reduces-google-data-centre-cooling-bill-40/ (2016).Google Scholar
- Guy Even, Moti Medina, and Dror Rawitz. 2018. Online Generalized Caching with Varying Weights and Costs. In Proc. of ACM SPAA. 205--212.Google Scholar
Digital Library
- FACTs 2020. Comparison of commercial battery types. available at https://en.wikipedia.org/wiki/Comparison_of_ commercial_battery_types.Google Scholar
- German Electricity Market 2020. German Electricity Market.Google Scholar
- Mahdi Ghamkhari, Adam Wierman, and Hamed Mohsenian-Rad. 2016. Energy Portfolio Optimization of Data Centers. IEEE Transactions on Smart Grid (2016).Google Scholar
- Sriram Govindan, Di Wang, Anand Sivasubramaniam, and Bhuvan Urgaonkar. 2013. Aggressive Datacenter Power Provisioning with Batteries. ACM Transactions on Computing Systems 31, 1 (2013), 2:1--2:31.Google Scholar
Digital Library
- Yuanxiong Guo and Yuguang Fang. 2013. Electricity cost saving strategy in data centers by using energy storage. IEEE Transactions Parallel and Distributed Systems 24, 6 (2013), 1149--1160.Google Scholar
Digital Library
- Mohammad H Hajiesmaili, Chi-Kin Chau, Minghua Chen, and Longbu Huang. 2016. Online microgrid energy generation scheduling revisited: The benefits of randomization and interval prediction. In Proc. of ACM eEnergy.Google Scholar
Digital Library
- Mohammad H Hajiesmaili, Minghua Chen, Enrique Mallada, and Chi-Kin Chau. 2017. Crowd-Sourced Storage-Assisted Demand Response in Microgrids. In Proc. of ACM eEnergy. 91--100.Google Scholar
Digital Library
- Mohammad H Hajiesmaili, Lei Deng, Minghua Chen, and Zongpeng Li. 2017. Incentivizing device-to-device load balancing for cellular networks: An online auction design. IEEE Journal on Selected Areas in Communications 35, 2 (2017), 265--279.Google Scholar
Digital Library
- Elad Hazan et al. 2016. Introduction to online convex optimization. Foundations and Trends® in Optimization 2, 3--4 (2016), 157--325.Google Scholar
- Longbo Huang, Jean Walrand, and Kannan Ramchandran. 2012. Optimal demand response with energy storage management. In Proc. IEEE SmartGridComm. 61--66.Google Scholar
Cross Ref
- Adam Kalai and Santosh Vempala. 2002. Geometric algorithms for online optimization. In Journal of Computer and System Sciences.Google Scholar
- Kia Khezeli and Eilyan Bitar. 2018. Risk-sensitive learning and pricing for demand response. IEEE Transactions on Smart Grid 9, 6 (2018), 6000--6007.Google Scholar
Cross Ref
- Minghong Lin, Adam Wierman, Lachlan LH Andrew, and Eno Thereska. 2013. Dynamic right-sizing for powerproportional data centers. IEEE/ACM Transactions on Networking 21, 5 (2013), 1378--1391.Google Scholar
Digital Library
- 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 3, 1 (2019), 10.Google Scholar
Digital Library
- J. Lorenz, K. Panagiotou, and A Steger. 2009. Optimal algorithms for k-search with application in option pricing. Algorithmica 55, 2 (2009), 311--328.Google Scholar
Digital Library
- Zhoujia Mao, Can Emre Koksal, and Ness B Shroff. 2016. Optimal online scheduling with arbitrary hard deadlines in multihop communication networks. IEEE/ACM Transactions on Networking 24, 1 (2016), 177--189.Google Scholar
Digital Library
- Esther Mohr, Iftikhar Ahmad, and Günter Schmidt. 2014. Online algorithms for conversion problems: a survey. Surveys in Operations Research and Management Science 19, 2 (2014), 87--104.Google Scholar
Cross Ref
- Erik Nygren, Ramesh K Sitaraman, and Jennifer Sun. 2010. The akamai network: a platform for high-performance internet applications. ACM SIGOPS Operating Systems Review 44, 3 (2010), 2--19.Google Scholar
Digital Library
- NYISO 2020. NYISO Electricity Market. available at http://www.nyiso.com.Google Scholar
- Francesco Orabona and Dávid Pál. 2015. Scale-free algorithms for online linear optimization. In Proc. of ALT. 287--301.Google Scholar
Digital Library
- Darshan S Palasamudram, Ramesh K Sitaraman, Bhuvan Urgaonkar, and Rahul Urgaonkar. 2012. Using batteries to reduce the power costs of internet-scale distributed networks. In Proc. of ACM SoCC.Google Scholar
Digital Library
- Xiaoqi Ren, Palma London, Juba Ziani, and Adam Wierman. 2018. Datum: Managing Data Purchasing and Data Placement in a Geo-Distributed Data Market. IEEE/ACM Transactions on Networking 26, 2 (2018), 893--905.Google Scholar
Digital Library
- Richard S Sutton and Andrew G Barto. 2018. Reinforcement learning: An introduction. MIT press.Google Scholar
Digital Library
- MEV Team et al. 2008. A guide to understanding battery specifications. (2008).Google Scholar
- Jinlong Tu, Lian Lu, Minghua Chen, and Ramesh K Sitaraman. 2013. Dynamic provisioning in next-generation data centers with on-site power production. In Proc. of ACM eEnergy. 137--148.Google Scholar
Digital Library
- R. Urgaonkar, B. Urgaonkar, M.J. Neely, and A. Sivasubramaniam. 2011. Optimal power cost management using stored energy in data centers. In Proc. of ACM SIGMETRICS.Google Scholar
- Peter M van de Ven, Nidhi Hegde, Laurent Massoulié, and Theodoros Salonidis. 2013. Optimal control of end-user energy storage. IEEE Transactions on Smart Grid 4, 2 (2013), 789--797.Google Scholar
Cross Ref
- Di Wang, Chuangang Ren, Anand Sivasubramaniam, Bhuvan Urgaonkar, and Hosam Fathy. 2012. Energy storage in datacenters: what, where, and how much?. In ACM SIGMETRICS Performance Evaluation Review, Vol. 40. 187--198.Google Scholar
Digital Library
- Hong Xu and Baochun Li. 2014. Reducing electricity demand charge for data centers with partial execution. In Proc. of ACM eEnergy. 51--61.Google Scholar
Digital Library
- Lin Yang, Lei Deng, Mohammad H Hajiesmaili, Cheng Tan, and Wing Shing Wong. 2018. An optimal algorithm for online non-convex learning. Proceedings of the ACM on Measurement and Analysis of Computing Systems 2, 2 (2018), 25.Google Scholar
Digital Library
- Lin Yang, Mohammad H Hajiesmaili, and Wing SWong. 2019. Online Linear Programming with Uncertain Constraints. In Proc. of IEEE CISS. 1--6.Google Scholar
- Lin Yang, Wing Shing Wong, and Mohammad H Hajiesmaili. 2017. An optimal randomized online algorithm for QoS buffer management. Proceedings of the ACM on Measurement and Analysis of Computing Systems 1, 2 (2017), 36.Google Scholar
Digital Library
- Ying Zhang, Mohammad H Hajiesmaili, Sinan Cai, Minghua Chen, and Qi Zhu. 2018. Peak-aware online economic dispatching for microgrids. IEEE Transactions on Smart Grid 9, 1 (2018), 323--335.Google Scholar
Cross Ref
- Zijun Zhang, Zongpeng Li, and ChuanWu. 2017. Optimal posted prices for online cloud resource allocation. Proceedings of the ACM on Measurement and Analysis of Computing Systems 1, 1 (2017), 23.Google Scholar
Digital Library
- Wenli Zheng, Kai Ma, and Xiaorui Wang. 2014. Exploiting thermal energy storage to reduce data center capital and operating expenses. In Proc. IEEE HPCA. 132--141.Google Scholar
Cross Ref
- Haihang Zhou, Jianguo Yao, Haibing Guan, and Xue Liu. 2015. Comprehensive understanding of operation cost reduction using energy storage for IDCs. In Proc. IEEE INFOCOM. 2623--2631.Google Scholar
Cross Ref
- Ruiting Zhou, Zongpeng Li, and Chuan Wu. 2015. An online procurement auction for power demand response in storage-assisted smart grids. In Proc. of IEEE INFOCOM. 2641--2649.Google Scholar
Cross Ref
Recommendations
Online Linear Optimization with Inventory Management Constraints
This paper considers the problem of online linear optimization with inventory management constraints. Specifically, we consider an online scenario where a decision maker needs to satisfy her timevarying demand for some units of an asset, either from a ...
Competitive bidding strategies for online linear optimization with inventory management constraints
AbstractThis paper develops competitive bidding strategies for an online linear optimization problem with inventory management constraints in both cost minimization and profit maximization settings. In the minimization problem, a decision ...
Online Linear Optimization with Inventory Management Constraints
SIGMETRICS '20: Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer SystemsThis paper considers the problem of online linear optimization with inventory management constraints. Specifically, we consider an online scenario where a decision maker needs to satisfy her timevarying demand for some units of an asset, either from a ...






Comments