Abstract
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 improve their best found solutions, and be guaranteed to reach the global optimum. Yet we cannot wait for them to arrive. Early experimental results indicate that a genetic algorithm (GA) with crossover alone outperforms hillclimbers on one such long path problem. This suggests that GAs can climb hills faster than hillclimbers by exploiting building blocks when they are present. Although these problems are artificial, they introduce a new dimension of problem difficulty for evolutionary computation. Path length can be added to the ranks of multimodality, deception/misleadingness, noise, variance, etc., as a measure of fitness landscapes and their amenability to evolutionary optimization.
The first author acknowledges support by NASA under contract number NGT-50873. The second and third authors acknowledge the support provided by the US Army under Contract DASG60-90-C-0153 and by the National Science Foundation under Grant ECS-9022007. We thank Joseph Culberson for pointing us to the literature on difference-preserving codes. Both Culberson and Greg J.E. Rawlins participated in early discussions with the second author on hillclimbing hard problems.
Preview
Unable to display preview. Download preview PDF.
References
Forrest, S., Mitchell, M.: Relative building-block fitness and the building-block hypothesis. In: L.D. Whitley (ed.): Foundations of Genetic Algorithms, 2. San Mateo, CA: Morgan Kaufmann (1993) 109–126
Goldberg, D. E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley (1989)
Goldberg, D. E.: Making genetic algorithms fly: a lesson from the Wright brothers. Advanced Technology for Developers. 2 February (1993) 1–8
Jones, T., Rawlins, G. J. E.: Reverse hillclimbing, genetic algorithms and the busy beaver problem. In: S. Forrest (ed.): Proceedings of the Fifth International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann (1993) 70–75
Holland, J. H.: Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press (1975)
Hoffmeister, F., Bäck, T.: Genetic algorithms and evolutionary strategies: similarities and differences. Technical Report “Grüne Reihe” No. 365. Department of Computer Science, University of Dortmund. November (1990)
MacWilliams, F. J., Sloane, N. J. A.: The Theory of Error Correcting Codes. Amsterdam, New York: North-Holland (1977)
Mitchell, M., Holland, J. H.: When will a genetic algorithm outperform hill climbing? In: S. Forrest (ed.): Proceedings of the Fifth International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann (1993) 647
Mitchell, M., Holland, J. H., Forrest, S.: When will a genetic algorithm outperform hill climbing? Advances in Neural Information Processing Systems 6. San Mateo, CA: Morgan Kaufmann (to appear)
Mühlenbein, H.: How genetic algorithms really work, I. fundamentals. In: R. Männer, B. Manderick (eds.): Parallel Problem Solving From Nature, 2. Amsterdam: North-Holland (1992) 15–26
Preparata, F. P., Niervergelt, J.: Difference-preserving codes. IEEE Transactions on Information Theory. IT-20:5 (1974) 643–649
Wilson, S. W.: GA-easy does not imply steepest-ascent optimizable. In: R.K. Belew, L.B. Booker (eds.): Proceedings of the Fourth International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann (1991) 85–89
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horn, J., Goldberg, D.E., Deb, K. (1994). Long path problems. In: Davidor, Y., Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature — PPSN III. PPSN 1994. Lecture Notes in Computer Science, vol 866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58484-6_259
Download citation
DOI: https://doi.org/10.1007/3-540-58484-6_259
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58484-1
Online ISBN: 978-3-540-49001-2
eBook Packages: Springer Book Archive