Whether to Charge an Electric Vehicle or Not? A Near-Optimal Online Approach

被引:0
|
作者
Deng, Ruilong [1 ]
Liang, Hao [1 ]
机构
[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 1H9, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Demand response; EV charging; online scheduling; primal-dual approach; real-time price; smart grid; DEMAND RESPONSE; CONSUMPTION;
D O I
暂无
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
The electric vehicle (EV), a promising technique to reduce transportation emissions, is one of the most important household appliances for demand response. Under the real-time pricing environment in smart grid, EV owners are faced with the EV charging scheduling problem to minimize electricity cost. Existing works focused on offline solutions or Markov decision processes which require full or statistical priori knowledge of future real-time prices (RTPs). This may not be practical as it is difficult to predict future RTPs especially for long horizons. In this paper, we propose a near-optimal online algorithm via primal-dual approach, requiring very little priori knowledge, i.e., the upper bound of future RTPs. The competitive ratio of the online algorithm is derived. It is demonstrated with real price data from Ameren Corporation that our proposed online algorithm can result in considerable economic savings, compared with existing schemes which only consider RTPs.
引用
收藏
页数:5
相关论文
共 50 条
  • [41] Near-optimal terrain collision
    Malaek, S. M.
    Abbasi, A.
    2006 IEEE AEROSPACE CONFERENCE, VOLS 1-9, 2006, : 2990 - +
  • [42] Near-optimal adaptive polygonization
    Seibold, W
    Joy, KI
    COMPUTER GRAPHICS INTERNATIONAL, PROCEEDINGS, 1999, : 206 - 213
  • [43] Near-Optimal Light Spanners
    Chechik, Shiri
    Wulff-Nilsen, Christian
    ACM TRANSACTIONS ON ALGORITHMS, 2018, 14 (03)
  • [44] Near-optimal block alignments
    Tseng, Kuo-Tsung
    Yang, Chang-Biau
    Huang, Kuo-Si
    Peng, Yung-Hsing
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2008, E91D (03): : 789 - 795
  • [45] Near-optimal list colorings
    Molloy, M
    Reed, B
    RANDOM STRUCTURES & ALGORITHMS, 2000, 17 (3-4) : 376 - 402
  • [46] Near-optimal sequence alignment
    Vingron, M
    CURRENT OPINION IN STRUCTURAL BIOLOGY, 1996, 6 (03) : 346 - 352
  • [47] A Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet Classes
    Li, Fei
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, 6831 : 222 - 233
  • [48] On Submodular Set Cover Problems for Near-Optimal Online Kernel Basis Selection
    Pradhan, Hrusikesha
    Koppel, Alec
    Rajawat, Ketan
    2022 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2022, : 4168 - 4172
  • [49] MicroarrayDesigner: an online search tool and repository for near-optimal microarray experimental designs
    Sacan, Ahmet
    Ferhatosmanoglu, Nilgun
    Ferhatosmanoglu, Hakan
    BMC BIOINFORMATICS, 2009, 10 : 304
  • [50] A Near-Optimal Semi-Online Algorithm for Maximizing Throughput Scheduling Problem
    Tao, Ye
    Chao, Zhijun
    Xi, Yugeng
    IMECS 2009: INTERNATIONAL MULTI-CONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2009, : 453 - 458