Long Path Problems
@inproceedings{Horn1994LongPP, title={Long Path Problems}, author={J. Horn and D. Goldberg and K. Deb}, booktitle={PPSN}, year={1994} }
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
Topics from this paper
148 Citations
Genetic Algorithm Difficulty and the Modality of Fitness Landscapes
- Mathematics, Computer Science
- FOGA
- 1994
- 164
Analysis of recombinative algorithms on a non-separable building-block problem
- Mathematics, Computer Science
- FOGA
- 2000
- 47
- PDF
The analysis of evolutionary algorithms on sorting and shortest paths problems
- Computer Science, Mathematics
- J. Math. Model. Algorithms
- 2004
- 130
- PDF
Heuristic algorithms and learning techniques: applications to the graph coloring problem
- Mathematics, Computer Science
- 4OR
- 2012
- 8
- PDF
Some Combinatorial Landscapes on which a Genetic Algorithm Outperforms Other Stochastic Iterative Methods
- Computer Science
- Evolutionary Computing, AISB Workshop
- 1995
- 10
On the Effect of Connectedness for Biobjective Multiple and Long Path Problems
- Computer Science
- LION
- 2011
- 1
- PDF
Stepping stones and hidden haystacks: when a genetic algorithm defeats a hillclimber
- Computer Science, Mathematics
- Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)
- 1997
- 1
References
SHOWING 1-10 OF 17 REFERENCES
Relative Building-Block Fitness and the Building Block Hypothesis
- Mathematics, Computer Science
- FOGA
- 1992
- 454
- PDF
Making genetic algorithms y: a lesson from the Wright brothers
- Advanced Technology for Developers. 2 February
- 1993