User satisfaction-based genetic algorithm for load shifting in smart grid

被引:1
|
作者
Touzene A. [1 ]
Al Moqbali M. [1 ]
机构
[1] Department of Computer Science, Sultan Qaboos University, Muscat
关键词
genetic algorithms; load shifting; optimization; service level agreement; Smart grid;
D O I
10.1080/1206212X.2023.2232167
中图分类号
学科分类号
摘要
This paper presents a new load shifting strategy for smart grid systems based on both power consumers’ day-ahead power forecast and their Service Level Agreement (SLA) in order to reduce their electricity bills, guaranties user satisfaction, and for smart grid system to reduce as well the overall power consumption at the peak hours. We provide an analytical model that formulated the load shifting process as a cost minimization problem. A Genetic Algorithm (GA) approach based on a two dimensional chromosome representation is used to solve the optimization problem by collecting a day-ahead forecast and SLAs as an input from the power consumers. The output of the GA consists of giving the best power task plan for the day-ahead which satisfy all consumers in terms of minimizing their consumption bill and reduces the peak demand. Experimental results using simulation show that the proposed load shifting strategy not only guaranty SLA requirements but it reduces the total cost by more than 16%, and in general it achieves a substantial cost savings of 38% compared to the recent algorithms from the literature. © 2023 Informa UK Limited, trading as Taylor & Francis Group.
引用
收藏
页码:444 / 451
页数:7
相关论文
共 50 条
  • [1] Satisfaction-based query load balancing
    Quiane-Ruiz, Jorge-Arnulfo
    Lamarre, Philippe
    Valduriez, Patrick
    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2006: COOPIS, DOA, GADA, AND ODBAS, PT 1, PROCEEDINGS, 2006, 4275 : 36 - 53
  • [2] Load Shifting in the Smart Grid: To Participate or Not?
    Wang, Yunpeng
    Saad, Walid
    Mandayam, Narayan B.
    Poor, H. Vincent
    IEEE TRANSACTIONS ON SMART GRID, 2016, 7 (06) : 2604 - 2614
  • [3] User Satisfaction-Based Scheduling Algorithm for Uplink Transmission in Long Term Evolution System
    Wu, Jung-Shyr
    Yang, Shun-Fang
    Hsu, Chia-Ming
    Tu, Jiun-Yu
    Jiang, Jehn-Ruey
    PROCEEDINGS OF THE 2012 IEEE 18TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS 2012), 2012, : 930 - 935
  • [4] Towards a language for a satisfaction-based selection of Grid services
    Andreozzi, Sergio
    Ciancarini, Paolo
    Montesi, Danilo
    Moretti, Rocco
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2006, 3911 : 723 - 730
  • [5] On the Applicability of a User Satisfaction-Based Reward for Dialogue Policy Learning
    Ultes, Stefan
    Miehle, Juliana
    Minker, Wolfgang
    ADVANCED SOCIAL INTERACTION WITH AGENTS, 2019, 510 : 211 - 217
  • [6] Enhanced genetic algorithm based load balancing in grid
    Department of Computer Science and Engineering, M. M. Engg. College, M. M. University, Mullana, Ambala, Haryana 133203, India
    Goyal, S.K., 1600, International Journal of Computer Science Issues (IJCSI) (09): : 3 - 2
  • [7] Dynamic Energy Trading and Load Scheduling Algorithm for the End-User in Smart Grid
    Liu, Didi
    Xiao, Jiawen
    Liu, Junxiu
    Yuan, Xiaoming
    Zhang, Suping
    IEEE ACCESS, 2020, 8 : 189632 - 189645
  • [8] Genetic Algorithm Based Peak Load Management for Low Voltage Consumers in Smart Grid - A Case Study
    Esther, B. Priya
    Kumar, K. Sathish
    Venkatesh, S.
    Gokulakrishnan, G.
    Rani, M. S. Asha
    INFORMATION AND COMMUNICATION TECHNOLOGY FOR INTELLIGENT SYSTEMS (ICTIS 2017) - VOL 2, 2018, 84 : 445 - 453
  • [9] Ensuring the reduction in peak load demands based on load shifting DSM strategy for smart grid applications
    Praveen, Mande
    Rao, G. V. Sivakrishna
    INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND DATA SCIENCE, 2020, 167 : 2599 - 2605
  • [10] Cell-Edge User Satisfaction-Based Dynamic CoMP Clustering with Load Awareness in Ultra-Dense Networks
    Nuanyai, Kittipong
    Tarbut, Phornthip
    Chantaraskul, Soamsiri
    INTERNATIONAL JOURNAL OF NETWORKED AND DISTRIBUTED COMPUTING, 2025, 13 (01)