•42-2(06) Pennockprno Fig.Indd
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Completely Derandomized Self-Adaptation in Evolution Strategies
Completely Derandomized Self-Adaptation in Evolution Strategies Nikolaus Hansen [email protected] Technische Universitat¨ Berlin, Fachgebiet fur¨ Bionik, Sekr. ACK 1, Ackerstr. 71–76, 13355 Berlin, Germany Andreas Ostermeier [email protected] Technische Universitat¨ Berlin, Fachgebiet fur¨ Bionik, Sekr. ACK 1, Ackerstr. 71–76, 13355 Berlin, Germany Abstract This paper puts forward two useful methods for self-adaptation of the mutation dis- tribution – the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self-adaptation of arbitrary (normal) mutation dis- tributions are developed. Applying arbitrary, normal mutation distributions is equiv- alent to applying a general, linear problem encoding. The underlying objective of mutative strategy parameter control is roughly to favor previously selected mutation steps in the future. If this objective is pursued rigor- ously, a completely derandomized self-adaptation scheme results, which adapts arbi- trary normal mutation distributions. This scheme, called covariance matrix adaptation (CMA), meets the previously stated demands. It can still be considerably improved by cumulation – utilizing an evolution path rather than single search steps. Simulations on various test functions reveal local and global search properties of the evolution strategy with and without covariance matrix adaptation. Their per- formances are comparable only on perfectly scaled functions. On badly scaled, non- separable functions usually a speed up factor of several orders of magnitude is ob- served. On moderately mis-scaled functions a speed up factor of three to ten can be expected. Keywords Evolution strategy, self-adaptation, strategy parameter control, step size control, de- randomization, derandomized self-adaptation, covariance matrix adaptation, evolu- tion path, cumulation, cumulative path length control. -
A New Biogeography-Based Optimization Approach Based on Shannon-Wiener Diversity Index to Pid Tuning in Multivariable System
ABCM Symposium Series in Mechatronics - Vol. 5 Section III – Emerging Technologies and AI Applications Copyright © 2012 by ABCM Page 592 A NEW BIOGEOGRAPHY-BASED OPTIMIZATION APPROACH BASED ON SHANNON-WIENER DIVERSITY INDEX TO PID TUNING IN MULTIVARIABLE SYSTEM Marsil de Athayde Costa e Silva, [email protected] Undergraduate course of Mechatronics Engineering Camila da Costa Silveira, [email protected] Leandro dos Santos Coelho, [email protected] Industrial and Systems Engineering Graduate Program, PPGEPS Pontifical Catholic University of Parana, PUCPR Imaculada Conceição, 1155, Zip code 80215-901, Curitiba, Parana, Brazil Abstract. Proportional-integral-derivative (PID) control is the most popular control architecture used in industrial problems. Many techniques have been proposed to tune the gains for the PID controller. Over the last few years, as an alternative to the conventional mathematical approaches, modern metaheuristics, such as evolutionary computation and swarm intelligence paradigms, have been given much attention by many researchers due to their ability to find good solutions in PID tuning. As a modern metaheuristic method, Biogeography-based optimization (BBO) is a generalization of biogeography to evolutionary algorithm inspired on the mathematical model of organism distribution in biological systems. BBO is an evolutionary process that achieves information sharing by biogeography-based migration operators. This paper proposes a modification for the BBO using a diversity index, called Shannon-wiener index (SW-BBO), for tune the gains of the PID controller in a multivariable system. Results show that the proposed SW-BBO approach is efficient to obtain high quality solutions in PID tuning. Keywords: PID control, biogeography-based optimization, Shannon-Wiener index, multivariable systems. -
Michael Behe Makes the Argument That
Opening the Black Box Throughout “Darwin’s Black Box”, Michael Behe makes the argument that Darwinian evolution can’t be used as a universal explanation for all of life, because it can’t account for irreducibly complex organisms. However, Behe also neglects to acknowledge any existing research that suggests otherwise. A study conducted at Michigan State University by scientist Richard Lenski has shown that there could be a scientific explanation for these seemingly irreducibly complex organism, and that Behe shouldn’t be so quick to point to a supernatural solution, or to call it quits so soon when his mousetrap breaks. While Behe may think he has all the answers, contrary research has shown there are other answers worth consideration. Behe begins his argument by introducing the idea of organisms that are irreducibly complex, otherwise defined as a “single system composed of several well-matched, interacting parts that contribute to the basic function of the system, wherein the removal of any one of the parts causes the system to effectively cease functioning” (Darwin’s Black Box, 39). In order to demonstrate this principle, Behe raises the example of a mousetrap. He argues that if you remove one part of a mousetrap, it will cease to function, and because of this, all of the parts must have evolved simultaneously in order for a mousetrap to exist, therefor rendering it irreducibly complex. However, is any of this really true? Besides the holes in Behe’s mousetrap argument, there also lies the fact that mousetraps are not living creatures and therefore are incapable of evolution. -
Genetic Algorithms for Applied Path Planning a Thesis Presented in Partial Ful Llment of the Honors Program Vincent R
Genetic Algorithms for Applied Path Planning A Thesis Presented in Partial Ful llment of the Honors Program Vincent R. Ragusa Abstract Path planning is the computational task of choosing a path through an environment. As a task humans do hundreds of times a day, it may seem that path planning is an easy task, and perhaps naturally suited for a computer to solve. This is not the case however. There are many ways in which NP-Hard problems like path planning can be made easier for computers to solve, but the most signi cant of these is the use of approximation algorithms. One such approximation algorithm is called a genetic algorithm. Genetic algorithms belong to a an area of computer science called evolutionary computation. The techniques used in evolutionary computation algorithms are modeled after the principles of Darwinian evolution by natural selection. Solutions to the problem are literally bred for their problem solving ability through many generations of selective breeding. The goal of the research presented is to examine the viability of genetic algorithms as a practical solution to the path planning problem. Various modi cations to a well known genetic algorithm (NSGA-II) were implemented and tested experimentally to determine if the modi cation had an e ect on the operational eciency of the algorithm. Two new forms of crossover were implemented with positive results. The notion of mass extinction driving evolution was tested with inconclusive results. A path correction algorithm called make valid was created which has proven to be extremely powerful. Finally several additional objective functions were tested including a path smoothness measure and an obstacle intrusion measure, the latter showing an enormous positive result. -
Chapter 6.Qxp
Testing Darwin Digital organisms that breed thousands of times faster than common bacteria are beginning to shed light on some of the biggest unanswered questions of evolution BY CARL ZIMMER F YOU WANT TO FIND ALIEN LIFE-FORMS, does this. Metabolism? Maybe not quite yet, but Ihold off on booking that trip to the moons of getting pretty close.” Saturn. You may only need to catch a plane to East Lansing, Michigan. One thing the digital organisms do particularly well is evolve. “Avida is not a simulation of evolu- The aliens of East Lansing are not made of car- tion; it is an instance of it,” Pennock says. “All the bon and water. They have no DNA. Billions of them core parts of the Darwinian process are there. These are quietly colonizing a cluster of 200 computers in things replicate, they mutate, they are competing the basement of the Plant and Soil Sciences building with one another. The very process of natural selec- at Michigan State University. To peer into their tion is happening there. If that’s central to the defi- world, however, you have to walk a few blocks west nition of life, then these things count.” on Wilson Road to the engineering department and visit the Digital Evolution Laboratory. Here you’ll It may seem strange to talk about a chunk of find a crew of computer scientists, biologists, and computer code in the same way you talk about a even a philosopher or two gazing at computer mon- cherry tree or a dolphin. But the more biologists itors, watching the evolution of bizarre new life- think about life, the more compelling the equation forms. -
The Roles of Evolutionary Computation, Fitness Landscape, Constructive Methods and Local Searches in the Development of Adaptive Systems for Infrastructure Planning
International Symposium for Next Generation Infrastructure October 1-4, 2013, Wollongong, Australia The roles of evolutionary computation, fitness landscape, constructive methods and local searches in the development of adaptive systems for infrastructure planning Mehrdad Amirghasemi a* Reza Zamani a Abstract: Modelling and systems simulation for improving city planning, and traffic equilibrium are involved with the development of adaptive systems that can learn and respond to the environment intelligently. By employing sophisticated techniques which highly support infrastructure planning and design, evolutionary computation can play a key role in the development of such systems. The key to presenting solution strategies for these systems is fitness landscape which makes some problems hard and some problems easy to tackle. Moreover, constructive methods and local searches can assist evolutionary searches to improve their performance. In this paper, in the context of infrastructure, in general, and city planning, and traffic equilibrium, in particular, the integration of these four concepts is briefly discussed. Key words: Evolutionary computation; Local search; Infrastructure; City planning; Traffic equilibrium. I. Introduction Infrastructure is a term used to indicate both organizational and physical structures a society or an enterprise needs to function. In effect, all facilities and services needed for the operation of an economy is gathered under the umbrella term of “Infrastructure”. Each Infrastructure includes connected elements which are structurally related and each element can affect the other elements. It is through this interconnection that these elements collectively provide a basis for structural development of a society or an enterprise. Viewed in an operative level, infrastructure makes the production of goods and services required in the society more straightforward and the distribution of finished products to market easier. -
Life's Conservation Law: Why Darwinian
William A. Dembski and Robert J. Marks II, "Life's Conservation Law: Why Darwinian Evolution Cannot Create Biological Information" in Bruce Gordon and William Dembski, editors, The Nature of Nature (Wilmington, Del.: ISI Books, 2011) pp.360-399 E F E IS an irn:volcaIJ!e selection and exclusion. as when you marry one woman you up all the so when you take one course of action you up all the other courses."4 Intelligence creates information. Bur is the causal power of Darwin's main claim to fame is that he is supposed to have a that could create informa- tion without the need intelligence. Interestingly, he to this mechanism as "natural selection." Sel.e~tion, as understood before had been an activity confined to intelligent agents. Darwll1 s great coup was to the power to nature-hence "natural selection." as conceived Darwin and his acts without is non-teleo- and therefore unintelligent. As genetlClst Coyne puts it in opposing intdlige:nt "If we're to defend we must defend it as a science: a in which the of life results from the action natural selection and on random mutations."5 But do and Darwinists insist that to count as must be non-teleological?6 did that rule come from? The of with the sciences is itselfa well-established science-it's called engineering. conceived, to the engi- ne.:::nng SCIences. 1. THE CREATION OF INFORMATION But to return to the at does nature really possess the power to select and th,>rph" create To answer this we to turn to relation between po~,sit)ilil:ies to create inlonnal:1011. -
The Landscape of Innovation in Bacteria, Battleships, and Beyond Downloaded by Guest on October 1, 2021 Thus, Fig
SPECIAL FEATURE: PERSPECTIVE The landscape of innovation in bacteria, battleships, and beyond SPECIAL FEATURE: PERSPECTIVE Terence C. Burnhama,b,1 and Michael Travisanoc,d,1,2 Edited by Simon A. Levin, Princeton University, Princeton, NJ, and approved November 18, 2020 (received for review August 12, 2020) We draw lessons from microbial experimental evolution and naval warfare to improve the understanding of innovation in financial markets. Major financial innovations often arise without explicit societal planning because novel approaches can be favored by markets, in a manner strikingly parallel to natural selection. We utilize the concept of an adaptive landscape to characterize environments that increase the speed and magnitude of innovation. We apply this adaptive landscape framework to innovation in portfolio management. We create a general taxonomy for understanding and nurturing innovation. adaptation | experimental evolution | finance | innovation What environmental characteristics favor innovation? relationship between design and performance. Con- We begin with an examination of innovation evident in sequently, both battleship and bacterial innovation naval warfare, primarily the design and function of can be represented in a similar adaptive landscape. battleships. Improvements in battleships suggest that We draw general lessons regarding approaches to fierce competition fosters innovation. innovation, aided by the adaptive landscape repre- While the battleship heuristic appears straightfor- sentation. The goal is to understand innovation in ward, the study of any historical set of innovations has finance and other domains. From this perspective, we the challenge of disentangling causation from corre- analyze one area of finance: the management of lation. Without a time machine, we cannot be sure of investment portfolios. -
Experiments in Digital Evolution Christoph Adami∗ Claus O
Experiments in Digital Evolution Christoph Adami∗ Claus O. Wilke (Editors’ Introduction to the Digital Life Laboratory 136-93 Special Issue) California Institute of Technology Pasadena, CA 91125 {adami,wilke}@caltech.edu Whether or not the field of artificial life has succeeded in doing what its name sug- gests, namely synthesizing life from non-living components, is a matter of contention. Clearly, this journal covers a broad range of topics related to the synthesis and sim- ulation of living systems, but only a few articles go so far as to unabashedly study wholly artificial forms of life. The field of digital evolution is an exception: Artificial life forms, in the form of self-replicating computer code inhabiting specially prepared areas of a standard computer, have been used to learn about fundamental aspects of the evolutionary process since Tom Ray introduced us to them [23]. In this issue, we present experiments using digital organisms of the Avida variety (that is, implemented with the Avida software described in this issue [20]), but there are a number of other implementations of digital evolution that have been used for experimental evolution (see, e.g., [31, 32, 22, 5]). Whether or not these digitals are truly alive is ultimately of no concern to us as researchers: We use them because we are interested in complicated and vexing questions of evolutionary biology, and digitals offer us the possibility to attack them. Digital evolution is currently undergoing a boom phase, and public perception of this discipline is steadily increasing [21]. This boom can be traced back in part to a maturation of the Avida software used in the majority of digital evolution experiments, in part to a perceived need for rigor in evolution experiments [7], and in part to the adoption of digitals as experimental organisms alongside bacteria and viruses by a growing number of microbiologists (see, e.g., [16]). -
Sustainable Growth and Synchronization in Protocell Models
life Article Sustainable Growth and Synchronization in Protocell Models Roberto Serra 1,2,3 and Marco Villani 1,2,* 1 Department of Physics, Informatics and Mathematics, Modena and Reggio Emilia University, Via Campi 213/A, 41125 Modena, Italy 2 European Centre for Living Technology, Ca’ Bottacin, Dorsoduro 3911, Calle Crosera, 30123 Venice, Italy 3 Institute for Advanced Study, University of Amsterdam, Oude Turfmarkt 147, 1012 GC Amsterdam, The Netherlands * Correspondence: [email protected] Received: 19 July 2019; Accepted: 14 August 2019; Published: 21 August 2019 Abstract: The growth of a population of protocells requires that the two key processes of replication of the protogenetic material and reproduction of the whole protocell take place at the same rate. While in many ODE-based models such synchronization spontaneously develops, this does not happen in the important case of quadratic growth terms. Here we show that spontaneous synchronization can be recovered (i) by requiring that the transmembrane diffusion of precursors takes place at a finite rate, or (ii) by introducing a finite lifetime of the molecular complexes. We then consider reaction networks that grow by the addition of newly synthesized chemicals in a binary polymer model, and analyze their behaviors in growing and dividing protocells, thereby confirming the importance of (i) and (ii) for synchronization. We describe some interesting phenomena (like long-term oscillations of duplication times) and show that the presence of food-generated autocatalytic cycles is not sufficient to guarantee synchronization: in the case of cycles with a complex structure, it is often observed that only some subcycles survive and synchronize, while others die out. -
Arxiv:1803.03453V4 [Cs.NE] 21 Nov 2019
The Surprising Creativity of Digital Evolution: A Collection of Anecdotes from the Evolutionary Computation and Artificial Life Research Communities Joel Lehman1†, Jeff Clune1, 2†, Dusan Misevic3†, Christoph Adami4, Lee Altenberg5, Julie Beaulieu6, Peter J Bentley7, Samuel Bernard8, Guillaume Beslon9, David M Bryson4, Patryk Chrabaszcz11, Nick Cheney2, Antoine Cully12, Stephane Doncieux13, Fred C Dyer4, Kai Olav Ellefsen14, Robert Feldt15, Stephan Fischer16, Stephanie Forrest17, Antoine Fr´enoy18, Christian Gagn´e6 Leni Le Goff13, Laura M Grabowski19, Babak Hodjat20, Frank Hutter11, Laurent Keller21, Carole Knibbe9, Peter Krcah22, Richard E Lenski4, Hod Lipson23, Robert MacCurdy24, Carlos Maestre13, Risto Miikkulainen26, Sara Mitri21, David E Moriarty27, Jean-Baptiste Mouret28, Anh Nguyen2, Charles Ofria4, Marc Parizeau 6, David Parsons9, Robert T Pennock4, William F Punch4, Thomas S Ray29, Marc Schoenauer30, Eric Schulte17, Karl Sims, Kenneth O Stanley1,31, Fran¸coisTaddei3, Danesh Tarapore32, Simon Thibault6, Westley Weimer33, Richard Watson34, Jason Yosinski1 †Organizing lead authors 1 Uber AI Labs, San Francisco, CA, USA 2 University of Wyoming, Laramie, WY, USA 3 Center for Research and Interdisciplinarity, Paris, France 4 Michigan State University, East Lansing, MI, USA 5 Univeristy of Hawai‘i at Manoa, HI, USA 6 Universit´eLaval, Quebec City, Quebec, Canada 7 University College London, London, UK 8 INRIA, Institut Camille Jordan, CNRS, UMR5208, 69622 Villeurbanne, France 9 Universit´ede Lyon, INRIA, CNRS, LIRIS UMR5205, INSA, UCBL, -
A Note on Evolutionary Algorithms and Its Applications
Bhargava, S. (2013). A Note on Evolutionary Algorithms and Its Applications. Adults Learning Mathematics: An International Journal, 8(1), 31-45 A Note on Evolutionary Algorithms and Its Applications Shifali Bhargava Dept. of Mathematics, B.S.A. College, Mathura (U.P)- India. <[email protected]> Abstract This paper introduces evolutionary algorithms with its applications in multi-objective optimization. Here elitist and non-elitist multiobjective evolutionary algorithms are discussed with their advantages and disadvantages. We also discuss constrained multiobjective evolutionary algorithms and their applications in various areas. Key words: evolutionary algorithms, multi-objective optimization, pareto-optimality, elitist. Introduction The term evolutionary algorithm (EA) stands for a class of stochastic optimization methods that simulate the process of natural evolution. The origins of EAs can be traced back to the late 1950s, and since the 1970’s several evolutionary methodologies have been proposed, mainly genetic algorithms, evolutionary programming, and evolution strategies. All of these approaches operate on a set of candidate solutions. Using strong simplifications, this set is subsequently modified by the two basic principles of evolution: selection and variation. Selection represents the competition for resources among living beings. Some are better than others and more likely to survive and to reproduce their genetic information. In evolutionary algorithms, natural selection is simulated by a stochastic selection process. Each solution is given a chance to reproduce a certain number of times, dependent on their quality. Thereby, quality is assessed by evaluating the individuals and assigning them scalar fitness values. The other principle, variation, imitates natural capability of creating “new” living beings by means of recombination and mutation.