An updated taxonomy of evolutionary computation problems using graph-based evolutionary algorithms

2006 IEEE Congress on Evolutionary Computation, CEC 2006

Volumn , Issue , 2006, Pages 96-103

  Ashlock, Daniel A ^a   Bryden, Kenneth M ^b   Corns, Steven ^b   Schonfeld, Justin ^c  

^a UNIVERSITY OF GUELPH   (Canada)

^b Iowa State University of Science and Technology   (United States)

^c IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION TECHNIQUES; COMBINATORIAL GRAPHS; NON-LINEAR PROJECTION;

COMBINATORIAL OPTIMIZATION; PROBLEM SOLVING; TAXONOMIES; TOPOLOGY;

EVOLUTIONARY ALGORITHMS;

EID: 34547246181     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. D. Ashlock, K. M. Bryden, and S. Corns. Graph based evolutionary algorithms enhance the location of steiner systems. In Proceedings of the 2005 Congress on Evolutionary Computation, volume 2, pages 1861-1866. IEEE Press, 2005.
2. D. Ashlock, L. Guo, and F. Qiu. Greedy closure genetic algorithms. In Proceedings of the 2002 Congress on Evolutionary Computation, pages 1296-1301, Piscataway, NJ, 2002. IEEE Press.
3. D. Ashlock and J. I. Lathrop. A. fully characterized test suite for genetic programming. In Evolutionary Programming VII, pages 537-546, New York, 1998. Springer-Verlag.
4. D. Ashlock and J. Schonfeld. Nonlinear projection for the display of high dimensional distance data. In Proceedings of the 2005 Congress on Evolutionary Computation, volume 3, pages 2776-2783. IEEE Press, 2005.
5. Daniel Ashlock. Finding designs with genetic algorithms. In W. D. Wallis, editor, Computational and Constructive Design Theory, pages 49-65. Kluwer Academic Publishers, The Netherlands, 1996.
6. Daniel Ashlock. Evolutionary Computation for Opimization and Modeling. Springer, New York, 2006.
7. W. Banzhaf, P. Nordin, R. E. Keller, and F. D. Francone. Genetic Programming : An Introduction. Morgan Kaufmann, San Francisco, 1998.
8. K. M. Bryden, D. A. Ashlock, S. Corns, and S. J. Willson. Graph based evolutionary algorithms, to appear in IEEE Transactions on Evolutionary Computation, 2006.
9. D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge, Mass, 1997.
10. K. A. De Jong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, 1975.
11. J. R. Koza. Genetic Programming. The MIT Press, Cambridge, MA, 1992.
12. R. McEliece. The Theory of Information and Coding. Addison-Wesley, Reading, Mass, 1977.
13. Julian F. Miller and Peter Thomson. Cartesian genetic programming. In Proceedings of the European Conference on Genetic Programming, pages 121-132, London, UK, 2000. Springer-Verlag.
14. F. Qiu, L. Guo, T.J. Wen, D.A. Ashlock, and P.S. Schnable. Dna sequence-based bar-codes for tracking the origins of ests from a maize cdna library constructed using multiple mma sources. Plant Physiology, 133:475-481, 2003.
15. P. H. A. Sneath and R. R. Sokal. Numerical Taxonomy; the Principles and Practice of Numerical Classification, W.H. Freeman, San Francisco, 1973.
16. D.L. Swofford, G.J Olsen, P.J. Waddell, and D.M.Hillis. Phylogenetic inference. In D. Hillis, C. Moritz, and B. Mable, editors, Molecular Systematics, second edition, pages 407-514. Sinauer, Sunderland, MA., 1996.
17. G. Syswerda. A study of reproduction in generational and steady state genetic algorithms. In Foundations of Genetic Algorithms, pages 94-101. Morgan Kaufmann, 1991.
18. D. B. West. Introduction to Graph Theory. Prentice Hall, Upper Saddle River, NJ 07458, 1996.
19. D. Whitley. The genitor algorithm and selection pressure: why rank based allocation of reproductive trials is best. In Proceedings of the 3rd International Conference on Genetic Algorthms, pages 116-121. Morgan Kaufmann, 1989.
20. D. Whitley, K. Mathias, and Rana J. Dzubera. Evaluating evolutionary algorithms. Artificial Intelligence, 85:245-276, 1996.
21. Tina Yu and Julian F. Miller. Finding needles in haystacks is not hard with neutrality. In EuroGP '02: Proceedings of the 5th European Conference on Genetic Programming, pages 13-25, London, UK, 2002. Springer-Verlag.