Paper Info
Title
A Fast Algorithm for Optimal Power Scheduling of Large-Scale Appliances with Temporally-Spatially Coupled Constraints
Abstract
The scheduling of appliance power consumption is one of the main tasks in demand response management in smart grids. In many scenarios, it requires us to optimally schedule a large number of appliances with limited computational resources, thus the computational efficiency becomes a major concern of algorithm design. To this end, a novel algorithm is proposed based on KKT conditions to solve the optimal power scheduling problem with temporally-spatially coupled constraints. We show the algorithm is much more efficient than conventional algorithms, e.g., dual decomposition, and less sensitive to the problem parameter setting, as verified by numerical examples.
Year
DOI
Venue
2018
10.1109/SmartGridComm.2018.8587553
2018 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)
Keywords
Field
DocType
Appliances power consumption scheduling,computational efficiency,KKT conditions,dual decomposition
Algorithm design,Job shop scheduling,Smart grid,Computer science,Scheduling (computing),Demand response,Algorithm,Power demand,Karush–Kuhn–Tucker conditions,Power consumption
Conference
ISBN
Citations 
PageRank 
978-1-5386-7955-5
0
0.34
References 
Authors
7
3
Name
Order
Citations
PageRank
Zhenwei Guo122.39
Qinmin Yang229523.86
Zaiyue Yang318815.59