Long Path Problems

  title={Long Path Problems},
  author={J. Horn and D. Goldberg and K. Deb},
  • J. Horn, D. Goldberg, K. Deb
  • Published in PPSN 1994
  • Mathematics, Computer Science
  • We demonstrate the interesting, counter-intuitive result that simple paths to the global optimum can be so long that climbing the path is intractable. This means that a unimodal search space, which consists of a single hill and in which each point in the space is on a simple path to the global optimum, can be difficult for a hillclimber to optimize. Various types of hillclimbing algorithms will make constant progress toward the global optimum on such long path problems. They will continuously… CONTINUE READING
    148 Citations

    Topics from this paper

    Genetic Algorithm Difficulty and the Modality of Fitness Landscapes
    • 164
    Genetic Algorithm Di culty and the Modality ofFitness
    • 1
    Analysis of recombinative algorithms on a non-separable building-block problem
    • R. Watson
    • Mathematics, Computer Science
    • FOGA
    • 2000
    • 47
    • PDF
    The analysis of evolutionary algorithms on sorting and shortest paths problems
    • 130
    • PDF
    Heuristic algorithms and learning techniques: applications to the graph coloring problem
    • 8
    • PDF
    Some Combinatorial Landscapes on which a Genetic Algorithm Outperforms Other Stochastic Iterative Methods
    • 10
    Stepping stones and hidden haystacks: when a genetic algorithm defeats a hillclimber
    • D. Corne
    • Computer Science, Mathematics
    • Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)
    • 1997
    • 1


    Relative Building-Block Fitness and the Building Block Hypothesis
    • 454
    • PDF
    How Genetic Algorithms Really Work I.mutation and Hillclimbing
    • 306
    • Highly Influential
    • PDF
    Adaptation in natural and artificial systems
    • 37,588
    Genetic Algorithms in Search Optimization and Machine Learning
    • 55,116
    • PDF
    Difference-preserving codes
    • 20
    Making genetic algorithms y: a lesson from the Wright brothers
    • Advanced Technology for Developers. 2 February
    • 1993