Evolving Solutions: The Genetic Algorithm and Evolution Strategies for Finding Optimal Parameters

1. Holland JH (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI

   Google Scholar 

2. Beyer HG, Schwefel HP (2002) Evolution strategies - a comprehensive introduction, Natural Computing 1:3–52

   Article  MATH  MathSciNet  Google Scholar 

3. Michalewicz Z (1996) Genetic Algorithms + Data Structures = Evolution Programs. Springer

   Google Scholar 

4. Okabe T, Jin Y, Sendho B (2005) Theoretical comparisons of search dynamics of genetic algorithms and evolution strategies, In: Evolutionary Computation, 2005. The 2005 IEEE Congress on, vol. 1, 382– 389 Vol.1

   Article  Google Scholar 

5. Alander JT (1992) On optimal population size of genetic algorithms, CompEuro’ 92’Computer Systems and Software Engineering’, Proceedings 65–70

   Google Scholar 

6. Goldberg DE, Richardson J (1987) Genetic algorithms with sharing for multimodal function optimization, Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application table of contents 41–49

   Google Scholar 

7. Holland JH (1992) Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT Press

   Google Scholar 

8. Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii, Proceedings of the Parallel Problem Solving from Nature VI Conference 849–858

   Google Scholar 

9. De Jong KA (1975). An analysis of the behavior of a class of genetic adaptive systems

   Google Scholar 

10. Eshelman LJ, Schaffer JD (1991) Preventing premature convergence in genetic algorithms by preventing incest, Proceedings of the Fourth International Conference on Genetic Algorithms 115–122

    Google Scholar 

11. Sywerda G (1989) Uniform crossover in genetic algorithms, Proceedings of the third international conference on Genetic algorithms table of contents 2–9

    Google Scholar 

12. Eshelman LJ (1991) The chc adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination, Foundations of Genetic Algorithms 1:265–283

    Google Scholar 

13. Eshelman LJ, Schaffer JD (1993) Real-coded genetic algorithms and intervalschemata, Foundations of Genetic Algorithms 2:187–202

    Google Scholar 

14. Schaffer JD, Caruana RA, Eshelman LJ, Das R (1989) A study of control parameters affecting online performance of genetic algorithms for function optimization, Proceedings of the third international conference on Genetic algorithms table of contents 51–60

    Google Scholar 

15. Gray F (1953). Pulse code communication

    Google Scholar 

16. Hansen N, Ostermeier A (1996) Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation, In: Evolutionary Computation, 1996., Proceedings of IEEE International Conference on, 312–317

    Google Scholar 

17. Hansen N, Ostermeier A (2001) Completely derandomized self-adaptation in evolution strategies, Evolutionary Computation 9:159–195

    Article  Google Scholar 

18. Desmaisons D, Vincent JD, Lledo PM (1999) Control of action potential timing by intrinsic subthreshold oscillations in olfactory bulb output neurons, Journal of Neuroscience 19:10727–10737

    Google Scholar 

19. Davison AP, Feng J, Brown D (2000) A reduced compartmental model of the mitral cell for use in network models of the olfactory bulb, Brain Res Bull 51:393–9

    Article  Google Scholar 

20. Rubin DB, Cleland TA (2006) Dynamical mechanisms of odor processing in olfactory bulb mitral cells, Journal of Neurophysiology 96:555

    Article  Google Scholar 

21. Hines ML, Carnevale NT (1997) The neuron simulation environment, Neural Comp 9:1179–1209

    Article  Google Scholar 

22. Gagne C, Parizeau M (2002) Open beagle: A new versatile c++ framework for evolutionary computation, Late-Breaking Papers of the Genetic and Evolutionary Computation Conference (GECCO); New York City 161–168

    Google Scholar 

23. Kuhn HW (2005) The hungarian method for the assignment problem, Naval Research Logistics 52:7–21

    Article  Google Scholar 

24. Li L, Tang H, Wu Z, Gong J, Gruidl M, Zou J, Tockman M, Clark RA (2004) Data mining techniques for cancer detection using serum proteomic profiling, Artificial Intelligence In Medicine 32:71–83

    Article  Google Scholar 

25. Wang M, Zhou X, King RW, Wong STC (2007) Context based mixture model for cell phase identification in automated uorescence microscopy, BMC Bioinformatics 8:32

    Article  Google Scholar 

26. Yang J, Honavar V (1998) Feature subset selection using a genetic algorithm, Intelligent Systems and Their Applications, IEEE [see also IEEE Intelligent Systems] 13:44–49

    Article  Google Scholar 

27. Lavine BK, Vora MN (2005) Identification of africanized honeybees, J Chromatogr A 1096:69–75

    Article  Google Scholar 

28. Jeffries NO (2005) Performance of a genetic algorithm for mass spectrometry proteomics, feedback

    Google Scholar 

29. Pal SK, Bandyopadhyay S, Ray SS (2005) Evolutionary computation in bioinformatics: A review, IEEE Transactions on Systems, Man, and Cybernetics, Part-C

    Google Scholar 

30. Holland JH (1992) Genetic algorithms: Computer programs that “evolve” in ways that resemble natural selection can solve complex problems even their creators do not fully understand, Scientific American 267:66–72

    Article  Google Scholar 

31. Wikipedia. Evolutionary algorithm — Wikipedia, The Free Encyclopedia URL http://en.wikipedia.org/w/index.php?title=Evolutionary_algorithm&oldid=138840243

32. NCBI. Pubmed home URL http://www.ncbi.nlm.nih.gov/sites/entrez?db=PubMed

Download references