DocumentCode :
2843166
Title :
A Block Deepening Genetic Programming for Scheduling of Direct Load Control
Author :
Yao, Leehter ; Hsu, Tsong-Hai ; Lin, Chin-Chin ; Lin, Cheng-Han
Author_Institution :
Nat. Taipei Univ. of Technol., Taipei
fYear :
2007
fDate :
15-17 April 2007
Firstpage :
821
Lastpage :
827
Abstract :
A modified genetic programming (GP) called block deepening GP (BDGP) is proposed in this paper to optimize the scheduling of direct load control (DLC). The optimal scheduling obtained by BDGP is a both profit-based and fairness-based DLC scheduling strategy. The scheduling arranged by the BDGP not only individually satisfies the load to be shed at every time step while minimizes utility´s revenue loss due to DLC, but also level off the accumulated shedding time of each load group, thus avoiding customers´ complaints about fairness of scheduling. BDGP is composed of a master GP as well as a slave GP. As the master GP evaluates the status combination of all load groups at every time step, it calls upon the slave GP simultaneously looking ahead D more steps to evaluate the best load difference could result. The best status combinations in the following D steps associated with the status combination under evaluation are determined globally in the following D-steps block. Computer simulations are made to verify the effectiveness and efficiency of the proposed BDGP.
Keywords :
customer satisfaction; genetic algorithms; load regulation; profitability; public utilities; scheduling; D-steps block; block deepening genetic programming; direct load control; modified genetic programming; optimal scheduling; Dynamic programming; Dynamic scheduling; Genetic programming; Linear programming; Load flow control; Master-slave; Optimal control; Optimal scheduling; Processor scheduling; Uncertainty; direct load control; genetic programming; load profile; scheduling optimization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networking, Sensing and Control, 2007 IEEE International Conference on
Conference_Location :
London
Print_ISBN :
1-4244-1076-2
Electronic_ISBN :
1-4244-1076-2
Type :
conf
DOI :
10.1109/ICNSC.2007.372887
Filename :
4239100
Link To Document :
بازگشت