Genetic Algorithm Difficulty and the Modality of Fitness Landscapes

@inproceedings{Horn1994GeneticAD,
  title={Genetic Algorithm Difficulty and the Modality of Fitness Landscapes},
  author={J. Horn and D. Goldberg},
  booktitle={FOGA},
  year={1994}
}
  • J. Horn, D. Goldberg
  • Published in FOGA 1994
  • Mathematics, Computer Science
  • Abstract We assume that the modality (i.e., number of local optima) of a fitness landscape is related to the difficulty of finding the best point on that landscape by evolutionary computation (e.g., hillclimbers and genetic algorithms (GAs)). We first examine the limits of modality by constructing a unimodal function and a maximally multimodal function. At such extremes our intuition breaks down. A fitness landscape consisting entirely of a single hill leading to the global optimum proves to be… CONTINUE READING
    164 Citations
    Fitness landscape analysis of a class of NP-hard problems
    • PDF
    Learning the Search Range for Evolutionary Optimization in Dynamic Environments
    • 6
    On Pathological Fitness Landscapes for Constrained Combinatorial Optimization
    • 1
    • PDF
    On the Landscape of Combinatorial Optimization Problems
    • 45
    • PDF
    On the Landscape of Combinatorial Optimisation Problems
    • 4
    • PDF
    Effective Fitness as an Alternative Paradigm for Evolutionary Computation I: General Formalism
    • 33
    Maximization of a dissimilarity measure for multimodal optimization
    Maximization of a dissimilarity measure for multimodal optimization
    • 5
    • PDF

    References

    SHOWING 1-10 OF 26 REFERENCES
    Long Path Problems
    • 148
    • PDF
    Genetic Algorithms, Noise, and the Sizing of Populations
    • 746
    • PDF
    Genetic Algorithms and the Variance of Fitness
    • 130
    • PDF
    Surfaces of Selective Value Revisited
    • 271
    Genetic and evolutionary algorithms come of age
    • 380
    • PDF
    Deception Considered Harmful
    • 199
    • PDF