A Block Deepening Genetic Programming for Scheduling of Direct Load Control

Created by W.Langdon from gp-bibliography.bib Revision:1.3973

@InProceedings{conf/icnsc/YaoHLL07,
  author =       "Leehter Yao and Tsong-Hai Hsu and Chin-chin Lin and 
                 Cheng-Han Lin",
  title =        "A Block Deepening Genetic Programming for Scheduling
                 of Direct Load Control",
  booktitle =    "IEEE International Conference on Networking, Sensing
                 and Control, ICNSC 2007",
  year =         "2007",
  pages =        "821--827",
  address =      "London",
  month =        "15-17 " # apr,
  publisher =    "IEEE",
  keywords =     "genetic algorithms, genetic programming, D-steps
                 block, block deepening genetic programming, direct load
                 control, modified genetic programming, optimal
                 scheduling, customer satisfaction, load regulation,
                 profitability, public utilities, scheduling",
  ISBN =         "1-4244-1076-2",
  DOI =          "doi:10.1109/ICNSC.2007.372887",
  size =         "7 pages",
  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.",
  notes =        "p821 scheduling of DLC aims at reducing system peak
                 loads and system operation costs by coordinating DLC
                 with unit commitment",
  bibdate =      "2009-03-30",
  bibsource =    "DBLP,
                 http://dblp.uni-trier.de/db/conf/icnsc/icnsc2007.html#YaoHLL07",
}

Genetic Programming entries for Leehter Yao Tsong-Hai Hsu Chin-chin Lin Cheng-Han Lin

Citations