Mapping the royal road and other hierarchical functions

Evolutionary Computation

Volumn 11, Issue 2, 2003, Pages 129-149

  Wiles, Janet ^a   Tonkes, Bradley ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

Fitness landscape; Hierarchical if and only if; Hierarchically decomposable functions; Royal road; Visualisation

Indexed keywords

MULTIMODAL FITNESS FUNCTIONS;

FUNCTIONS; GRAPH THEORY; VISUALIZATION;

EVOLUTIONARY ALGORITHMS;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; COMPARATIVE STUDY; COMPUTER SIMULATION; EVOLUTION; STATISTICAL MODEL;

ALGORITHMS; COMPUTER SIMULATION; EVOLUTION; MODELS, GENETIC; MODELS, STATISTICAL;

EID: 0042378950     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/106365603766646807     Document Type: Article

References (32)

1. Baluja, S. (1994). Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning,. Technical Report CMU-CS-94-163, Carnegie-Mellon University, Pittsburgh, PA 15213.
2. Belding, T. C. (2001). Potholes on the royal road. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 211-218, San Francisco, CA. Morgan Kaufmann.
3. Buja, A. and Asimov, D. (1986). Grand tour methods: An outline. In Proceedings of the 18th Symposium on the Interface, pages 63-67. American Statistical Association.
4. Christensen, S. and Oppacher, F. (2001). What can we learn from No Free Lunch? A first attempt to characterize the concept of a searchable function. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 1219-1226, San Francisco, CA. Morgan Kaufmann.
5. Collins, T. D. (1997). Using software visualization technology to help evolutionary algorithm users validate their solutions. In Baeck, T., editor, The Proceedings of The Seventh International Conference on Genetic Algorithms, pages 307-314. Morgan Kaufmann.
6. Forrest, S. and Mitchell, M. (1993). What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation. Machine Learning, 13(2/3):285-319.
7. Friedman, J. H. and Tukey, J. W. (1974). A projection pursuit algorithm for exploratory data analysis. IEEE Transactions on Computers, 23(9):881-889.
8. Goldberg, D. E., B.Korb, and Deb, K. (1989). Messy genetic algorithms: Motivation, analysis and first results. Complex Systems, 3:493-530.
9. Goldberg, D. E., Deb, K., and Horn, J. (1992). Massive multimodality, deception, and genetic algorithms. In Männer, R. and Manderick, B., editors, Parallel Problem Solving from Nature, 2, pages 37-46. Elsevier.
10. Hill, F. J. and Peterson, G. R. (1968). Introduction to switching theory and logical design. Wiley, New York.
11. Hinton, G. E., Sejnowski, T. J., and Ackley, D. H. (1984). Boltzmann machines: Constraint satisfaction networks that learn. Technical Report CMU-CS-84-119, Carnegie-Mellon University, Pittsburgh, PA 15213.
12. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor.
13. Holland, J. H. (2000). Building blocks, cohort genetic algorithms, and hyperplane-defined functions. Evolutionary Computation, 8(4):373-391.
14. Kauffman, S. (1993). The Origins of Order. Oxford University Press, NY.
15. LeBlanc, J., Ward, M., and Wittels, N. (1991). Exploring n-dimensional databases. In Proceedings of the IEEE Conference on Visualization 1991, pages 230-237.
16. Liepins, G. E. and Vose, M. (1990). Reresentational issues in genetic algorithms. Journal of Experimental and Theoretical Artificial Intelligence, 2:101-115.
17. Mahfoud, S. W. (1995). A comparison of parallel and sequential niching methods. In Eshelman, L., editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 136-143, San Francisco, CA. Morgan Kaufmann.
18. Michalski, R. S. (1978). A planar geometric model for representing multidimensional discrete spaces and multiple-valued logic functions. Technical Report UIUCDCS-R-78-897, University of Illinois at Urbana-Champagne.
19. Mihalisin, T., Timlin, J., and Schwegler, J. (1991). Visualizing multivariate functions, data, and distributions. IEEE Computer Graphics and Applications, pages 28-35.
20. Mitchell, M. (1996). An introduction to genetic algorithms. MIT Press, Cambridge, MA.
21. Mitchell, M., Holland, J., and Forrest, S. (1994). When will a genetic algorithm outperform hill climbing. In Advances in Neural Information Processing Systems, volume 6, pages 51-58.
22. Munro, P. W. (1992). Visualizations of 2-d hidden unit space. In International Joint Conference on Neural Networks, volume 3, pages 468-473. IEEE.
23. Pelikan, M. and Goldberg, D. E. (2000). Hierarchical problem solving by the bayesian optimization algorithm. IlliGAL Report No. 2000002, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL.
24. Pryke, A. N. (1996). The Haiku Visualisation System. PhD thesis, University of Birmingham.
25. Shine, W. and Eick, C. (1997). Visualizing the evolution of genetic algorithm search processes. In Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pages 367-372.
26. Tonkes, B. (2002). Hyperspace graph paper WWW page. http://www.itee.uq.eu.au/̃btonkes/hsgp.html.
27. Tufte, E. R. (1992). The Visual Display of Quantitative Information. Graphic Press, reprint edition edition.
28. Watson, R., Hornby, G., and Pollack, J. (1998). Modeling building-block interdependency. Parallel Problem Solving from Nature, proceedings of the Fifth International Conference, pages 97-106.
29. Watson, R. and Pollack, J. (1999). Hierarchically-consistent test problems for genetic algorithms. In Angeline, P. J., Michalewicz, Z., Schoenauer, M., Yao, X., and Zalzala, A., editors, Proceedings of 1999 Congress on Evolutionary Computation, pages 1406-1413. IEEE Press.
30. Wiles, J. and Bloesch, A. (1992). Operators and curried functions: Training and analysis of simple recurrent networks. In Moody, J. E., Hanson, S. J., and Lippmann, R. P., editors, Advances in Neural Information Processing Systems 4, pages 325-332, San Mateo: CA. Morgan Kaufmann.
31. Wiles, J., Tonkes, B., and Watson, J. R. (2001). How learning can guide evolution in hierarchical modular tasks. In Moore, J. D. and Stenning, K., editors, Proceedings of the 23rd Annual Conference of the Cognitive Science Society, pages 1130-1135.
32. Wolpert, D. H. and Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82.