The world is full of optimization problems. Nature constantly optimizes each of her configurations. Each ecosystem fits together to use the symbiotic nature of each element. Species have evolved to have the characteristics that are most likely to lead to survival. The wind blows in directions that best alleviate any imbalances in forces. The planets orbit in ways that best fulfill the laws of motion. In understanding the environment, we often have to discern the optimization problem to fully understand its solution.

Evolution is one of the most interesting optimization problems. Why have humans evolved to have two hands, two eyes, two legs, one head, and a large brain while other species have not? Does that make humanity the pinnacle of the optimization problem? Why do guppies evolve to have different characteristics in dissimilar environments? Can the process of evolution be codified to understand these issues better?


Genetic Algorithm Cost Function Mutation Rate Gradient Descent Method Genetic Algorithm Parameter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Alga, E., & Tomassini, M. (2002). Parallelism and evolutionary algorithms.IEEE Transactions on Evolutionary Computation 6, 443œ462CrossRefGoogle Scholar
  2. Chapra, S. C., & Canale, R. P. (1998).Numerical methods for engineers(3rd ed.). Boston: McGraw-HillGoogle Scholar
  3. Davis, L. (Ed.) (1991).Handbook of genetic algorithms. New York: Van Nostrand ReinholdGoogle Scholar
  4. De Jong, K. A. (1975).Analysis of the behavior of a class of genetic adaptive systems. Ph.D. dissertation, The University of Michigan, Ann Arbor, MIGoogle Scholar
  5. Goldberg, D. E. (1989).Genetic algorithms in search, optimization, and machine learning. New York: Addison-Wes l eyGoogle Scholar
  6. Gordon, V. S. & Whitley, D. (1993). Serial and parallel genetic algorithms as function of optimizers. In S. Forrest (Ed.)ICGA-90: 5th international conference on genetic algorithms(pp. 177œ183). Los Altos, CA: Morgan KaufmannGoogle Scholar
  7. Haupt, R. (2007). Antenna design with a mixed integer genetic algorithm.IEEE Transactions on Antennas and Propagation 55(3), 577œ582CrossRefGoogle Scholar
  8. Haupt, R. L., & Haupt, S. E. (1998).Practical genetic algorithms(177 pp.). New York: WileyGoogle Scholar
  9. Haupt, R. L., & Haupt, S. E. (2000). Optimum population size and mutation rate for a simple real genetic algorithm that optimizes array factors.Applied Computational Electromagnetics Society Journal 15(2), 94œ 102Google Scholar
  10. Haupt, R. L., & Haupt, S. E. (2004).Practical genetic algorithms second edition with CD(255 pp.). New York: WileyGoogle Scholar
  11. Haupt, S. E. (2006). Nonlinear empirical models of dynamical systems.Computers and Mathematics with Applications 51, 431œ440CrossRefGoogle Scholar
  12. Haupt, S. E., Haupt, R. L., & Young, G. S. (2008). A mixed integer genetic algorithm used in chem-bio defense applications, accepted byJournal of Soft Computing Google Scholar
  13. Holland, J. H. (1975).Adaptation in natural and artificial systems. Ann Arbor, MI: The University of Michigan PressGoogle Scholar
  14. Marzban, C., & Haupt, S. E. (2005). On genetic algorithms and discrete performance measures.AMS 4th Conference on Artificial Intelligence, San Diego, CA, paper 1.1Google Scholar
  15. Mitchell, M. (1996).An introduction to genetic algorithms. Cambridge, MA: MIT PressGoogle Scholar

Copyright information

© Springer Science+Business Media B.V 2009

Authors and Affiliations

  1. 1.Applied Research Laboratory and Meteorology DepartmentThe Pennsylvania State UniversityState CollegeUSA

Personalised recommendations