Online peak-aware energy scheduling with untrusted advice
| Autor: | Jian Li, Mohammad H. Hajiesmaili, Zhenhua Liu, Jessica Maghakian, Russell Lee, Ramesh K. Sitaraman |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Mathematical optimization
Competitive analysis Deterministic algorithm Computer science Pareto principle 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology Grid 01 natural sciences Randomized algorithm 010201 computation theory & mathematics Robustness (computer science) 0202 electrical engineering electronic engineering information engineering Online algorithm Advice (complexity) |
| Zdroj: | e-Energy |
| ISSN: | 2770-5331 |
| Popis: | This paper studies the online energy scheduling problem in a hybrid model where the cost of energy is proportional to both the volume and peak usage, and where energy can be either locally generated or drawn from the grid. Inspired by recent advances in online algorithms with Machine Learned (ML) advice, we develop parameterized deterministic and randomized algorithms for this problem such that the level of reliance on the advice can be adjusted by a trust parameter. We then analyze the performance of the proposed algorithms using two performance metrics: robustness that measures the competitive ratio as a function of the trust parameter when the advice is inaccurate, and consistency for competitive ratio when the advice is accurate. Since the competitive ratio is analyzed in two different regimes, we further investigate the Pareto optimality of the proposed algorithms. Our results show that the proposed deterministic algorithm is Pareto-optimal, in the sense that no other online deterministic algorithms can dominate the robustness and consistency of our algorithm. Furthermore, we show that the proposed randomized algorithm dominates the Pareto-optimal deterministic algorithm. Our large-scale empirical evaluations using real traces of energy demand, energy prices, and renewable energy generations highlight that the proposed algorithms outperform worst-case optimized algorithms and fully data-driven algorithms. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|