Proceedings of the Fourth International Conference on Genetic Algorithms: University of California, San Diego, July 13-16, 1991Richard K. Belew, Lashon Bernard Booker |
Contents
Exploring ProblemSpecific Recombination Operators for Job Shop Scheduling | 10 |
Dont Worry Be Messy | 24 |
Evolving a Computer Program to Generate Random Numbers Using the Genetic | 37 |
Copyright | |
35 other sections not shown
Other editions - View all
Common terms and phrases
adaptive alleles applied approach average binary bits chromosome classifier system clusters coefficients complex Conference on Genetic constraints convergence correlation cost crossover operator deceptive defined delta coding described disruption distribution domain encoding environment epistasis evaluation evolution example experiments Figure fitness function fitness landscape fuzzy fuzzy sets genes Genetic Algorithms genetic operators genotype global global optimum Goldberg gorithms graph Grefenstette Hamming distance hill-climbing hyperplane implementation individual input International Conference iteration landscapes length Machine Learning mating membership functions method Morgan Kaufmann mutation operator nodes offspring optimum order-1 output panmictic parameters parent partition performance phenotype points position probability processors random randomly recombination representation reproduction rithm rules runs sampling schedule schema schemata search space segmentation selection sequence simulated simulated annealing solution solve strategy string structure subpopulation task techniques tion Traveling Salesman Problem uniform crossover variables vector