Parallel Genetic Algorithms
|
|
- Godfrey McKinney
- 6 years ago
- Views:
Transcription
1 Parallel Genetic Algorithms for the Calibration of Financial Models Riccardo Gismondi June 13, 2008 High Performance Computing in Finance and Insurance Research Institute for Computational Methods Vienna University of Economics and B.A. Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
2 Contents 1 Genetic Algorithms Introduction and General Concepts How GAs work 2 CIR Interest Rate Model A general overview of IR models CIR model calibration with Genetic Algorithms 3 Parallel Genetic Algorithms and Applications A classification of parallel GAs Application 4 Conclusion Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
3 Genetic Algorithms Introduction and General Concepts Introduction and General Concepts GAs simulate the evolution of a population of individuals, which are possible solutions of a specific problem, through the evolution principle: Survival of the Fittest GAs are search algorithms which apply the mechanism of natural selection and sexual reproduction Genetic Algorithms (GA): John Holland, University of Michigan, Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
4 Genetic Algorithms Introduction and General Concepts Introduction and General Concepts The original model of Holland: population of pop size binary strings of fix length l (called individuals, genotypes, structures, chromosomes) Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
5 Genetic Algorithms Introduction and General Concepts Introduction and General Concepts the evaluation function f plays the role of the environment it rates solutions according to their fitness i.e. how good they are in solving the search problem for a population P of pop size individuals f : P (, + ); f (c i ) = f i, i = 1,..., pop size the set of all binary strings of fixed length l as {0, 1} = 2 l elements is the search space of the GA the fitness landscape is the set of fitness values of the evaluation function on the search space Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
6 Genetic Algorithms Introduction and General Concepts Introduction and General Concepts once that a population of individuals is evaluated through the fitness function a new population is created applying certain operators these operators are selection (inspired from natural selection) crossover (inspired from genetics) mutation (inspired from genetics) crossover and mutation are called genetic operators Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
7 Genetic Algorithms Introduction and General Concepts Introduction and General Concepts The Evolution theory from Darwin tells us that the strongest individuals have a higher ability to adapt to their environment. Therefore, the chance to survive (survival probability) is higher than for weaker individuals. In Holland s GA, the stronger individuals have the higher fitness values because they are better in solving the search problem. For reproduction purposes (mating), the stronger individuals have to be selected prior to the others. Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
8 Genetic Algorithms Introduction and General Concepts Introduction and General Concepts Holland chooses a selection mechanism proportional to the fitness value of the individual. For an individual c i P with f (c i ) = f i, the selected probability is p i = f i pop size i=1 f i These probabilities are taken to construct a biased roulette (roulette wheel mechanism). Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
9 Genetic Algorithms Introduction and General Concepts Introduction and General Concepts Figure: Roulette Wheel Mechanism The 4 individuals A1, A2, A3 and A4, with selection probability 0.12, 0.18, 0.3 and 0.4, are represented by the slots of the biased roulette. These slots are proportional to the probability of selection. Example: if the selection operator generates c = 0.88 as random number, the individual A4 is selected. Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
10 Genetic Algorithms Introduction and General Concepts Introduction and General Concepts Each time an individual is selected, the individual is copied into the mating-pool. At the end of the selection process, the mating-pool contains exactly pop size individuals. After this, the new population is created applying the genetic operators crossover and mutation to the individuals of the mating-pool. Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
11 Genetic Algorithms Introduction and General Concepts Introduction and General Concepts after a random selection of two parent individuals and one crossover point, the elements right to the crossover point are swapped two new individuals are created. The crossover operator is applied n 2 times, according to a certain probability p c such to generate exactly n new children. If the crossover-operator is not applied, the children are exactly like their parents. Figure: Crossover Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
12 Genetic Algorithms Introduction and General Concepts Introduction and General Concepts after the application of the crossover, according to a certain (usually very small) probability p m, the mutation operator is applied to every bit of every individual and this changes the bit-value Figure: Mutation like the crossover is a metaphor of the sexual reproduction, the mutation operator models the genetic phenomenon of rare changes in the genetic code of an individual. Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
13 Genetic Algorithms Introduction and General Concepts Introduction and General Concepts Figure: GA Procedure Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
14 Genetic Algorithms Solving a Maximization Problem How GAs work To understand how genetic algorithms work, consider to find the maximum of the function f (x) = x sin (10πx) + 1, x [ 1, 2] In the implementation of the genetic algorithm, you have to consider the following points: Genetic representation of potential solution A way to create initial solution Evaluation function: fitness Selection process Genetic operators Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
15 Genetic Algorithms Solving a Maximization Problem How GAs work Figure: Function to be Maximized Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
16 Genetic Algorithms How GAs work Representation Binary vector as chromosome to represent real value of the variable x. Length of domain is 3. Precision requirements (for example): 6 places after decimal point. The range [ 1, 2] should be divided into at least equal size range 22 bits are required as a binary vector, since = 2 21 < = Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
17 Genetic Algorithms How GAs work Representation The mapping for a binary string b 21 b b 0 into a real number x is a 2-step procedure: 1 Convert the string b 21 b b 0 from base 2 to a base 10 ( b 21 b b 0 ) 2 = 2 find a corresponding real number x: ( 21 ) b i 2 i i=0 x = 1 + x = x Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
18 Representation Genetic Algorithms How GAs work for example ( ) represents the number , since and x = 1 + x ( ) 2 = = = Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
19 Genetic Algorithms How GAs work Initial Population The initialization process is very simple: we create a random population of pop size binary vectors of 22 bits. e.g.: v 1 = ( ) v 2 = ( )... v pop size = ( ) If we do have some knowledge about the distribution of potential optima, we may use such information. Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
20 Genetic Algorithms How GAs work Evaluation Function Evaluation function for binary vectors is equivalent to the function f. e.g.: v 1 = ( ) = v 2 = ( ) = v 3 = ( ) = consequently: eval(v 1 ) = f (v 1 ) = eval(v 2 ) = f (v 2 ) = eval(v 3 ) = f (v 3 ) = and v 3 is the best of the 3 chromosomes (max. problem!) Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
21 Genetic Algorithms How GAs work Genetic Operators - Mutation Mutation alters one or more genes (positions in a chromosome) with probability equal to the p m. Assume that the fifth gene from the v 3 chromosome was selected for a mutation. Since the fifth gene is 0, it would be flipped to 1. After this operation the new chromosome would be v 3 = ( ) = with eval(v 3) = f (v 3) = Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
22 Genetic Algorithms Genetic Operators - Mutation How GAs work On the other hand, if the 10th gene was selected, then v 3 = ( ) = eval(v 3 ) = f (v 3 ) = Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
23 Genetic Algorithms How GAs work Genetic Operators - Crossover Let us illustrate the crossover operator on v 2 and v 3 which are selected from a population with probability p c Suppose that the (one-)crossover point was (randomly) selected after the fifth gene: the new off spring are v 2 = ( ) = v 3 = ( ) = v 2 = ( ) = v 3 = ( ) = Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
24 Genetic Algorithms Genetic Operators - Crossover How GAs work In general: 1-point crossover: 2-point crossover: m-point crossover (e.g. m=4): v 2 = ( ) v 3 = ( ) v 2 = ( ) v 3 = ( ) v 2 = ( ) v 3 = ( ) Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
25 Genetic Algorithms How GAs work Selection Process Different methods for selection: in this talk Roulette wheel Without any loss of generality, we can assume a maximization problem only, in fact: min (f (x)) = max ( f (x)) Moreover we can assume that f takes only positive values; otherwise we can add a positive constant C: max (f (x)) = max (f (x) + C) In order to construct a Roulette wheel with slots sized according to the fitness we proceed as follows (see next slides) Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
26 Selection Process Genetic Algorithms How GAs work Calculate the fitness value eval(v i ) for each chromosome v i (i = 1,..., pop size) Find the total fitness of the population F = pop size i=1 eval(v i ) Calculate the probability of selection p i for each chromosome v i (i = 1,..., pop size): p i = eval(v i) F Calculate a cumulative probability q i for each chromosome v i (i = 1,..., pop size): i q i = j=1 Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47 p j
27 Selection Process Genetic Algorithms How GAs work Figure: Roulette Wheel Mechanism Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
28 Genetic Algorithms How GAs work Selection Process The selection process is based on spinning the roulette pop size times each time we select a single chromosome for a new population in the following way: 1 generate a random number R U(0, 1) 2 if r < q 1 then select the chromosome v 1 ; otherwise select the i-th chromosome v i (2 i pop size) such that q i 1 < r q i Obviously, some chromosome would be selected more than once: the best chromosomes get more copies, the average stay even, and the worst die off (Schema Theorem) Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
29 CIR Interest Rate Model A general overview of IR models A general overview of IR models The interest rate, usually written r(t, T ) is the rate at which an entity can borrow money for period T t of time The short rate, usually written r t is the (annualized) interest rate at which an entity can borrow money for an infinitesimally short period of time, r t = r(t, t) Specifying the current short rate does not specify the entire yield curve. Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
30 CIR Interest Rate Model A general overview of IR models A general overview of IR models However, no-arbitrage arguments show that, under some fairly relaxed technical conditions, if we model the evolution of r t as a stochastic process under a risk-neutral measure Q then the price at time t of a zero-coupon bond maturing at time T is given by ( T ) P(t, T ) = E(exp r s ds F t ) t where F t is the natural filtration for the process. Thus specifying a model for the short rate specifies future bond prices. This means that forward rates are also specified by the usual formula: f (t, T ) = ln (P(t, T )) T Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
31 CIR Interest Rate Model A general overview of IR models A general overview of IR models In finance there are different models for the short rate we differentiate between one-factor and multi-factor-models one-factor models: Vasicek Model: dr t = a(b r t)dt + σdw t Cox-Ingersoll-Ross-Model: multi-factor models: Longstaff-Schwarz-Model: dr t = α(γ r t)dt + ρ r tdw t dx t = (θ Y t)dt + X tσdw t Chen-Model: dy t = (ζ Y t)dt + Y tσdw t dr t = (θ α t)dt + r tσ tdw t dα t = (ζ α t)dt + α tσ tdw t dσ t = (β σ t)dt + (σ t)ηdw t Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
32 CIR model calibration CIR Interest Rate Model CIR model calibration with Genetic Algorithms Once that a model for the short rate is chosen, it is very important to estimate the optimal parameters of the model. In Finance this procedure is well known as the calibration of the model. We are looking for the model-parameters that optimally generate prices that are very near to real market prices. That means the calibration of a model is equivalent to solve an optimization problem of the form: f (θ 1, θ 2,..., θ n ) = n w i ( ) Pi mod Pi market 2 i=1 Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
33 CIR model calibration CIR Interest Rate Model CIR model calibration with Genetic Algorithms For the CIR model: f (r 0, φ 1, φ 2, φ 3 ) = n w i ( Pi mod i=1 ) Pi market 2 Pi mod (t, T i ) = F (t, T i ) exp ( G(t,T i )r 0 ) [ φ 1 exp (φ 2(T i t)) F (t, T i ) = ( φ 2 exp (φ 1 (T i t)) 1 ) + φ 1 [ ( exp (φ 1 (T i t)) 1 ) ] G(t, T i ) = φ 2 ( exp (φ 1 (T i t)) 1 ) + φ 1 the CIR model is characterized by a very high non-linear objective function it is also not known whether this function is convex or concave (global optimization) Genetic Algorithm Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47 ] φ3
34 Parallel Genetic Algorithms and Applications A classification of parallel GAs Classification of parallel GA The basic idea behind most parallel programs is to divide a large problem into smaller tasks tasks are solved simultaneously on multiple processors In the classification of parallel GA (Adamidis 1994, Lin et al. 1994, Alba & Troya 1999, Tomassini 1999, Cantu-Paz 2000) we can recognize 4 major types Single-Population master-slave GAs, Multiple-population GAs, Fine-grained GAs, Hierarchical hybrids Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
35 Parallel Genetic Algorithms and Applications Classification of parallel GA A classification of parallel GAs Single-population master-slave GAs have a single population one master node executes the GA (selection, crossover, mutation) and the evaluation of fitness is performed by the slave nodes Multiple-population GAs (island model) they consist of several subpopulations that exchange individuals occassionally this exchange is called migration and is controlled by several parameters (e.g. frequency of migration, number and destination of migrants, and the selection method for choosing the migrants) Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
36 Parallel Genetic Algorithms and Applications Classification of parallel GA A classification of parallel GAs Fine-grained GAs they consist of a single-spatially-structured population the population structure is usually 2-dimensional and there is only one individual per grid point ideally, there is one processor per individual, so the evaluation of fitness is performed simultaneously for all the individuals selection and mating are restricted to a small neighbourhood around each individual this class of parallel GA is also sometimes called as diffusion-model Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
37 Parallel Genetic Algorithms and Applications Classification of parallel GA A classification of parallel GAs Hierarchical GAs these are multiple-deme algorithms with single-population parallel GAs a hierarchical parallel GA combines the benefits of its components and has the potential of better performance than any of them alone the hierarchical algorithms are very well suited to be implemented on symmetric multi-processors Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
38 Parallel Genetic Algorithms and Applications Application CIR model calibration with a Parallel GA we implemented a Parallel Genetic Algorithm in the programming language C and MPI it is a Multiple-Population GA based on a n m torus therefore we need, n m slave nodes and 1 master node our application has approx lines of code Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
39 Parallel Genetic Algorithms and Applications Application CIR model calibration with a Parallel GA description of the algorithm the master-node reads the input parameters and broadcasts them to all slave nodes every slave node generates a start-population applies the roulette wheel mechanism for selection applies single-point crossovers applies mutations evaluates the fitness of the population every epoch sends elements to its neighbours according to the chosen migration strategy (no migration, random selection, elitist selection) and sends the best individual back to the master-node the master node evaluates all the individuals and again chooses the best Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
40 Parallel Genetic Algorithms and Applications Application CIR model calibration with a Parallel GA the Torus Topology Figure: 6 x 4 Torus Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
41 Parallel Genetic Algorithms and Applications Application CIR model calibration with a Parallel GA the visualization with XMPI clearly tells us that this is no highly parallel application there is a huge communication overhead between the slaves Figure: Migration of Elements between the Neighbours Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
42 Parallel Genetic Algorithms and Applications Application CIR model calibration with a Parallel GA to test the efficiency of the migration strategy we performed 100 runs with the following parameters generations: epoch = 250 generations popsize = 50 Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
43 Parallel Genetic Algorithms and Applications Application CIR model calibration with a Parallel GA migration with 2 elements preliminary results: No Random Elitist Migration Migration Migration Min Max Std.Dev Mean Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
44 Parallel Genetic Algorithms and Applications Application CIR model calibration with a Parallel GA migration with 5 elements preliminary results: No Random Elitist Migration Migration Migration Min Max Std.Dev Mean Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
45 Parallel Genetic Algorithms and Applications Application CIR model calibration with a Parallel GA migration with 10 elements preliminary results: No Random Elitist Migration Migration Migration Min Max Std.Dev Mean Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
46 Conclusion Conclusion Parallel Genetic Algorithms definitely outperform Single Node GAs the way of migrating the elements, e.g. swapping the elements with the neighbours only or to apply a hamming-distance-based sending method as well as the selection of the elements sent, e.g. random sampling of elements send elements that fit best can be discussed in further detail Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
47 Conclusion Thank you for your attention! Riccardo Gismondi () Parallel Genetic Algorithms June 13, / 47
Genetic Algorithms. Seth Bacon. 4/25/2005 Seth Bacon 1
Genetic Algorithms Seth Bacon 4/25/2005 Seth Bacon 1 What are Genetic Algorithms Search algorithm based on selection and genetics Manipulate a population of candidate solutions to find a good solution
More informationhow should the GA proceed?
how should the GA proceed? string fitness 10111 10 01000 5 11010 3 00011 20 which new string would be better than any of the above? (the GA does not know the mapping between strings and fitness values!)
More informationEvolutionary Computation
Evolutionary Computation - Computational procedures patterned after biological evolution. - Search procedure that probabilistically applies search operators to set of points in the search space. - Lamarck
More informationLecture 9 Evolutionary Computation: Genetic algorithms
Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Simulation of natural evolution Genetic algorithms Case study: maintenance scheduling with genetic
More informationSearch. Search is a key component of intelligent problem solving. Get closer to the goal if time is not enough
Search Search is a key component of intelligent problem solving Search can be used to Find a desired goal if time allows Get closer to the goal if time is not enough section 11 page 1 The size of the search
More informationCSC 4510 Machine Learning
10: Gene(c Algorithms CSC 4510 Machine Learning Dr. Mary Angela Papalaskari Department of CompuBng Sciences Villanova University Course website: www.csc.villanova.edu/~map/4510/ Slides of this presenta(on
More informationParallel/Distributed Evolutionary Computation The influence of spatial interaction in evolutionary behaviour
Parallel/Distributed Evolutionary Computation The influence of spatial interaction in evolutionary behaviour Garrett Camp {camp@enel.ucalgary.ca} CPSC605 Simple Genetic Algorithms Based on darwin's theory
More informationV. Evolutionary Computing. Read Flake, ch. 20. Genetic Algorithms. Part 5A: Genetic Algorithms 4/10/17. A. Genetic Algorithms
V. Evolutionary Computing A. Genetic Algorithms 4/10/17 1 Read Flake, ch. 20 4/10/17 2 Genetic Algorithms Developed by John Holland in 60s Did not become popular until late 80s A simplified model of genetics
More informationGenetic Algorithms: Basic Principles and Applications
Genetic Algorithms: Basic Principles and Applications C. A. MURTHY MACHINE INTELLIGENCE UNIT INDIAN STATISTICAL INSTITUTE 203, B.T.ROAD KOLKATA-700108 e-mail: murthy@isical.ac.in Genetic algorithms (GAs)
More informationV. Evolutionary Computing. Read Flake, ch. 20. Assumptions. Genetic Algorithms. Fitness-Biased Selection. Outline of Simplified GA
Part 5A: Genetic Algorithms V. Evolutionary Computing A. Genetic Algorithms Read Flake, ch. 20 1 2 Genetic Algorithms Developed by John Holland in 60s Did not become popular until late 80s A simplified
More informationChapter 8: Introduction to Evolutionary Computation
Computational Intelligence: Second Edition Contents Some Theories about Evolution Evolution is an optimization process: the aim is to improve the ability of an organism to survive in dynamically changing
More informationThe Role of Crossover in Genetic Algorithms to Solve Optimization of a Function Problem Falih Hassan
The Role of Crossover in Genetic Algorithms to Solve Optimization of a Function Problem Falih Hassan ABSTRACT The genetic algorithm is an adaptive search method that has the ability for a smart search
More informationGENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS
GENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS A genetic algorithm is a random search technique for global optimisation in a complex search space. It was originally inspired by an
More informationIV. Evolutionary Computing. Read Flake, ch. 20. Assumptions. Genetic Algorithms. Fitness-Biased Selection. Outline of Simplified GA
IV. Evolutionary Computing A. Genetic Algorithms Read Flake, ch. 20 2014/2/26 1 2014/2/26 2 Genetic Algorithms Developed by John Holland in 60s Did not become popular until late 80s A simplified model
More informationFundamentals of Genetic Algorithms
Fundamentals of Genetic Algorithms : AI Course Lecture 39 40, notes, slides www.myreaders.info/, RC Chakraborty, e-mail rcchak@gmail.com, June 01, 2010 www.myreaders.info/html/artificial_intelligence.html
More informationLecture 15: Genetic Algorithms
Lecture 15: Genetic Algorithms Dr Roman V Belavkin BIS3226 Contents 1 Combinatorial Problems 1 2 Natural Selection 2 3 Genetic Algorithms 3 31 Individuals and Population 3 32 Fitness Functions 3 33 Encoding
More informationEvolutionary computation
Evolutionary computation Andrea Roli andrea.roli@unibo.it DEIS Alma Mater Studiorum Università di Bologna Evolutionary computation p. 1 Evolutionary Computation Evolutionary computation p. 2 Evolutionary
More informationEvolutionary computation
Evolutionary computation Andrea Roli andrea.roli@unibo.it Dept. of Computer Science and Engineering (DISI) Campus of Cesena Alma Mater Studiorum Università di Bologna Outline 1 Basic principles 2 Genetic
More informationData Warehousing & Data Mining
13. Meta-Algorithms for Classification Data Warehousing & Data Mining Wolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 13.
More informationInterplanetary Trajectory Optimization using a Genetic Algorithm
Interplanetary Trajectory Optimization using a Genetic Algorithm Abby Weeks Aerospace Engineering Dept Pennsylvania State University State College, PA 16801 Abstract Minimizing the cost of a space mission
More informationParallel Genetic Algorithms. Master s Thesis Laurens Jan Pit 30/08/95 Department of Computer Science Leiden University
Parallel Genetic Algorithms Master s Thesis Laurens Jan Pit 30/08/95 Department of Computer Science Leiden University 1 2 Preface Can. Leiden, 30/08/95 Laurens Jan Pit 3 4 Abstract In 1992 Boers and Kuiper
More informationGenetic Algorithms & Modeling
Genetic Algorithms & Modeling : Soft Computing Course Lecture 37 40, notes, slides www.myreaders.info/, RC Chakraborty, e-mail rcchak@gmail.com, Aug. 10, 2010 http://www.myreaders.info/html/soft_computing.html
More informationThe European Applied Business Research Conference Rothenburg, Germany 2002
The European Applied Business Research Conference Rothenburg, Germany 00 Using Genetic Algorithms To Optimise Kanban-Based Production System M Al-Tahat, (E-mail: mohammadal-tahat@mailinguniboit), University
More informationMEAN-ABSOLUTE DEVIATION PORTFOLIO SELECTION MODEL WITH FUZZY RETURNS. 1. Introduction
Iranian Journal of Fuzzy Systems Vol. 8, No. 4, (2011) pp. 61-75 61 MEAN-ABSOLUTE DEVIATION PORTFOLIO SELECTION MODEL WITH FUZZY RETURNS Z. QIN, M. WEN AND C. GU Abstract. In this paper, we consider portfolio
More informationGenetic Algorithm for Solving the Economic Load Dispatch
International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 5 (2014), pp. 523-528 International Research Publication House http://www.irphouse.com Genetic Algorithm
More informationEvolutionary Computation. DEIS-Cesena Alma Mater Studiorum Università di Bologna Cesena (Italia)
Evolutionary Computation DEIS-Cesena Alma Mater Studiorum Università di Bologna Cesena (Italia) andrea.roli@unibo.it Evolutionary Computation Inspiring principle: theory of natural selection Species face
More informationSchema Theory. David White. Wesleyan University. November 30, 2009
November 30, 2009 Building Block Hypothesis Recall Royal Roads problem from September 21 class Definition Building blocks are short groups of alleles that tend to endow chromosomes with higher fitness
More informationEvolutionary Computation Theory. Jun He School of Computer Science University of Birmingham Web: jxh
Evolutionary Computation Theory Jun He School of Computer Science University of Birmingham Web: www.cs.bham.ac.uk/ jxh Outline Motivation History Schema Theorem Convergence and Convergence Rate Computational
More informationGenetic Algorithms and Genetic Programming Lecture 17
Genetic Algorithms and Genetic Programming Lecture 17 Gillian Hayes 28th November 2006 Selection Revisited 1 Selection and Selection Pressure The Killer Instinct Memetic Algorithms Selection and Schemas
More informationCrossover Techniques in GAs
Crossover Techniques in GAs Debasis Samanta Indian Institute of Technology Kharagpur dsamanta@iitkgp.ac.in 16.03.2018 Debasis Samanta (IIT Kharagpur) Soft Computing Applications 16.03.2018 1 / 1 Important
More informationGenetic Algorithm. Outline
Genetic Algorithm 056: 166 Production Systems Shital Shah SPRING 2004 Outline Genetic Algorithm (GA) Applications Search space Step-by-step GA Mechanism Examples GA performance Other GA examples 1 Genetic
More informationWhat is Natural Selection? Natural & Artificial Selection. Answer: Answer: What are Directional, Stabilizing, Disruptive Natural Selection?
What is Natural Selection? Natural & Artificial Selection Practice Quiz What are Directional, Stabilizing, Disruptive Natural Selection? When an environment selects for a trait in organisms. Who came up
More informationEvolutionary Design I
Evolutionary Design I Jason Noble jasonn@comp.leeds.ac.uk Biosystems group, School of Computing Evolutionary Design I p.1/29 This lecture Harnessing evolution in a computer program How to construct a genetic
More informationPopulation Genetics & Evolution
The Theory of Evolution Mechanisms of Evolution Notes Pt. 4 Population Genetics & Evolution IMPORTANT TO REMEMBER: Populations, not individuals, evolve. Population = a group of individuals of the same
More informationHow robust are the predictions of the W-F Model?
How robust are the predictions of the W-F Model? As simplistic as the Wright-Fisher model may be, it accurately describes the behavior of many other models incorporating additional complexity. Many population
More informationIntelligens Számítási Módszerek Genetikus algoritmusok, gradiens mentes optimálási módszerek
Intelligens Számítási Módszerek Genetikus algoritmusok, gradiens mentes optimálási módszerek 2005/2006. tanév, II. félév Dr. Kovács Szilveszter E-mail: szkovacs@iit.uni-miskolc.hu Informatikai Intézet
More informationResearch Article Effect of Population Structures on Quantum-Inspired Evolutionary Algorithm
Applied Computational Intelligence and So Computing, Article ID 976202, 22 pages http://dx.doi.org/10.1155/2014/976202 Research Article Effect of Population Structures on Quantum-Inspired Evolutionary
More informationEvolutionary Algorithms: Introduction. Department of Cybernetics, CTU Prague.
Evolutionary Algorithms: duction Jiří Kubaĺık Department of Cybernetics, CTU Prague http://cw.felk.cvut.cz/doku.php/courses/a4m33bia/start pcontents 1. duction to Evolutionary Algorithms (EAs) Pioneers
More informationBiology 11 UNIT 1: EVOLUTION LESSON 2: HOW EVOLUTION?? (MICRO-EVOLUTION AND POPULATIONS)
Biology 11 UNIT 1: EVOLUTION LESSON 2: HOW EVOLUTION?? (MICRO-EVOLUTION AND POPULATIONS) Objectives: By the end of the lesson you should be able to: Describe the 2 types of evolution Describe the 5 ways
More informationComputational intelligence methods
Computational intelligence methods GA, schemas, diversity Pavel Kordík, Martin Šlapák Katedra teoretické informatiky FIT České vysoké učení technické v Praze MI-MVI, ZS 2011/12, Lect. 5 https://edux.fit.cvut.cz/courses/mi-mvi/
More informationLecture 22. Introduction to Genetic Algorithms
Lecture 22 Introduction to Genetic Algorithms Thursday 14 November 2002 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Readings: Sections 9.1-9.4, Mitchell Chapter 1, Sections
More informationA GA Mechanism for Optimizing the Design of attribute-double-sampling-plan
A GA Mechanism for Optimizing the Design of attribute-double-sampling-plan Tao-ming Cheng *, Yen-liang Chen Department of Construction Engineering, Chaoyang University of Technology, Taiwan, R.O.C. Abstract
More informationGenetic Algorithms. Donald Richards Penn State University
Genetic Algorithms Donald Richards Penn State University Easy problem: Find the point which maximizes f(x, y) = [16 x(1 x)y(1 y)] 2, x, y [0,1] z (16*x*y*(1-x)*(1-y))**2 0.829 0.663 0.497 0.331 0.166 1
More informationRepresentation and Hidden Bias II: Eliminating Defining Length Bias in Genetic Search via Shuffle Crossover
Representation and Hidden Bias II: Eliminating Defining Length Bias in Genetic Search via Shuffle Crossover Abstract The traditional crossover operator used in genetic search exhibits a position-dependent
More informationScaling Up. So far, we have considered methods that systematically explore the full search space, possibly using principled pruning (A* etc.).
Local Search Scaling Up So far, we have considered methods that systematically explore the full search space, possibly using principled pruning (A* etc.). The current best such algorithms (RBFS / SMA*)
More informationAbstract In this paper we consider a parallel and distributed computation of genetic algorithms on loosely-coupled multiprocessor systems. Genetic Alg
A Parallel and Distributed Genetic Algorithm on Loosely-coupled Multiprocessor Systems 1998 Graduate School of Engineering Electrical and Information Engineering University of the Ryukyus Takashi MATSUMURA
More informationMulti-objective genetic algorithm
Multi-objective genetic algorithm Robin Devooght 31 March 2010 Abstract Real world problems often present multiple, frequently conflicting, objectives. The research for optimal solutions of multi-objective
More informationA Comparison of GAs Penalizing Infeasible Solutions and Repairing Infeasible Solutions on the 0-1 Knapsack Problem
A Comparison of GAs Penalizing Infeasible Solutions and Repairing Infeasible Solutions on the 0-1 Knapsack Problem Jun He 1, Yuren Zhou 2, and Xin Yao 3 1 J. He is with the Department of Computer Science,
More informationCentric Selection: a Way to Tune the Exploration/Exploitation Trade-off
: a Way to Tune the Exploration/Exploitation Trade-off David Simoncini, Sébastien Verel, Philippe Collard, Manuel Clergue Laboratory I3S University of Nice-Sophia Antipolis / CNRS France Montreal, July
More informationDevelopment. biologically-inspired computing. lecture 16. Informatics luis rocha x x x. Syntactic Operations. biologically Inspired computing
lecture 16 -inspired S S2 n p!!! 1 S Syntactic Operations al Code:N Development x x x 1 2 n p S Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms
More informationEvolutionary Algorithms: Introduction. The Czech Institute of Informatics, Robotics and Cybernetics CTU Prague
: Introduction Jiří Kubaĺık The Czech Institute of Informatics, Robotics and Cybernetics CTU Prague http://cw.felk.cvut.cz/doku.php/courses/a0m33eoa/start pcontents Representation Operators Population
More informationCOMP3411: Artificial Intelligence 7a. Evolutionary Computation
COMP3411 14s1 Evolutionary Computation 1 COMP3411: Artificial Intelligence 7a. Evolutionary Computation Outline Darwinian Evolution Evolutionary Computation paradigms Simulated Hockey Evolutionary Robotics
More informationGenetic Learning of Firms in a Competitive Market
FH-Kiel, Germany University of Applied Sciences Andreas Thiemer, e-mail: andreas.thiemer@fh-kiel.de Genetic Learning of Firms in a Competitive Market Summary: This worksheet deals with the adaptive learning
More informationReproduction- passing genetic information to the next generation
166 166 Essential Question: How has biological evolution led to the diversity of life? B-5 Natural Selection Traits that make an organism more or less likely to survive in an environment and reproduce
More informationGene Pool Recombination in Genetic Algorithms
Gene Pool Recombination in Genetic Algorithms Heinz Mühlenbein GMD 53754 St. Augustin Germany muehlenbein@gmd.de Hans-Michael Voigt T.U. Berlin 13355 Berlin Germany voigt@fb10.tu-berlin.de Abstract: A
More information[Read Chapter 9] [Exercises 9.1, 9.2, 9.3, 9.4]
1 EVOLUTIONARY ALGORITHMS [Read Chapter 9] [Exercises 9.1, 9.2, 9.3, 9.4] Evolutionary computation Prototypical GA An example: GABIL Schema theorem Genetic Programming Individual learning and population
More informationStochastic Search: Part 2. Genetic Algorithms. Vincent A. Cicirello. Robotics Institute. Carnegie Mellon University
Stochastic Search: Part 2 Genetic Algorithms Vincent A. Cicirello Robotics Institute Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 cicirello@ri.cmu.edu 1 The Genetic Algorithm (GA)
More informationChapter 17: Population Genetics and Speciation
Chapter 17: Population Genetics and Speciation Section 1: Genetic Variation Population Genetics: Normal Distribution: a line graph showing the general trends in a set of data of which most values are near
More informationZebo Peng Embedded Systems Laboratory IDA, Linköping University
TDTS 01 Lecture 8 Optimization Heuristics for Synthesis Zebo Peng Embedded Systems Laboratory IDA, Linköping University Lecture 8 Optimization problems Heuristic techniques Simulated annealing Genetic
More informationMutation, Selection, Gene Flow, Genetic Drift, and Nonrandom Mating Results in Evolution
Mutation, Selection, Gene Flow, Genetic Drift, and Nonrandom Mating Results in Evolution 15.2 Intro In biology, evolution refers specifically to changes in the genetic makeup of populations over time.
More informationUsing Evolutionary Techniques to Hunt for Snakes and Coils
Using Evolutionary Techniques to Hunt for Snakes and Coils Abstract The snake-in-the-box problem is a difficult problem in mathematics and computer science that deals with finding the longest-possible
More informationBounded Approximation Algorithms
Bounded Approximation Algorithms Sometimes we can handle NP problems with polynomial time algorithms which are guaranteed to return a solution within some specific bound of the optimal solution within
More informationSolutions to Even-Numbered Exercises to accompany An Introduction to Population Genetics: Theory and Applications Rasmus Nielsen Montgomery Slatkin
Solutions to Even-Numbered Exercises to accompany An Introduction to Population Genetics: Theory and Applications Rasmus Nielsen Montgomery Slatkin CHAPTER 1 1.2 The expected homozygosity, given allele
More informationEvolution Test Review
Name Evolution Test Review Period 1) A group of interbreeding organisms (a species) living in a given area is called population 2) Give an example of a species. Ex. One wolf Give an example of a population.
More informationNOTES CH 17 Evolution of. Populations
NOTES CH 17 Evolution of Vocabulary Fitness Genetic Drift Punctuated Equilibrium Gene flow Adaptive radiation Divergent evolution Convergent evolution Gradualism Populations 17.1 Genes & Variation Darwin
More informationOptimal Operation of Large Power System by GA Method
Journal of Emerging Trends in Engineering and Applied Sciences (JETEAS) (1): 1-7 Scholarlink Research Institute Journals, 01 (ISSN: 11-7016) jeteas.scholarlinkresearch.org Journal of Emerging Trends in
More informationAn artificial chemical reaction optimization algorithm for. multiple-choice; knapsack problem.
An artificial chemical reaction optimization algorithm for multiple-choice knapsack problem Tung Khac Truong 1,2, Kenli Li 1, Yuming Xu 1, Aijia Ouyang 1, and Xiaoyong Tang 1 1 College of Information Science
More informationProcesses of Evolution
15 Processes of Evolution Forces of Evolution Concept 15.4 Selection Can Be Stabilizing, Directional, or Disruptive Natural selection can act on quantitative traits in three ways: Stabilizing selection
More informationThe Story So Far... The central problem of this course: Smartness( X ) arg max X. Possibly with some constraints on X.
Heuristic Search The Story So Far... The central problem of this course: arg max X Smartness( X ) Possibly with some constraints on X. (Alternatively: arg min Stupidness(X ) ) X Properties of Smartness(X)
More informationOVERVIEW. L5. Quantitative population genetics
L5. Quantitative population genetics OVERVIEW. L1. Approaches to ecological modelling. L2. Model parameterization and validation. L3. Stochastic models of population dynamics (math). L4. Animal movement
More informationMatt Heavner CSE710 Fall 2009
Matt Heavner mheavner@buffalo.edu CSE710 Fall 2009 Problem Statement: Given a set of cities and corresponding locations, what is the shortest closed circuit that visits all cities without loops?? Fitness
More informationMajor questions of evolutionary genetics. Experimental tools of evolutionary genetics. Theoretical population genetics.
Evolutionary Genetics (for Encyclopedia of Biodiversity) Sergey Gavrilets Departments of Ecology and Evolutionary Biology and Mathematics, University of Tennessee, Knoxville, TN 37996-6 USA Evolutionary
More informationDetermination of Optimal Tightened Normal Tightened Plan Using a Genetic Algorithm
Journal of Modern Applied Statistical Methods Volume 15 Issue 1 Article 47 5-1-2016 Determination of Optimal Tightened Normal Tightened Plan Using a Genetic Algorithm Sampath Sundaram University of Madras,
More informationS0214 : GPU Based Stacking Sequence Generation For Composite Skins Using GA
S0214 : GPU Based Stacking Sequence Generation For Composite Skins Using GA Date: 16th May 2012 Wed, 3pm to 3.25pm(Adv. Session) Sathyanarayana K., Manish Banga, and Ravi Kumar G. V. V. Engineering Services,
More informationIntroduction to Evolutionary Computation
Introduction to Evolutionary Computation 1 Evolutionary Computation Different lines of investigation in simulated evolution GA (Genetic Algorithms) ES (Evolution Strategies) EP (Evolutionary Programming)
More informationIntroduction to Digital Evolution Handout Answers
Introduction to Digital Evolution Handout Answers Note to teacher: The questions in this handout and the suggested answers (in red, below) are meant to guide discussion, not be an assessment. It is recommended
More information5/31/2012. Speciation and macroevolution - Chapter
Speciation and macroevolution - Chapter Objectives: - Review meiosis -Species -Repro. Isolating mechanisms - Speciation -Is evolution always slow -Extinction How Are Populations, Genes, And Evolution Related?
More informationGender Separation and Mating Constraints
Gender Separation and Mating Constraints Dana Vrajitoru danav@cs.iusb.edu Intelligent Systems Laboratory, Computer and Information Sciences Department, Indiana University South Bend, 1700 Mishawaka Ave,
More informationGecco 2007 Tutorial / Grammatical Evolution
Gecco 2007 Grammatical Evolution Tutorial Conor Ryan Biocomputing and Developmental Systems Group Department of Computer Science and Information Systems University of Limerick Copyright is held by the
More informationPopulation Genetics: a tutorial
: a tutorial Institute for Science and Technology Austria ThRaSh 2014 provides the basic mathematical foundation of evolutionary theory allows a better understanding of experiments allows the development
More informationI N N O V A T I O N L E C T U R E S (I N N O l E C) Petr Kuzmič, Ph.D. BioKin, Ltd. WATERTOWN, MASSACHUSETTS, U.S.A.
I N N O V A T I O N L E C T U R E S (I N N O l E C) Binding and Kinetics for Experimental Biologists Lecture 2 Evolutionary Computing: Initial Estimate Problem Petr Kuzmič, Ph.D. BioKin, Ltd. WATERTOWN,
More informationCOMP3411: Artificial Intelligence 10a. Evolutionary Computation
COMP3411 16s1 Evolutionary Computation 1 COMP3411: Artificial Intelligence 10a. Evolutionary Computation Outline Darwinian Evolution Evolutionary Computation paradigms Simulated Hockey Evolutionary Robotics
More informationGrade 11 Biology SBI3U 12
Grade 11 Biology SBI3U 12 } We ve looked at Darwin, selection, and evidence for evolution } We can t consider evolution without looking at another branch of biology: } Genetics } Around the same time Darwin
More informationArtificial Intelligence Methods (G5BAIM) - Examination
Question 1 a) According to John Koza there are five stages when planning to solve a problem using a genetic program. What are they? Give a short description of each. (b) How could you cope with division
More informationSexual and Asexual Reproduction. Cell Reproduction TEST Friday, 11/13
Sexual and Asexual Reproduction Cell Reproduction TEST Friday, 11/13 How many chromosomes do humans have? What are Chromosomes? How many chromosomes came from your mom? How many chromosomes came from your
More informationLecture 14 Chapter 11 Biology 5865 Conservation Biology. Problems of Small Populations Population Viability Analysis
Lecture 14 Chapter 11 Biology 5865 Conservation Biology Problems of Small Populations Population Viability Analysis Minimum Viable Population (MVP) Schaffer (1981) MVP- A minimum viable population for
More informationWhy Topology Matters. Spatial Evolutionary Algorithms Evolution in Space and Time. Island Population Topologies. Main Population Topologies
Why Topology Matters Spatial Evolutionary Algorithms Evolution in Space and Time Marco Tomassini marco.tomassini@unil.ch University of Lausanne, Switzerland The spatial structure of a population will be
More informationEfficiency Improvement of PM Disc Motor Using Genetic Algorithm
Efficiency Improvement of PM Disc Motor Using Genetic Algorithm Goga Cvetkovski 1, Lidija Petkovska 1 and inclair Gair 2 1 s. Cyril & Methodius University, Faculty of Electrical Engineering, P.O. Box 574,
More informationOutline of lectures 3-6
GENOME 453 J. Felsenstein Evolutionary Genetics Autumn, 009 Population genetics Outline of lectures 3-6 1. We want to know what theory says about the reproduction of genotypes in a population. This results
More informationA MONTE CARLO STUDY OF GENETIC ALGORITHM INITIAL POPULATION GENERATION METHODS. Raymond R. Hill
Proceedings of the 1999 Winter Simulation Conference P.. arrington, H. B. Nembhard, D. T. Sturrock, and G. W. Evans, eds. MONTE CRLO STUDY O GENETIC LGORITHM INITIL POPULTION GENERTION METHODS Raymond
More informationBinary Particle Swarm Optimization with Crossover Operation for Discrete Optimization
Binary Particle Swarm Optimization with Crossover Operation for Discrete Optimization Deepak Singh Raipur Institute of Technology Raipur, India Vikas Singh ABV- Indian Institute of Information Technology
More informationIntroduction Optimality and Asset Pricing
Introduction Optimality and Asset Pricing Andrea Buraschi Imperial College Business School October 2010 The Euler Equation Take an economy where price is given with respect to the numéraire, which is our
More informationA.I.: Beyond Classical Search
A.I.: Beyond Classical Search Random Sampling Trivial Algorithms Generate a state randomly Random Walk Randomly pick a neighbor of the current state Both algorithms asymptotically complete. Overview Previously
More informationOutline of lectures 3-6
GENOME 453 J. Felsenstein Evolutionary Genetics Autumn, 007 Population genetics Outline of lectures 3-6 1. We want to know what theory says about the reproduction of genotypes in a population. This results
More informationLandscapeEC: Adding Geographical Structure to Cellular Evolutionary Algorithms
LandscapeEC: Adding Geographical Structure to Cellular Evolutionary Algorithms Lucas Ellgren and Nicholas Freitag McPhee Division of Science and Mathematics University of Minnesota, Morris Morris, MN 562367
More informationEfficiency of genetic algorithm and determination of ground state energy of impurity in a spherical quantum dot
Efficiency of genetic algorithm and determination of ground state energy of impurity in a spherical quantum dot +DOXNùDIDN 1* 0HKPHWùDKLQ 1, Berna Gülveren 1, Mehmet Tomak 1 Selcuk University, Faculty
More informationCorrection to: Yield curve shapes and the asymptotic short rate distribution in affine one-factor models
Finance Stoch (218) 22:53 51 https://doi.org/1.17/s78-18-359-5 CORRECTION Correction to: Yield curve shapes and the asymptotic short rate distribution in affine one-factor models Martin Keller-Ressel 1
More informationState of the art in genetic algorithms' research
State of the art in genetic algorithms' Genetic Algorithms research Prabhas Chongstitvatana Department of computer engineering Chulalongkorn university A class of probabilistic search, inspired by natural
More informationEvolution of Populations. Chapter 17
Evolution of Populations Chapter 17 17.1 Genes and Variation i. Introduction: Remember from previous units. Genes- Units of Heredity Variation- Genetic differences among individuals in a population. New
More informationLife Cycles, Meiosis and Genetic Variability24/02/2015 2:26 PM
Life Cycles, Meiosis and Genetic Variability iclicker: 1. A chromosome just before mitosis contains two double stranded DNA molecules. 2. This replicated chromosome contains DNA from only one of your parents
More information