Design of an energy consumption scheduler based on genetic algorithms in the smart grid

Authors:
Junghoon Lee;Gyung-Leen Park;Ho-Young Kwak;Hongbeom Jeon
Affiliations:
Dept. of Computer Science and Statistics, Jeju National University;Dept. of Computer Science and Statistics, Jeju National University;Dept. of Computer Engineering, Jeju National University;Smart Green Development Center, KT, Republic of Korea
Venue:
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part I
Year:
2011

Citing 3
Cited 2

Zigbee Wireless Networking

Zigbee Wireless Networking
An evolutionary computation approach to electricity trade negotiation

Advances in Engineering Software
Power consumption scheduling for peak load reduction in smart grid homes

Proceedings of the 2011 ACM Symposium on Applied Computing

Genetic algorithm-based charging task scheduler for electric vehicles in smart transportation

ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part I
Genetic algorithm-based demand response scheme for electric vehicle charging

International Journal of Intelligent Information and Database Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper designs an energy consumption scheduler capable of reducing peak power load in smart places based on genetic algorithms and measures its performance. The proposed scheme follows the task model consisting of actuation time, operation length, deadline, and a consumption profile, while each task can be either nonpreemptive or preemptive. Each schedule is encoded to a gene, each element of which element represents the start time for nonpreemptive tasks and the precalculated combination index for preemptive tasks. The evolution process includes random initialization, Roulette Wheel selection, uniform crossover, and replacement for duplicated genes. The performance measurement result, obtained from a prototype implementation of both the proposed genetic scheduler and the backtracking-based optimal scheduler, shows that the proposed scheme can always meet the time constraint of each task and keeps the accuracy loss below 4.7 %, even for quite a large search space. It also achieves uncomparable execution time of just a few seconds, which makes it appropriate in the real-world deployment.