Implementing behaviour and life history strategies in IBMs by Geir Huse Department of Fisheries and Marine Biology, University of Bergen, Norway Lecture.

Slides:



Advertisements
Similar presentations
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Advertisements

A First Course in Genetic Algorithms
Chapter 16 Population Genetics and Speciation
Chapter 16 Population Genetics and Speciation
ING models: how they work and how they are constructed I ndividual based N eural network G enetic algoritm by Espen Strand and Geir Huse.
Evolution of Armor Plating in Three-spined Sticklebacks EEB 440: Biology of Fish Isaac Fine, Allie Leitch, Karen Baweja, Meagan Crofoot.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Chapter 18 Chapter 18 The Evolution of Populations.
Spatially explicit IBMs of fish populations by Geir Huse Department of Fisheries and Marine Biology, University of Bergen, Norway Lecture II, NORFA course.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Hedonic models of fish behaviour Sigrunn Eliassen Department of Fisheries and Marine Biology University of Bergen.
Two gerbils in the Negev Desert of Israel:. Gerbillus pyramidum (ca. 40 g) Gerbillus allenbyi (ca. 26 g) The two gerbils differ mostly in size: solitary.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
What Darwin Never Knew How Genetics influences Evolutionary Thought.
Population and Speciation
Evolutionary Intelligence
Beyond Darwin 16.3 and some 17 Notes Can an individual evolve? Is evolution the survival of the fittest? Is evolution predictable?
MECHANISMS FOR EVOLUTION Honors Biology. REVIEW Evidence for Evolution and Examples What is Natural Selection? How did Darwin develop theory of Natural.
An Approach of Artificial Intelligence Application for Laboratory Tests Evaluation Ş.l.univ.dr.ing. Corina SĂVULESCU University of Piteşti.
Selection Pressure & Speciation. Pick Me! Pick Me! We understand that direction of evolution is a complex interaction of genetics, mutation and environmental.
Introduction to Genetic Algorithms and Evolutionary Computation
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
The Evolution of Populations.  Emphasizes the extensive genetic variation within populations and recognizes the importance of quantitative characteristics.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Genetic algorithms Prof Kang Li
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Chapter 5 Evolution of Biodiversity. What is biodiversity? Three different scales – all three contribute to the overall biodiversity of Earth 1.Ecosystem.
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Neural Networks Design  Motivation  Evolutionary training  Evolutionary design of the architecture.
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory.
Dynamic programming A gentle introduction using zooplankton behaviour as an example.
Unit One Evolution and Genetics Chapters 20, 21, and 22.
G ENETIC A LGORITHMS Ranga Rodrigo March 5,
Last lecture summary. SOM supervised x unsupervised regression x classification Topology? Main features? Codebook vector? Output from the neuron?
Mechanisms of Population Evolution
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
Neural Networks And Its Applications By Dr. Surya Chitra.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
What is a phylogenetic tree? Agenda for Tuesday Nov 30 th 1.Mechanisms of Evolution notes.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1. 2 Sylvia S. Mader Concepts of Biology © Zanichelli editore, 2012 Sylvia S. Mader Immagini e concetti della biologia.
Essential Question: How can a change in the environment initiate a change in the population? NATURAL SELECTION.
HARDY-WEINBERG AND GENETIC EQUILIBRIUM Ch pp Warm-up 2/24: Make a double bubble (or Venn diagram) comparing and contrasting convergent and.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
George Yauneridge.  Machine learning basics  Types of learning algorithms  Genetic algorithm basics  Applications and the future of genetic algorithms.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Ecological Speciation- Sticklebacks
Evolving the goal priorities of autonomous agents
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Basics of Genetic Algorithms (MidTerm – only in RED material)
Chapter 15: How Organisms Evolve.
Natural Selection.
رایانش تکاملی evolutionary computing
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult.
EVOLUTION OF POPULATIONS
Basics of Genetic Algorithms
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
Evolution Notes.
SURVIVAL OF THE FITTEST
Presentation transcript:

Implementing behaviour and life history strategies in IBMs by Geir Huse Department of Fisheries and Marine Biology, University of Bergen, Norway Lecture I, NORFA course

Talk outline 1 Introduction 2 Present concept for implementing adaptive traits in IBMs Strategy vectors The genetic algorithm Artificial neural networks 3 Case study Morph evolution in sticklebacks

Life is a lot easier without it.. But Behaviours are abundantly present in the real world Behaviour can have strong impact on spatial and population dynamics Implementing behaviour is a potential advantage of IBMs compared with state variable approaches Why do we need behaviour in IBMs?

1 By applying estimated parameter values for traits 2 Through “rules” thought to represent an evolved strategyrules 3 Through evolved behaviours evaluated by an objective criterion Implementation of adaptive traits in IBMs:

AttributeAttribute vector: (weight, age,position,fitness,….) Chambers 1993 Strategy vector: (parity, SAM, allocation of energy, behavioural strategies,...) Huse et al. (2002) Specififying individuals in IBMs:

”mum” ”dad” ”offspring” Breakpoint The genetic algorithm (Holland 1975) Strategy vector or ”chromosome” Mutation

Reproduction -produce new strategy vectors -recombination -mutation The GA Initiate random population Problem test -update attribute vector New population Generation loop Rank individuals

Artificial neural networks Artificial neural networks can be used to translate strategy vectors into behaviour Input 1  Input 2 .  Input n  Behaviour InputHiddenOutput W ih W ho Weights implemented on strategy vector S

Determine by a fitness measure: Net reproductive rate R 0 Instantaneous rate of increase r These fitness measures are hampered by many assumptions and are often difficult to implement in IBMs Alternatively: use endogenous fitnessendogenous fitness What is a good strategy vector?

Do the GA find optimal solutions? While optimality models always find the best solution to problems, How about adaptation models...? Patch choice model A simple vertical migration scenario In cases were the optimal solution can be calculated, it tends to be found by the GA

Exploring adaptive radiation and speciation in fish by individual- based models (Huse & Hart in prep.) (Gasterosteus aculeatus)

Background Differentiation into limnetic and benthic is seen in pairs of threespine stickleback found in several lakes in British Columbia Hypothesis: co-existence of morphs is governed by habitat specific selection pressures on foraging, with intermediate phenotypes suffering competitive disadvantages (Schluter 1993) Sympatric speciation? Invasions?..

Objectives Develop individual-based model of trophic interactions between stickleback morphotypes Study the effect of diffent prey types, competition, spatial detail and invasions on speciation Evaluate individual-based modelling as a tool in studying speciation

The model: Feeding Two separate prey populations: Limnetic prey: Daphnia 1-2 mm Benthic prey: Asellus 7 mm Each fish gets 250 attempts per generation to get food Prey encounter proportional to relative prey abundance Outcome determined by individual morphotype using Monte Carlo simulation Random sorting of individuals per round of attempts Prey is removed from population when eaten Growth calculated by bioenergetics

The model: Adaptation Strategy vector: (body size, limnetic fidelity, mate selectivity, gill raker length) 11 different alleles [0,1] per locus Individuals are diploid and recombinations are performed as in meiosis Phenotype calculated as the average of the two homologues alleles Fitness criterion: Net reproductive rate R 0 = l x ·m x Offspring production in proportion to fitness

Simulations Four different simulations are presented: 1 Adaptation without competition 2 Adaptation with competition 3 Assortative mating without spatial detail 4 Assortative mating and spatial detail

General results Training decomposition: Individuals act ”silly” due to random initiation of strategies Solved by gradually making tasks more difficult

1 Adaptation without competition: Phenotypic differentiation due to different prey sizes available Gill raker size Body size

2 Adaptation with competition: Phenotypic differentiation from competition Reduced benthic food Reduced limnetic food

3 Assortative mating without spatial detail No population divergence seen despite increased competition and assortative mating Body size Gill raker length

4 Assortative mating and spatial detail

The model predicts phenotypic differentiation to different environmental states The model predicts that sympatric speciation can occur given that prey occur spatially distinct Assortative mating is important in maintaining differentiation and sympatric speciation The methodology may help bridge the gap between phenotypic and genotypic approaches to life history evolution Conclusions

ANN calculations

The patch choice model of Mangel and Clark 1988 by ANN (Huse, Strand & Giske 1999) The problem is to find the patch at each time step that maximises the survival to the horizon given the current state of the individualThe problem is to find the patch at each time step that maximises the survival to the horizon given the current state of the individual

ING model predictions and optimal solutions Pp= local predator abundance Zb = local zooplankton abundance

Makes decision using probability and random numbers Example IF random number < probability of getting prey THEN prey is caught Monte Carlo simulation:

Monte Carlo simulations

Simulating ”survival of the fittest” within the model domain Monte Carlo simulations Those who manage to fulfil the criteria for reproduction in the best way are the fittest Survivors at any time are the fittest No knowledge of optimal strategy   Endogenous fitness