Skip to main content
SpringerLink
Log in

Two Grand Challenges for EC

Unification and Expansion

  • Chapter
Frontiers of Evolutionary Computation

Part of the book series: Genetic Algorithms and Evolutionary Computation ((GENA,volume 11))

  • 170 Accesses

Abstract

The field of evolutionary computation has developed and matured significantly over the past 40 years. As with other disciplines attempting to understand complex adaptive systems, this progress has raised as many new and interesting questions as it has answered. In this chapter I describe some of the key open questions by organizing them in the form of two grand challenges: unification and expansion.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Axelrod, R. (1987). The evolution of strategies in the iterated prisoner’s dilemma. In Davis, L., editor, Genetic Algorithms and Simulated Annealing, pages 32–41. Morgan Kaufmann.

    Google Scholar 

  • Bäck, T. (1995). Generalized convergence models for tournament and (mu, lambda) selection. In Eshelman, L., editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 2–9. Morgan Kaufmann.

    Google Scholar 

  • Bäck, T. and Schwefel, H.-P. (1993). An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1(1): 1–23.

    Google Scholar 

  • Blickle, T. and Thiele, L. (1995). A mathematical analysis of tournament selection. In Eshelman, L., editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 9–16. Morgan Kaufmann.

    Google Scholar 

  • Booker, L. (1982). Intelligent Behavior as an adaptation to the task environment. PhD thesis, University of Michigan, Ann Arbor.

    Google Scholar 

  • Booker, L. (1992). Recombination distributions for genetic algorithms. In Whitley, D., editor, Foundations of Genetic Algorithms 2, pages 29–44. Morgan Kaufmann.

    Google Scholar 

  • Burke, D., De Jong, K., Grefenstette, J. J., Ramsey, C. L., and Wu, A. (1998). Putting more genetics into genetic algorithms. Evolutionary Computation, 6(4):387–410.

    Google Scholar 

  • Davis, L. (1989). Adapting operator probabilities in genetic algorithms. In Schaffer, J. D., editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 60–69. Morgan Kaufmann.

    Google Scholar 

  • de Garis, H. (1990). Genetic programming: modular evolution for Darwin machines. In Proceedings of the International Joint Conference on Neural Networks, pages 194–197. Lawrence Erlbaum.

    Google Scholar 

  • De Jong, K. (1975). Analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, Ann Arbor.

    Google Scholar 

  • Eiben, G. (1996). Multi-parent’s niche: N-ary crossovers on NK-landscapes. In Proceedings of the Fourth International Conference on Parallel Problem Solving from Nature, pages 319–335. Springer Verlag.

    Google Scholar 

  • Eshelman, L. and Schaffer, D. (1991). Preventing premature convergence in genetic algorithms by preventing incest. In Belew, R. K. and Booker, L. B., editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 115–122. Morgan Kaufmann.

    Google Scholar 

  • Ficici, S. and Pollack, J. (2000). A game-theoretic approach to the simple co-evolutionary algorithm. In Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J., and Schwefel, H.-P., editors, Proc. of the Sixth Conference on Parallel Problem Solving from Nature (PPSN VI), pages 467–476. Springer-Verlag.

    Google Scholar 

  • Fogarty, T. (1989). Varying the probability of mutation in the genetic algorithm. In Proceedings of the Third International Conference on Genetic Algorithms, pages 104–109. Morgan Kaufmann.

    Google Scholar 

  • Fogel, D. B. (1995a). On the relationship between the duration of an encounter and the evolution of cooperation in the iterated prisoner’s dilemma. Evolutionary Computation, 3(3):349–363.

    MathSciNet  Google Scholar 

  • Fogel, D. B. (1995b). Evolutionary Computation. IEEE Press.

    Google Scholar 

  • Fogel, L., Owens, A., and Walsh, M. (1966). Artificial intelligence through simulated evolution. John Wiley.

    Google Scholar 

  • Forrest, S., Javornik, B., Smith, R., and Perelson, A. (1993). Using genetic algorithms to explore pattern recognition in the immune system. Evolutionary Computation, 1(3): 191–212.

    Google Scholar 

  • Forrest, S. and Mitchell, M. (1992). Relative building block fitness and the building block hypothesis. In Whitley, D., editor, Foundations of Genetic Algorithms 2, pages 109–126. Morgan Kaufmann.

    Google Scholar 

  • Goldberg, David E., Deb, Kalyanmoy, and Clark, J. (1992). Accounting for noise in sizing of populations. In Whitley, D., editor, Foundations of Genetic Algorithms 2, pages 127–140. Morgan Kaufmann.

    Google Scholar 

  • Goldberg, David E., Deb, Kalyanmoy, and Korb, B. (1991). Don’t worry, be messy. In Belew, R. K. and Booker, L. B., editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 24–30. Morgan Kaufmann.

    Google Scholar 

  • Goldberg, David E. and Richardson, J. (1987). Genetic algorithms with sharing for multimodal function optimization. In Grefenstette, J. J., editor, Proceedings of the Second International Conference on Genetic Algorithms, pages 41–49. Lawrence Erlbaum.

    Google Scholar 

  • Goldberg, David E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley.

    Google Scholar 

  • Grefenstette, J. J., Ramsey, C. L., and Schultz, A. (1990). Learning sequential decision rules using simulation models and competition. Machine Learning, 5(4):355–381.

    Google Scholar 

  • Harp, S., Samad, T., and Guha, A. (1989). Towards the genetic synthesis of neural networks. In Proc. of the Third International Conference on Genetic Algorithms, pages 360–369. Morgan Kaufmann.

    Google Scholar 

  • Hillis, D. (1990). Co-evolving parasites improve simulated evolution as an optimization procedure. Physica D, 42:228–234.

    Article  Google Scholar 

  • Holland, J. H. (1962). Outline for a logical theory of adaptive systems. JACM, 9:297–314.

    Article  MATH  Google Scholar 

  • Holland, J. H. (1975). Adaptation in natural and artificial systems. University of Michigan Press.

    Google Scholar 

  • Holland, J. H. (1986). Escaping brittleness: The possibilities of general-purpose learning algorithms applied to parallel rule-based systems. In Michalski, R., Carbonell, J., and Mitchell, T, editors, Machine Learning, volume 2, pages 593–624. Morgan Kaufmann.

    Google Scholar 

  • Holland, J. H. (1992). Adaptation in natural and artificial systems, second edition. MIT Press.

    Google Scholar 

  • Jones, T. (1995). Evolutionary algorithms, fitness landscapes, and search. PhD thesis, University of New Mexico.

    Google Scholar 

  • Koza, John R. (1992). Genetic Programming: On the programming of computers by means of natural selection. Bradford Books, Cambridge.

    Google Scholar 

  • Manderick, B., de Weger, M., and Spiessens, P. (1991). The genetic algorithm and the structure of the fitness landscape. In Belew, R. K. and Booker, L. B., editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 143–150. Morgan Kaufmann.

    Google Scholar 

  • Michalewicz, Z. (1994). Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag.

    Google Scholar 

  • Michalewicz, Z. and Schoenauer, M. (1996). Evolutionary algorithms for constrained optimization problems. Evolutionary Computation, 4(1):1–32.

    Google Scholar 

  • Potter, M. (1997). The Design and Analysis of a Computational Model of Cooperative Coevolution. PhD thesis, George Mason University.

    Google Scholar 

  • Radcliffe, N. J. (1991). Forma analysis and random respectful recombination. In Belew, R. K. and Booker, L. B., editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 222–229. Morgan Kaufmann.

    Google Scholar 

  • Rechenberg, I. (1964). Cybernetic solution path of an experimental problem. Library Translation 1122, August 1965. Farnborough Hants: Royal Aircraft Establishment. English translation of lecture given at the Annual Conference of the WGLR at Berlin in September, 1964.

    Google Scholar 

  • Rosin, C. and Belew, R. K. (1995). Methods for competitive co-evolution: Finding opponents worth beating. In Eshelman, L., editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 373–380. Morgan Kaufmann.

    Google Scholar 

  • Sarma, J. (1998). An Analysis of Decentralized and Spatially Distributed Genetic Algorithms. PhD thesis, George Mason University.

    Google Scholar 

  • Schaffer, D. and Morishima, A. (1987). An adaptive crossover mechanism for genetic algorithms. In Grefenstette, J. J., editor, Proceedings of the Second International Conference on Genetic Algorithms, pages 36–40. Morgan Kaufmann.

    Google Scholar 

  • Schraudolph, N. and Belew, R. K. (1992). Dynamic parameter encoding for genetic algorithms. Machine Learning, 9(l):9–22.

    Google Scholar 

  • Schwefel, H.-P. (1981). Numerical optimization of computer models. John Wiley and Sons.

    Google Scholar 

  • Schwefel, H.-P. (1995). Evolution and optimum seeking. Wiley.

    Google Scholar 

  • Shaefer, C. (1987). The argot strategy: adaptive representation genetic optimizer technique. In Grefenstette, J. J., editor, Proceedings of the Second International Conference on Genetic Algorithms, pages 50–58. Lawrence Erlbaum.

    Google Scholar 

  • Spears, W. M. (1994). Simple subpopulationschemes. In Proc. of the Evolutionary Programming Conference, pages 296–307. World Scientific.

    Google Scholar 

  • Spears, W. (1998). The Role of Mutation and Recombination in Evolutionary Algorithms. PhD thesis, George Mason University.

    Google Scholar 

  • Stanley, K. and Miikkulainen, R. (2002). Evolving neural networks through augmenting topologies. Evolutionary Computation, 10(2):99–127.

    Article  Google Scholar 

  • Turner, M. (1998). Performance-based Self-adaptive Evolutionary Behavior. PhD thesis, George Washington University.

    Google Scholar 

  • Turney, P., Whitley, D., and Anderson, R. (1996). Evolution, learning, and instinct: 100 years of the baldwin effect. Evolutionary Computation, 4(3).

    Google Scholar 

  • Vose, M. D. and Liepins, G. E. (1991). Schema disruption. In Belew, R. K. and Booker, L., editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 237–242. Morgan Kaufmann.

    Google Scholar 

  • Whitley, D., Mathias, K., and Fitzhorn, P. (1991). Delta coding: an iterative search strategy for genetic algorithms. In Belew, R. K. and Booker, L. B., editors, Proceeding of the Fourth International Conference on Genetic Algorithms, pages 77–84. Morgan Kaufmann.

    Google Scholar 

  • Wiegand, P., Liles, W., and De Jong, K. (2002). Analyzing cooperative coevolution with evolutionary game theory. In Fogel, D., editor, The IEEE World Congress on Computational Intelligence, pages 1600–1606. IEEE Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, George Mason University, Fairfax, VA, 22030

    Kenneth De Jong

Authors
  1. Kenneth De Jong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Product Soft, Inc., Pittsburgh, Pennsylvania, USA

    Anil Menon

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Kluwer Academic Publishers

About this chapter

Cite this chapter

De Jong, K. (2004). Two Grand Challenges for EC. In: Menon, A. (eds) Frontiers of Evolutionary Computation. Genetic Algorithms and Evolutionary Computation, vol 11. Springer, Boston, MA. https://doi.org/10.1007/1-4020-7782-3_2

Download citation

  • DOI: https://doi.org/10.1007/1-4020-7782-3_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4020-7524-7

  • Online ISBN: 978-1-4020-7782-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation