Title :
Characterizing flexibility of an aggregation of deferrable loads
Author :
He Hao ; Wei Chen
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, Berkeley, CA, USA
Abstract :
Flexibility from distributed deferrable loads presents an enormous potential to provide fast ramping resources that are necessary to vastly integrate renewable energy resources. In this paper, we study aggregation, characterization, and scheduling of a collection of deferrable loads to facilitate integrating renewable generation into the power system. A generation profile is called exactly adequate if there exists a scheduling policy that could allocate the power to satisfy the energy requirements of all deferrable loads without surplus or deficit. We provide sufficient and/or necessary characterizations on the adequacy of allocated generation profiles. Moreover, we propose a novel scheduling algorithm to service deferrable loads. Heuristic algorithms such as Earliest Deadline First (EDF) and Least Laxity First (LLF) policies are used in numerical experiments to compare with the proposed algorithm. Extensive simulations show that our scheduling policy generally can fulfill the energy requirements of all loads without surplus or deficit for exactly adequate generation profiles, while the EDF and LLF policies cannot meet this objective in most cases.
Keywords :
power system management; renewable energy sources; scheduling; EDF policy; LLF policy; Least Laxity First policy; distributed deferrable load; earliest deadline first policy; energy requirements; flexibility characterization; heuristic algorithm; renewable energy resource; renewable generation; scheduling policy; Batteries; Heuristic algorithms; Load modeling; Scheduling; Scheduling algorithms; Upper bound; Vectors;
Conference_Titel :
Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on
Conference_Location :
Los Angeles, CA
Print_ISBN :
978-1-4799-7746-8
DOI :
10.1109/CDC.2014.7040020