Scheduling of Direct Load Control Using Genetic Programming

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

@Article{Yao:2011:IJICIC,
  author =       "Leehter Yao and Yin-Chieh Chou and Chin-Chin Lin",
  title =        "Scheduling of Direct Load Control Using Genetic
                 Programming",
  journal =      "International Journal of Innovative Computing,
                 Information and Control (IJICIC)",
  year =         "2011",
  volume =       "7",
  number =       "5A",
  pages =        "2515",
  month =        may,
  keywords =     "genetic algorithms, genetic programming, direct load
                 control, optimisation, scheduling",
  ISSN =         "1349-418X",
  annote =       "The Pennsylvania State University CiteSeerX Archives",
  bibsource =    "OAI-PMH server at citeseerx.ist.psu.edu",
  language =     "en",
  oai =          "oai:CiteSeerX.psu:10.1.1.471.5528",
  rights =       "Metadata may be used without restrictions as long as
                 the oai identifier remains attached to it.",
  URL =          "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.471.5528",
  URL =          "http://www.ijicic.org/ijicic-10-01110.pdf",
  size =         "14 pages",
  abstract =     "A modified Genetic Programming (GP) called block
                 deepening GP (BDGP) is proposed in this paper to
                 optimise the scheduling of direct load control (DLC). A
                 search scheme similar to the breadth first search
                 approach in artificial intelligence is adopted in the
                 BDGP to search for the optimal scheduling arrangements.
                 BDGP is composed of a master GP and 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
                 to simultaneously look ahead an additional D steps to
                 evaluate the best possible load difference that 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-step block. Since the proposed BDGP optimises the
                 scheduling for DLC aiming to minimise the load
                 difference in the next time step and the following D
                 time steps, the scheduling results obtained by BDGP are
                 closer to the globally optimal solution.",
}

Genetic Programming entries for Leehter Yao Yin-Chieh Chou Chin-chin Lin

Citations