Long path problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 866 LNCS, Issue , 1994, Pages 149-158

  Horn, Jeffrey ^a   Goldberg, David E ^a   Deb, Kalyanmoy ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BUILDING BLOCKES; EVOLUTIONARY OPTIMIZATIONS; FITNESS LANDSCAPE; GLOBAL OPTIMUM; HILL CLIMBING ALGORITHMS; MULTI-MODALITY; NEW DIMENSIONS; PROBLEM DIFFICULTY;

GENETIC ALGORITHMS;

EID: 84986265197     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58484-6_259     Document Type: Conference Paper

References (12)

1. 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
2. Goldberg, D. E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley (1989)
3. Goldberg, D. E.: Making genetic algorithms fly: a lesson from the Wright brothers. Advanced Technology for Developers. 2 February (1993) 1–8
4. 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
5. Holland, J. H.: Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press (1975)
6. 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)
7. MacWilliams, F. J., Sloane, N. J. A.: The Theory of Error Correcting Codes. Amsterdam, New York: North-Holland (1977)
8. 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
9. 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)
10. 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
11. Preparata, F. P., Niervergelt, J.: Difference-preserving codes. IEEE Transactions on Information Theory. IT-20:5 (1974) 643–649
12. 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