A Fast Algorithm for Optimal Power Scheduling of Large-Scale Appliances with Temporally-Spatially Coupled Constraints

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.