Slides:



Advertisements
Similar presentations
Genetic Algorithms.
Advertisements

CS6800 Advanced Theory of Computation
Exact and heuristics algorithms
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Elitist Non-dominated Sorting Genetic Algorithm: NSGA-II
Valery Frolov.  The algorithm  Fitness function  Crossover  Mutation  Elite individuals  Reverse mutations  Some statistics  Run examples.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
Introduction to Genetic Algorithms Yonatan Shichel.
Population New Population Selection Crossover and Mutation Insert When the new population is full repeat Generational Algorithm.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Brandon Andrews.  What are genetic algorithms?  3 steps  Applications to Bioinformatics.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
1/27 Discrete and Genetic Algorithms in Bioinformatics 許聞廉 中央研究院資訊所.
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
Genetic Algorithms Genetic algorithms provide an approach to learning that is based loosely on simulated evolution. Hypotheses are often described by bit.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
CS 8625 High Performance Computing Dr. Hoganson Copyright © 2003, Dr. Ken Hoganson CS8625 Class Will Start Momentarily… CS8625 High Performance.
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
GAIA (Genetic Algorithm Interface Architecture) Requirements Analysis Document (RAD) Version 1.0 Created By: Charles Hall Héctor Aybar William Grim Simone.
Neural Networks And Its Applications By Dr. Surya Chitra.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
The Implementation of Genetic Algorithms to Locate Highest Elevation By Harry Beddo.
Applications of Genetic Algorithms By Harry Beddo 3 rd Quarter.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Genetic Algorithms and Evolutionary Programming A Brief Overview.
Eight Queens Problem The problem is to place 8 queens on a chess board so that none of them can attack the other. A chess board can be considered a plain.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Genetic Algorithm (Knapsack Problem)
-A introduction with an example
Introduction to Genetic Algorithms
Using GA’s to Solve Problems
Chapter 14 Genetic Algorithms.
Genetic Algorithms.
Genetic Algorithms.
Momentum and Reversal.
Evolutionary Algorithms Jim Whitehead
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach
Momentum Effect (JT 1993).
Multy- Objective Differential Evolution (MODE)
Artificial Intelligence Project 2 Genetic Algorithms
ECE 556 Project Algorithm Presentation
An evolutionary approach to solving complex problems
Comparing Genetic Algorithm and Guided Local Search Methods
Genetic Algorithms CPSC 212 Spring 2004.
Genetic Algorithm: Application to Portfolio Optimization
Yu-Chi Ho Jonathan T. Lee Harvard University Sep. 7, 2000
GENIE Eric Jackowski.
Add Heuristic a b C D E Switch Cost
Introduction to Artificial Intelligence Lecture 11: Machine Evolution
SCHEMATA THEOREM (Holland)
Searching for solutions: Genetic Algorithms
Machine Learning: UNIT-4 CHAPTER-2
Introduction to Genetic Algorithm and Some Experience Sharing
GA.
Population Methods.
Presentation transcript:

Figure 2: Genetic Algorithm Methodology A genetic algorithm could be used to maximize the return from the momentum strategy through iterations of J and K (ranking and holding periods). During the first step indicated at figure 1 an initial population of potential solutions is created randomly through choosing ranking and holding periods from 3 to 24 months, forming decile portfolios and calculating their return, standard deviation and t-statistic. This is performed 100 times to form an initial population of solutions. At step two, the fitness of each of the potential solutions in the initial population is evaluated. The objective function is to maximize the return of the portfolio short in losers and long in winner stocks. The next step involves selection of the fittest members of the population to parent the next generation of solutions. The member of the initial population with highest return is passed over to the next generation and is known as elite. Tournament selection is used to choose parents with a strong selective pressure and they are passed through the crossover and mutation operators, which are steps 3, 4 and 5 on the chart respectively. The offsprings created through crossover and mutation become part of the next generation. The fitness of objective function is evaluated for each member of the generation. The iterations are repeated for 25 to 50 generations. Finally, the optimal ranking and holding period could be chosen based in the evaluation of the objective function which is at the maximum return. The value of the t-statistic of the portfolio needs to be considered as well at this point. The standard deviation of the portfolios will be investigated in the diversification part of the study.