Paper Details

@InProceedings{Moore03,
  title = "{A}ccurate {C}alculation of {D}eme {S}izes for a {P}arallel {G}enetic {S}cheduling {A}lgorithm",
  author= "Moore, M.",
  editor= "Broenink, Jan F. and Hilderink, Gerald H.",
  pages = "305--313",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2003",
  isbn= "1 58603 381 6",
  year= "2003",
  month= "sep",
  abstract= "The accuracies of three equations to determine the size of
     populations for serial and parallel genetic algorithms are
     evaluated when applied to a parallel genetic algorithm that
     schedules tasks on a cluster of computers connected via
     shared bus. This NP-complete problem is representative of a
     variety of optimisation problems for which genetic
     algorithms (GAs) have been shown to effectively approximate
     the optimal solution. However, empirical determination of
     parameters needed by both serial and parallel GAs is
     time-consuming, often impractically so in production
     environments. The ability to predetermine parameter values
     mathematically eliminates this difficulty. The parameter
     that exerts the most influence over the solution quality of
     a parallel genetic algorithm is the population size of the
     demes. Comparisons here show that the most accurate equation
     for the scheduling application is Cant\`{u}-Paz' serial
     population sizing calculation based on the gambler's ruin
     model [1]. The study presented below is part of an ongoing
     analysis of the effectiveness of parallel genetic algorithm
     parameter value computations based on schema theory. The
     study demonstrates that the correct deme size can be
     predetermined quantitatively for the scheduling problem
     presented here, and suggests that this may also be true for
     similar optimisation problems. This work is supported by
     NASA Grant NAG9-140."
}

If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.

Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.