A society of hill-climbers

The paper is concerned with function optimisation in binary search spaces. It focuses on how hill climbers can work together and/or use their past trials in order to speed up the search. A hill climber is viewed as a set of mutations. The challenge is twofold: one must determine how many bits should be mutated, and which bits should preferably be mutated, or in other words, which climbing directions are to be preferred. The latter question is addressed by recording the last worst trials of the hill climbers within an individual, called repoussoir. The hill climbers further explore the neighborhood of their current point so as to get away from the repoussoir. As to the former question, no definite answer is proposed. Nevertheless, we experimentally show that hill climbers behave quite differently depending on whether one sets a mutation rate p/sub m/ per bit, or sets the exact number M of bits to mutate per individual. Two algorithms describing societies of hill climbers, with or without memory of the past trials, are described. These are experimented on several 900-bit problems, and significantly outperform standard genetic algorithms and evolution strategies.

[1]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[2]  Ryszard S. Michalski,et al.  A theory and methodology of inductive learning , 1993 .

[3]  Michèle Sebag,et al.  Mutation by Imitation in Boolean Evolution Strategies , 1996, PPSN.

[4]  Michèle Sebag,et al.  An Advanced Evolution Should Not Repeat its Past Errors , 1996, ICML.

[5]  Terry Jones,et al.  Crossover, Macromutationand, and Population-Based Search , 1995, ICGA.

[6]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[7]  Melanie Mitchell,et al.  What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation , 1993, Machine Learning.

[8]  Christopher Wills,et al.  The wisdom of the genes , 1989 .

[9]  Hans-Georg Beyer,et al.  On the Asymptotic Behavior of Multirecombinant Evolution Strategies , 1996, PPSN.

[10]  Tom M. Mitchell,et al.  Generalization as Search , 2002 .

[11]  S. Baluja.  An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics , 1995 .

[12]  Nicholas J. Radcliffe,et al.  Equivalence Class Analysis of Genetic Algorithms , 1991, Complex Syst..

[13]  William M. Spears,et al.  Adapting Crossover in Evolutionary Algorithms , 1995, Evolutionary Programming.

[14]  Nikolaus Hansen,et al.  On the Adaptation of Arbitrary Normal Mutation Distributions in Evolution Strategies: The Generating Set Adaptation , 1995, ICGA.

[15]  Kenneth A. De Jong,et al.  Are Genetic Algorithms Function Optimizers? , 1992, PPSN.

[16]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[17]  Thomas Bäck,et al.  An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.

[18]  Thomas Bäck,et al.  Evolution Strategies for Mixed-Integer Optimization of Optical Multilayer Systems , 1995, Evolutionary Programming.

[19]  Rich Caruana,et al.  Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.

[20]  J. David Schaffer,et al.  An Adaptive Crossover Distribution Mechanism for Genetic Algorithms , 1987, ICGA.

[21]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[22]  Michèle Sebag,et al.  Controlling Crossover through Inductive Learning , 1994, PPSN.

[23]  Robert G. Reynolds,et al.  Evolution Strategies for Mixed-Integer Optimization of Optical Multilayer Systems , 1995 .

[24]  Robert G. Reynolds,et al.  Adapting Crossover in Evolutionary Algorithms , 1995 .

[25]  Colin R. Reeves,et al.  Are Long Path Problems Hard for Genetic Algorithms? , 1996, PPSN.

[26]  Fred Glover,et al.  Critical Event Tabu Search for Multidimensional Knapsack Problems , 1996 .

[27]  Lawrence Davis,et al.  Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.