Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
May 17, 2019 Β· Declared Dead Β· π Energy-Efficient Computing and Networking
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Jianing Zhai, Sid Chi-Kin Chau, Minghua Chen
arXiv ID
1905.07145
Category
cs.DS: Data Structures & Algorithms
Cross-listed
math.OC
Citations
6
Venue
Energy-Efficient Computing and Networking
Last Checked
4 months ago
Abstract
Energy markets with retail choice enable customers to switch energy plans among competitive retail suppliers. Despite the promising benefits of more affordable prices and better savings to customers, there appears subsided participation in energy retail markets from residential customers. One major reason is the complex online decision-making process for selecting the best energy plan from a multitude of options that hinders average consumers. In this paper, we shed light on the online energy plan selection problem by providing effective competitive online algorithms. We first formulate the online energy plan selection problem as a metrical task system problem with temporally dependent switching costs. For the case of constant cancellation fee, we present a 3-competitive deterministic online algorithm and a 2-competitive randomized online algorithm for solving the energy plan selection problem. We show that the two competitive ratios are the best possible among deterministic and randomized online algorithms, respectively. We further extend our online algorithms to the case where the cancellation fee is linearly proportional to the residual contract duration. Through empirical evaluations using real-world household and energy plan data, we show that our deterministic online algorithm can produce on average 14.6% cost saving, as compared to 16.2% by the offline optimal algorithm, while our randomized online algorithm can further improve cost saving by up to 0.5%.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
π
π
The Cartographer
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted