Artificial evolution by viability rather than competition

PLoS ONE

Volumn 9, Issue 1, 2014, Pages

  Maesani, Andrea ^a   Fernando, Pradeep Ruben ^a   Floreano, Dario ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; EVOLUTIONARY ALGORITHM; FILTER DESIGN; GENETIC ALGORITHM; GENETIC VARIABILITY; POPULATION SIZE; REPRODUCTIVE SUCCESS;

ALGORITHMS; ANIMALS; ARTIFICIAL INTELLIGENCE; BIOLOGICAL EVOLUTION; COMPETITIVE BEHAVIOR; COMPUTER SIMULATION; GENETIC FITNESS; MODELS, GENETIC; REPRODUCTION; SELECTION, GENETIC;

EID: 84900439114     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0086831     Document Type: Article

References (68)

1. Fogel DB (1995) Evolutionary computation: toward a new philosophy of machine intelligence. Piscataway, NJ: IEEE Press.
2. Bäck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. New York: Oxford University Press.
3. Fogel DB (1994) An introduction to simulated evolutionary optimization. IEEE Trans Neural Netw 5: 3-14.
4. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Boston, MA: Addison-Wesley Longman Publishing Co., Inc.
5. Foster JA (2001) Evolutionary computation. Nat Rev Genet 2: 428-36.
6. Eiben A, Schoenauer M (2002) Evolutionary computing. Information Processing Letters 82: 1-6. (Pubitemid 34110159)
7. Lenski RE, Ofria C, Pennock R, Adami C (2003) Evolutionary origin of complex features. Nature 423: 139-144.
8. Clune J, Misevic D, Ofria C, Lenski RE, Elena SF, et al. (2008) Natural selection fails to optimize mutation rates for long-term adaptation on rugged fitness landscapes. PLoS Comput Biol 4: e1000187.
9. Wischmann S, Floreano D, Keller L (2012) Historical contingency affects signaling strategies and competitive abilities in evolving populations of simulated robots. Proc Natl Acad Sci USA 109: 864-868.
10. Bongard J (2011) Morphological change in machines accelerates the evolution of robust behavior. Proc Natl Acad Sci USA 108: 1234-1239.
11. Jin Y, Branke J (2005) Evolutionary Optimization in Uncertain Environments - A Survey. IEEE Transactions on Evolutionary Computation 9: 303-317. (Pubitemid 40871134)
12. Degiacomi MT, Dal Peraro M (2013) Macromolecular symmetric assembly prediction using swarm intelligence dynamic modeling. Structure 21: 1097-1106.
13. Eiben AE, Ruttkay Z (1997) Constraint satisfaction problems. In: Back T, Fogel DB, Michalewicz Z, editors, Handbook of Evolutionary Computation. Bristol, UK: IOP Publishing Ltd.
14. Kumar V (1992) Algorithms for constraint-satisfaction problems: A survey. AI magazine 13: 32.
15. Kallel L, Naudts B, Reeves CR (2001) Properties of fitness functions and search landscapes. In: Theoretical aspects of evolutionary computing, London, UK: Springer-Verlag. pp. 175-206.
16. Konak A, Coit DW, Smith AE (2006) Multi-objective optimization using genetic algorithms: A tutorial. Reliability Engineering and System Safety 91: 992-1007. (Pubitemid 43996942)
17. Floreano D, Mattiussi C (2008) Bio-inspired artificial intelligence: theories, methods, and technologies. Cambridge, MA: MIT Press.
18. Coello Coello CA (2006) Evolutionary multi-objective optimization: a historical view of the field. Computational Intelligence Magazine, IEEE 1: 28-36.
19. Coello CAC, Lamont GB, Veldhuizen DAV (2007) Evolutionary algorithms for solving multiobjective problems. Springer.
20. Coello C, Carlos A (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Computer methods in applied mechanics and engineering 191: 1245-1287. (Pubitemid 34099386)
21. Mezura-Montes E, Coello Coello CA (2011) Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm and Evolutionary Computation 1: 173-194.
22. Woldesenbet Y, Yen G, Tessema B (2009) Constraint handling in multiobjective evolutionary optimization. Evolutionary Computation, IEEE Transactions on 13: 514-525.
23. Eiben AE, Smith JE (2003) Introduction to Evolutionary Computing. Berlin: Springer.
24. Mattiussi C, Waibel M, Floreano D (2004) Measures of diversity for populations and distances between individuals with highly reorganizable genomes. Evol Comput 12: 495-515. (Pubitemid 39634697)
25. Park T, Ryu KR (2010) A dual-population genetic algorithm for adaptive diversity control. IEEE Transactions on Evolutionary Computation 14: 865-884.
26. Adra S, Fleming PJ (2011) Diversity management in evolutionary many-objective optimization. IEEE Transactions on Evolutionary Computation 15: 183-195.
27. Ginley BM, Maher J, Riordan CO, Morgan F (2011) Maintaining Healthy Population Diversity using Adaptive Crossover, Mutation and Selection. IEEE Transactions on Evolutionary Computation 15: 692-714.
28. Lässig J, Hoffmann KH (2009) Threshold-selecting strategy for best possible ground state detection with genetic algorithms. Phys Rev E Stat Nonlin Soft Matter Phys 79: 046702.
29. Lässig J, Hoffmann KH, Enachescu M (2008) Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms. In: Proceedings of the 2008 GECCO conference companion on Genetic and evolutionary computation. New York, NY, USA: ACM, GECCO '08, pp. 2181-2186. doi:10.1145/1388969.1389044
30. Aubin J (1991) Viability theory. Birkhauser Boston Inc.
31. Cannon W (1932) The wisdom of the body. WW Norton & Co.
32. Ashby WR (1956) An introduction to cybernetics. New York,J. Wiley, 316 pp.
33. Ashby W (1960) Design for a brain. Wiley.
34. Beer RD (1997) The dynamics of adaptive behavior: A research program. Robotics and Autonomous Systems 20: 257-289.
35. Storn R (1999) System design by constraint adaptation and differential evolution. IEEE Transactions on Evolutionary Computation 3: 22-34.
36. Mattiussi C, Floreano D (2003) Viability evolution: elimination and extinction in evolutionary computation. (Technical Report, EPFL) EPFL-REPORT-177577, http://infoscience.epfl.ch/record/177577.
37. Whitley D (1989) The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In: Schaffer JD, editor, Proceedings of the third international conference on genetic algorithms, George Mason University. pp. 116-121.
38. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Transactions on Evolutionary Computation 6: 182-197. (Pubitemid 34555372)
39. Eiben A, Bäck T (1997) Empirical investigation of multiparent recombination operators in evolution strategies. Evol Comput 5: 347-365. (Pubitemid 127718108)
40. Li JP, Balazs ME, Parks GT, Clarkson PJ (2002) A species conserving genetic algorithm for multimodal function optimization. Evol Comput 10: 207-34.
41. Singh G, Deb K (2006) Comparison of multi-modal optimization algorithms based on evolutionary algorithms. In: Keijzer M, Cattolico M, Arnold D, Babovic V, Blum C, et al., editors, GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation, ACM Press. pp. 1305-1312.
42. Shir OM, Thomas B (2006) Niche radius adaptation in the cma-es niching algorithm. In: Schaefer R, Cotta C, Kolodziej J, Rudolph G, editors, Parallel Problem Solving from Nature - PPSN XI, Springer, volume 4193. pp. 141-152.
43. Deb K, Thiele L, Laumanns M, Zitzler E (2002) Scalable multi-objective optimization test problems. In: Proceedings of the 2002 Congress on Evolutionary Computation, IEEE Press. pp. 825-830.
44. Wineberg M, Oppacher F (2003) The underlying similarity of diversity measures used in evolutionary computation. In: Proceedings of the 2003 international conference on Genetic and evolutionary computation. Springer-Verlag, pp. 1493-1504.
45. Deb K (2001) Multi-objective optimization using evolutionary algorithms. John Wiley and Sons.
46. Darwin C (1859) On the origin of species by means of natural selection. Murray, London.
47. Atmar W (1994) Notes on the simulation of evolution. IEEE Trans Neural Netw 5: 130-147.
48. Baum EB, Boneh D, Garrett C (2001) Where genetic algorithms excel. Evol Comput 9: 93-124.
49. Marín J, Solé R (1999) Macroevolutionary algorithms: A new optimization method on fitness landscapes. IEEE Transactions on Evolutionary Computation 3: 272-286.
50. Lässig J, Hoffmann K (2009) Threshold-selecting strategy for best possible ground state detection with genetic algorithms. Physical Review E 79: 046702.
51. Juric M (1994) An anti-adaptationist approach to genetic algorithms. In: IEEE World Congress on Computational Intelligence. IEEE, pp. 619-623.
52. Lehman J, Stanley KO (2010) Revising the evolutionary computation abstraction: Minimal criteria novelty search. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2010). ACM.
53. Gomes J, Urbano P, Christensen AL (2012) Progressive minimal criteria novelty search. In: Advances in Artificial Intelligence-IBERAMIA 2012, Springer. pp. 281-290.
54. Ray T (1991) Evolution and optimization of digital organisms. In: R . BK, Derohanes E, H . Brown I, editors, Scientific Excellence in Supercomputing: The IBM 1990 Contest Prize Papers, The Baldwin Press. pp. 489-531.
55. Adami C (2006) Digital genetics: unravelling the genetic basis of evolution. Nat Rev Genet 7: 109-118.
56. Ofria C, Wilke CO (2004) Avida: a software platform for research in computational evolutionary biology. Artif Life 10: 191-229.
57. Mühlenbein H, Schlierkamp-Voosen D (1993) The science of breeding and its application to the breeder genetic algorithm. Evol Comput 1: 335-360.
58. Goldberg DE, Richardson J (1987) Genetic algorithms with sharing for multimodal function optimization. In: Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application.
59. Deb K, Goldberg DE (1989) An investigation of niche and species formation in genetic function optimization. In: Proceedings of the 3rd International Conference on Genetic Algorithms.
60. Petrowski A (1996) A clearing procedure as a niching method for genetic algorithms. In: Proceedings of the 1996 IEEE International Conference on Evolutionary Computation.
61. Lehman J, Stanley KO (2008) Exploiting open-endedness to solve problems through the search for novelty. In: ALIFE. pp. 329-336.
62. Toffolo A, Benini E (2003) Genetic diversity as an objective in multi-objective evolutionary algorithms. Evol Comput 11: 151-167. (Pubitemid 37044183)
63. Lehman J, Stanley KO (2011) Evolving a diversity of virtual creatures through novelty search and local competition. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2011). ACM.
64. Hansen N, Muller S, Koumoutsakos P (2003) Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMAES). Evolutionary Computation 11: 1-18. (Pubitemid 37044186)
65. Igel C, Hansen N, Roth S (2007) Covariance matrix adaptation for multiobjective optimization. Evol Comput 15: 1-28.
66. Arnold DV, Hansen N (2012) A (1 + 1)-cma-es for constrained optimisation. In: Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference. ACM, pp. 297-304.
67. Geiger R, Sanchez-Sinencio E (1985) Active Filter Design using Operational Transconductance Amplifiers: A Tutorial, IEEE Circuits and Devices Magazine, volume 1. pp. 20-32. (Pubitemid 15597568)
68. Rönkkönen J, Li X, Kyrki V, Lampinen J (2008) A Generator for Multimodal Test Functions with Multiple Global Optima. In: Simulated Evolution and Learning. Springer-Verlag, volume 3, pp. 239-248.