Priority Dispatching Rules-based Genetic Representation For Hybrid Evolutionary Algorithm For Flexible Job Shop Scheduling Problem

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

@InProceedings{tanev:2002:GECCO:workshop,
  title =        "Priority Dispatching Rules-based Genetic
                 Representation For Hybrid Evolutionary Algorithm For
                 Flexible Job Shop Scheduling Problem",
  author =       "Ivan T. Tanev and Takashi Uozumi and 
                 Yoshiharu Morotome",
  pages =        "187--192",
  booktitle =    "{GECCO 2002}: Proceedings of the Bird of a Feather
                 Workshops, Genetic and Evolutionary Computation
                 Conference",
  editor =       "Alwyn M. Barry",
  year =         "2002",
  month =        "8 " # jul,
  publisher =    "AAAI",
  address =      "New York",
  publisher_address = "445 Burgess Drive, Menlo Park, CA 94025",
  keywords =     "genetic algorithms, genetic programming",
  abstract =     "the genetic representation in the developed hybrid
                 evolutionary algorithm, applied for real-world case of
                 flexible job shop scheduling problem. The hybrid
                 evolutionary algorithm, which combines
                 priority-dispatching rules (PDRs) with genetic
                 algorithms (GA), is discussed. PDRs offer the advantage
                 of simplicity and low computational cost. GA
                 incorporated into proposed algorithm addresses the
                 myopic nature of PDRs and the necessity to empirically
                 evolve the most suitable PDRs and their combination. In
                 the developed indirect representation of schedules the
                 chromosomes encode the strings of PDRs applied for
                 assigning the orders to the specified machines.
                 Empirically obtained performance evaluation results are
                 discussed. The results show the proposed combination of
                 GA with PDRs outperforms both the PDRs-only based
                 random search and GA without use of PDRs. The solution
                 to the problem of scheduling of 400 orders on the
                 elaborated experimental system configuration is reached
                 with probability of 90% within a runtime of half an
                 hour.",
  notes =        "Bird-of-a-feather Workshops, GECCO-2002. A joint
                 meeting of the eleventh International Conference on
                 Genetic Algorithms (ICGA-2002) and the seventh Annual
                 Genetic Programming Conference (GP-2002) part of
                 barry:2002:GECCO:workshop",
}

Genetic Programming entries for Ivan T Tanev Takashi Uozumi Yoshiharu Morotome

Citations