Logistics. Final exam date. Project Presentation. Plan for this week. Evolutionary Algorithms. Crossover and Mutation
|
|
- Aubrey Harry Marshall
- 6 years ago
- Views:
Transcription
1 Logistics Crossover and Mutation Assignments Checkpoint -- Problem Graded -- comments on mycourses Checkpoint --Framework Mostly all graded -- comments on mycourses Checkpoint -- Genotype / Phenotype Due last Wednesday Grading not started Checkpoint -- Selection / Fitness Due October 9 (Friday) Final exam date Project Presentation Final exam date has been announced: Friday, November th :pm - :pm 0- However Projects Presentations: Dates: Week 0 Monday, November Wednesday, November minutes / presentation Schedule now on Web Please send me choice of time/day Code, Report, and Grad Survey DUE FRIDAY, NOV 9th Plan for this week Today: Crossover and Mutation Wednesday: Guest Speaker: Peter Anderson GAs and permutations. Questions before we start Evolutionary Algorithms An EA uses some mechanisms inspired by biological evolution: reproduction, mutation, recombination, natural selection and survival of the fittest. Candidate solutions to the optimization problem play the role of individuals in a population, and the cost function determines the environment within which the solutions "live". Evolution of the population then takes place after the repeated application of the above operators.
2 Evolutionary Computation process Evolutionary Algorithms Initialize population Select individuals for crossover (based on fitness function Crossover Mutation Insert new offspring into population Are stopping criteria satisfied? Finish To use evolutionary algorithms your must: Define your problem Define your genotype Identify your phenotype Define the genotype -> phenotype translation Define crossover and mutation operators Define fitness Determine selection criteria Set population parameters Reproduction Generation k Generation k+ Fitness Individual fitness Genotype Phenotype Reproduction parameters problem output Fitness Reproduction Exploration vs. Exploitation Means by which new individuals are produced Crossover Combination of parents Best of both parents Mutation modification of a single individual Allows for random search through search space. Genetic operators are applied on the genotype. Exploration random variation and selection to determine strategies that fit the environment diversity Mutation Exploitation focused repetition of the fittest behavior in the stage of retention. Selective pressure Crossover
3 Exploration vs Exploitation Challenge is to maintain balance. Too much exploration: random search Too much exploitation Get stuck local optima Crossover Combination of the best of both parents. Building blocks Crossover on Strings / Arrays Common mechanisms: One-Point Crossover Two-Point Crossover Cut and Splice Uniform and Half-Uniform Crossover Arithmetic Heuristic One-Point Crossover Crossover point on the parent string is selected. All data beyond that point is swapped between the two parents Two-Point Crossover Two points are selected on the parent strings. Everything between the two points is swapped between the parents Cut and Splice Like one-point crossover, except each parent has a different cut point Can result in variable length children.
4 Uniform Crossover and Half Uniform Crossover uniform crossover scheme (UX) individual genes are compared between two parents. The gene values are swapped with a fixed probability, typically 0.. half uniform crossover scheme (HUX) exactly half of the nonmatching genes are swapped. Arithmetic (Numerical arrays) linearly combines two parent chromosome vectors to produce two new offspring according to the following equations: Offspring = a * Parent + (- a) * Parent Offspring = ( a) * Parent + a * Parent a = randomly determined constant. Heuristic (Numerical Arrays) GPs: Crossover and Mutation uses the fitness values of the two parent chromosomes to determine the direction of the search. The offspring are created according to the following equations: Offspring = BestParent + r * (BestParent WorstParent) Offspring = BestParent Before crossover After crossover crossover mutation Before mutation After mutation where r is a random number between 0 and. Note that operation maintain valid individuals. Mutation Random modification of a single individual Explore new areas of search space Avoids getting stuck in local minima/maxima. Standard Mutation Bit String Flip a bit Array Modify gene by random amount Trees Replace branch with random subtree.
5 Bad genomes and reproduction Dealing with bad genomes Total Rejection Genetic Repair fix in genetic mapping Genetic operators Fitness Penalties. Break Traveling Salesman Problem Instance: N cities with distances between pairs of cities Said another way: Complete graph with n vertices such that all edges are labeled with a cost value Example of a permutation problem Traveling Salesman Problem Traveling Salesman Problem Solution: Tour of the cities such that each city is visited once. Output: Distance traveled to complete the tour. Said another way: A permutation of the cities. Ordered list of the cities Is this a large search space? n cities = n! permutation Complete treatment From [Larranaga, et. al. 999] Recall: Phenotype == ordered tour of the cities TSP - Path Representation Tour is represented as an ordered list (or array) of the cities. Order in array == order of visitation. If city i is the jth element of the array, city i is the jth city to be visited. Eg. Tour: TSP - Path Representation Most intuitive and common genotype. But it has it s problems: Not valid tours!!!
6 TSP - Path Representation GeneRepair [Mitchell, et.al.] Keep a corrective template with a valid tour. Identify duplicate cities Use template to replace duplicate cities. TSP - Path Representation Genetic Mapping responsible for doing the repair on a bad genome Most approaches that use the path representation use designer crossover/mutation operators Assure valid offspring. Designer crossover operators Partially Mapped Crossover (PMX) Designed for a particular application. Problem domain constraints Phenotype constraints Still operates on genotype. Goal: Prevent bad genomes Portion of one parent is mapped to a portion of another parent Remaining info is exchanged How it works: Choose two random cut points Define mapping Copy mapping section (between cut points) to offspring Fill in remainder of offspring using mapping Partially Mapped Crossover (PMX) Partially Mapped Crossover (PMX) parents offspring
7 Cycle Crossover (CX) Cycle Crossover (CX) Creates an offspring where every position is occupied by a corresponding element from one of the parents parents offspring Cycle Crossover (CX) Absolute position of (on average) half elements of both parents preserved. Better results for TSP than PMX. Order Crossover (OX) Observes that order is important, not necessarily position. How it works: Choose cut points Copy between cut points to offspring Starting from nd cut point in one parent, fill missing cities in order they appear in other parent. Order Crossover (OX) Edge Recombination Crossover (ER) Creates a path (offspring) that is similar to a set of existing paths (parents) by looking at the edges rather than the vertices. parents offspring
8 Edge Recombination Crossover (ER) Edge Recombination Crossover (ER) Edge Map For each node, gives list of other nodes to which it has an edge in either parent CABDEF ABCEFD A: B C D B: A C D C: A B E F D: A B E F E: C D F F: C D E Algorithm Let K be the empty list Let N be the first node of a random parent. While Length(K) < Length(Parent): K := K + N (append N to K) Remove N from all neighbor lists If N's neighbor list is non-empty then let N* be the neighbor of N with the fewest neighbors in its list (or a random one, should there be multiple) else let N* be a randomly chosen node that is not in K N := N* Edge Recombination Crossover (ER) Mutation K = {} K = A K = AB K = ABD K = ABDF K = ABDFC K = ABDFCE A: B C D B: A C D C: A B E F D: A B E F E: C D F F: C D E Similar problem for standard mutation Not a valid tour Displacement Mutation Aka Cut Mutation How it works: Select a subtour at random Insert it in a random place Exchange Mutation Randomly selects two cities and swaps
9 Insertion Mutation Randomly choose a city Remove it and insert in a random place Like displacement with a subtour of Simple Inversion Mutation Choose two cut points Reverse subtour between cuts Scramble Mutation Choose a random subtour and scramble TSP Seen enough? For complete list see [Larranaga 999] Questions? Take Home Messages Reproduction Types Crossover Mutation Designer Operators for Given Problem Next time APPLICATION: Peter Anderson: GAs and permutations. CP: Crossover / Mutation 9
Evolutionary Algorithms - Introduction and representation Jim Tørresen
INF3490 - Biologically inspired computing Lecture 2: Eiben and Smith, chapter 1-4 Evolutionary Algorithms - Introduction and representation Jim Tørresen Evolution Biological evolution: Lifeforms adapt
More informationGENETIC ALGORITHMS. Narra Priyanka. K.Naga Sowjanya. Vasavi College of Engineering. Ibrahimbahg,Hyderabad.
GENETIC ALGORITHMS Narra Priyanka K.Naga Sowjanya Vasavi College of Engineering. Ibrahimbahg,Hyderabad mynameissowji@yahoo.com priyankanarra@yahoo.com Abstract Genetic algorithms are a part of evolutionary
More informationEvolutionary Algorithms - Population management and popular algorithms Kai Olav Ellefsen
INF3490 - Biologically inspired computing Lecture 3: Eiben and Smith, chapter 5-6 Evolutionary Algorithms - Population management and popular algorithms Kai Olav Ellefsen Repetition: General scheme of
More informationEvolutionary Algorithms
Evolutionary Algorithms Evolutionary Algorithms What is Evolutionary Algorithms (EAs)? Evolutionary algorithms are iterative and stochastic search methods that mimic the natural biological evolution and/or
More informationIntelligent Techniques Lesson 4 (Examples about Genetic Algorithm)
Intelligent Techniques Lesson 4 (Examples about Genetic Algorithm) Numerical Example A simple example will help us to understand how a GA works. Let us find the maximum value of the function (15x - x 2
More informationWhat is Evolutionary Computation? Genetic Algorithms. Components of Evolutionary Computing. The Argument. When changes occur...
What is Evolutionary Computation? Genetic Algorithms Russell & Norvig, Cha. 4.3 An abstraction from the theory of biological evolution that is used to create optimization procedures or methodologies, usually
More informationA Study of Crossover Operators for Genetic Algorithms to Solve VRP and its Variants and New Sinusoidal Motion Crossover Operator
International Journal of Computational Intelligence Research ISSN 0973-1873 Volume 13, Number 7 (2017), pp. 1717-1733 Research India Publications http://www.ripublication.com A Study of Crossover Operators
More informationDeterministic Crowding, Recombination And Self-Similarity
Deterministic Crowding, Recombination And Self-Similarity Bo Yuan School of Information Technology and Electrical Engineering The University of Queensland Brisbane, Queensland 4072 Australia E-mail: s4002283@student.uq.edu.au
More informationDerivative-based Optimization (chapter 6)
Soft Computing: Derivative-base Optimization Derivative-based Optimization (chapter 6) Bill Cheetham cheetham@cs.rpi.edu Kai Goebel goebel@cs.rpi.edu used for neural network learning used for multidimensional
More informationEvolutionary Computation
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory (REAL Lab) School of Computer Science University
More informationGenetic Algorithm: A Search of Complex Spaces
Genetic Algorithm: A Search of Complex Spaces Namita Khurana, Anju Rathi, Akshatha.P.S Lecturer in Department of (CSE/IT) KIIT College of Engg., Maruti Kunj, Sohna Road, Gurgaon, India ABSTRACT Living
More informationTIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS. Liviu Lalescu, Costin Badica
TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS Liviu Lalescu, Costin Badica University of Craiova, Faculty of Control, Computers and Electronics Software Engineering Department, str.tehnicii, 5, Craiova,
More informationA Viral Systems Algorithm for the Traveling Salesman Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Viral Systems Algorithm for the Traveling Salesman Problem Dedy Suryadi,
More informationCSE 590 DATA MINING. Prof. Anita Wasilewska SUNY Stony Brook
CSE 590 DATA MINING Prof. Anita Wasilewska SUNY Stony Brook 1 References D. E. Goldberg, Genetic Algorithm In Search, Optimization And Machine Learning, New York: Addison Wesley (1989) John H. Holland
More informationStorage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach
Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach Z.X. Wang, Felix T.S. Chan, and S.H. Chung Abstract Storage allocation and yard trucks scheduling
More informationGenetically Evolved Solution to Timetable Scheduling Problem
Genetically Evolved Solution to Timetable Scheduling Problem Sandesh Timilsina Department of Computer Science and Engineering Rohit Negi Department of Computer Science and Engineering Jyotsna Seth Department
More informationGenetic Algorithms in Matrix Representation and Its Application in Synthetic Data
Genetic Algorithms in Matrix Representation and Its Application in Synthetic Data Yingrui Chen *, Mark Elliot ** and Joe Sakshaug *** * ** University of Manchester, yingrui.chen@manchester.ac.uk University
More informationEpistatic Genetic Algorithm for Test Case Prioritization
For SSBSE 25 Software Verification: Epistatic Genetic Algorithm for Test Case Prioritization Fang Yuan, Yi Bian, Zheng Li, Ruilian Zhao Reported by: Yi Bian 5.9.25 SSBSE 25 Epistatic Genetic Algorithm
More informationArtificial Life Lecture 14 EASy. Genetic Programming. EASy. GP EASy. GP solution to to problem 1. EASy. Picturing a Lisp program EASy
Artificial Life Lecture 14 14 Genetic Programming This will look at 3 aspects of Evolutionary Algorithms: 1) Genetic Programming GP 2) Classifier Systems 3) Species Adaptation Genetic Algorithms -- SAGA
More informationEnergy management using genetic algorithms
Energy management using genetic algorithms F. Garzia, F. Fiamingo & G. M. Veca Department of Electrical Engineering, University of Rome "La Sapienza", Italy Abstract An energy management technique based
More informationGenetic Algorithms. Lecture Notes in Transportation Systems Engineering. Prof. Tom V. Mathew
Genetic Algorithms Lecture Notes in Transportation Systems Engineering Prof. Tom V. Mathew Contents 1 Introduction 1 1.1 Background..................................... 2 1.2 Natural Selection..................................
More informationGenetic Algorithms using Populations based on Multisets
Genetic Algorithms using Populations based on Multisets António Manso 1, Luís Correia 1 1 LabMAg - Laboratório de Modelação de Agentes Faculdade de Ciências da Universidade de Lisboa Edifício C6, Piso
More informationEconomic Design of Control Chart
A Project Report on Economic Design of Control Chart In partial fulfillment of the requirements of Bachelor of Technology (Mechanical Engineering) Submitted By Debabrata Patel (Roll No.10503031) Session:
More informationImproved Crossover and Mutation Operators for Genetic- Algorithm Project Scheduling
Improved Crossover and Mutation Operators for Genetic- Algorithm Project Scheduling M. A. Abido and A. Elazouni Abstract In Genetic Algorithms (GAs) technique, offspring chromosomes are created by merging
More informationCEng 713 Evolutionary Computation, Lecture Notes
CEng 713 Evolutionary Computation, Lecture Notes Introduction to Evolutionary Computation Evolutionary Computation Elements of Evolution: Reproduction Random variation Competition Selection of contending
More informationSOLVING TRAVELLING SALESMAN PROBLEM IN A SIMULATION OF GENETIC ALGORITHMS WITH DNA. Angel Goñi Moreno
International Journal "Information Theories & Applications" Vol.15 / 2008 357 SOLVING TRAVELLING SALESMAN PROBLEM IN A SIMULATION OF GENETIC ALGORITHMS WITH DNA Angel Goñi Moreno Abstract: In this paper
More informationOptimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination
UC Davis Computer Science Technical Report CSE-2003-29 1 Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination Dan Gusfield, Satish Eddhu, Charles Langley November 24,
More informationEvolutionary Algorithms:
GEATbx Introduction Evolutionary Algorithms: Overview, Methods and Operators Hartmut Pohlheim Documentation for: Genetic and Evolutionary Algorithm Toolbox for use with Matlab version: toolbox 3.3 documentation
More informationAP BIOLOGY Population Genetics and Evolution Lab
AP BIOLOGY Population Genetics and Evolution Lab In 1908 G.H. Hardy and W. Weinberg independently suggested a scheme whereby evolution could be viewed as changes in the frequency of alleles in a population
More informationPublic Key Cryptography Using Genetic Algorithm
International Journal of Recent Technology and Engineering (IJRTE) Public Key Cryptography Using Genetic Algorithm Swati Mishra, Siddharth Bali Abstract Cryptography is an imperative tool for protecting
More informationForecasting Euro United States Dollar Exchange Rate with Gene Expression Programming
Forecasting Euro United States Dollar Exchange Rate with Gene Expression Programming Maria Α. Antoniou 1, Efstratios F. Georgopoulos 1,2, Konstantinos A. Theofilatos 1, and Spiridon D. Likothanassis 1
More informationOptimization of Riser in Casting Using Genetic Algorithm
IAAST ONLINE ISSN 2277-1565 PRINT ISSN 0976-4828 CODEN: IAASCA International Archive of Applied Sciences and Technology IAAST; Vol 4 [2] June 2013: 21-26 2013 Society of Education, India [ISO9001: 2008
More informationThe Making of the Fittest: Natural Selection in Humans
POPULATION GENETICS, SELECTION, AND EVOLUTION INTRODUCTION A common misconception is that individuals evolve. While individuals may have favorable and heritable traits that are advantageous for survival
More informationMetaheuristics and Cognitive Models for Autonomous Robot Navigation
Metaheuristics and Cognitive Models for Autonomous Robot Navigation Raj Korpan Department of Computer Science The Graduate Center, CUNY Second Exam Presentation April 25, 2017 1 / 31 Autonomous robot navigation
More informationDesign of Truss-Structures for Minimum Weight using Genetic Algorithms
Design of Truss-Structures for Minimum Weight using Genetic Algorithms Kalyanmoy Deb and Surendra Gulati Kanpur Genetic Algorithms Laboratory (KanGAL) Department of Mechanical Engineering Indian Institute
More informationTransactions on the Built Environment vol 33, 1998 WIT Press, ISSN
Effects of designated time on pickup/delivery truck routing and scheduling E. Taniguchf, T. Yamada\ M. Tamaishi*, M. Noritake^ "Department of Civil Engineering, Kyoto University, Yoshidahonmachi, Sakyo-kyu,
More informationEvolutionary Algorithms. LIACS Natural Computing Group Leiden University
Evolutionary Algorithms Overview Introduction: Optimization and EAs Genetic Algorithms Evolution Strategies Theory Examples 2 Background I Biology = Engineering (Daniel Dennett) 3 Background II DNA molecule
More informationFacePrints, Maze Solver and Genetic algorithms
Machine Learning CS579 FacePrints, Maze Solver and Genetic algorithms by Jacob Blumberg Presentation Outline Brief reminder genetic algorithms FacePrints a system that evolves faces Improvements and future
More informationPopulation and Community Dynamics. The Hardy-Weinberg Principle
Population and Community Dynamics The Hardy-Weinberg Principle Key Terms Population: same species, same place, same time Gene: unit of heredity. Controls the expression of a trait. Can be passed to offspring.
More informationINFLUENCE OF DATA QUANTITY ON ACCURACY OF PREDICTIONS IN MODELING TOOL LIFE BY THE USE OF GENETIC ALGORITHMS
International Journal of Industrial Engineering, 21(2), 14-21, 2014 INFLUENCE OF DATA QUANTITY ON ACCURACY OF PREDICTIONS IN MODELING TOOL LIFE BY THE USE OF GENETIC ALGORITHMS Pavel Kovac, Vladimir Pucovsky,
More informationA NEW MUTATION OPERATOR IN GENETIC PROGRAMMING
ISSN: 2229-6956(ONLINE) DOI: 10.21917/ijsc.2013.0070 ICTACT JOURNAL ON SOFT COMPUTING, JANUARY 2013, VOLUME: 03, ISSUE: 02 A NEW MUTATION OPERATOR IN GENETIC PROGRAMMING Anuradha Purohit 1, Narendra S.
More informationLab 8: Population Genetics and Evolution. This may leave a bad taste in your mouth
Lab 8: Population Genetics and Evolution This may leave a bad taste in your mouth Pre-Lab Orientation Recall that the Hardy-Weinberg Equation helps us identify allele frequencies throughout a population.
More information11.1. A population shares a common gene pool. The Evolution of Populations CHAPTER 11. Fill in the concept map below.
SECTION 11.1 GENETIC VARIATION WITHIN POPULATIONS Study Guide KEY CONCEPT A population shares a common gene pool. VOCABULARY gene pool allele frequency MAIN IDEA: Genetic variation in a population increases
More informationEvolutionary Computation Applied to. Combinatorial Optimisation Problems
Evolutionary Computation Applied to Combinatorial Optimisation Problems by George G. Mitchell B.Sc. M.Sc. Supervisor: Prof. Barry M c Mullin Internal Examiner: Dr. Darragh O Brien External Examiners: Dr.
More informationChapter 14: Genes in Action
Chapter 14: Genes in Action Section 1: Mutation and Genetic Change Mutation: Nondisjuction: a failure of homologous chromosomes to separate during meiosis I or the failure of sister chromatids to separate
More informationModeling and optimization of ATM cash replenishment
Modeling and optimization of ATM cash replenishment PETER KURDEL, JOLANA SEBESTYÉNOVÁ Institute of Informatics Slovak Academy of Sciences Bratislava SLOVAKIA peter.kurdel@savba.sk, sebestyenova@savba.sk
More informationHours of service regulations in road freight transport: an optimization-based international assessment. Thibaut Vidal
Hours of service regulations in road freight transport: an optimization-based international assessment Thibaut Vidal Seminar, Universidade Federal Fluminense, March 15 th, 2013 Context of this research
More informationJobshop scheduling in a shipyard
Jobshop scheduling in a shipyard Thomas Stidsen 1, Lars V. Kragelund and Oana Mateescu Abstract. Jobshop scheduling is considered a standard problem to solve by means of Genetic Algorithms (GA) and a number
More informationVideo Tutorial 9.1: Determining the map distance between genes
Video Tutorial 9.1: Determining the map distance between genes Three-factor linkage questions may seem daunting at first, but there is a straight-forward approach to solving these problems. We have described
More informationA Fast Genetic Algorithm with Novel Chromosome Structure for Solving University Scheduling Problems
2013, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.com A Fast Genetic Algorithm with Novel Chromosome Structure for Solving University Scheduling Problems
More informationStaff Scheduling by a Genetic Algorithm with a Two-Dimensional Chromosome Structure
Staff Scheduling by a Genetic Algorithm with a Two-Dimensional Chromosome Structure John S. Dean Box 24, 8700 N.W. River Park Dr., Parkville, MO 64152 Park University, Information and Computer Science
More informationA Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows
1 A Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows Giselher Pankratz Department of Business Administration and Economics, FernUniversität University of Hagen, Hagen, Germany
More informationBiology 40S: Course Outline Monday-Friday Slot 1, 8:45 AM 9:45 AM Room 311 Teacher: John Howden Phone:
The course is designed to help students develop and demonstrate an understanding of the biological concepts of genetics and biodiversity through scientific inquiry, problem solving, personal reflection
More informationOptimizations and Placements with the Genetic Workbench
D E C E M B E R 1 9 9 6 WRL Research Report 96/4 Optimizations and Placements with the Genetic Workbench Silvio Turrini d i g i t a l Western Research Laboratory 250 University Avenue Palo Alto, California
More informationDesigning High Thermal Conductive Materials Using Artificial Evolution MICHAEL DAVIES, BASKAR GANAPATHYSUBRAMANIAN, GANESH BALASUBRAMANIAN
Designing High Thermal Conductive Materials Using Artificial Evolution MICHAEL DAVIES, BASKAR GANAPATHYSUBRAMANIAN, GANESH BALASUBRAMANIAN The Problem Graphene is one of the most thermally conductive materials
More informationGenotype Editing and the Evolution of Regulation and Memory
Genotype Editing and the Evolution of Regulation and Memory Luis M. Rocha and Jasleen Kaur School of Informatics, Indiana University Bloomington, IN 47406, USA rocha@indiana.edu http://informatics.indiana.edu/rocha
More informationOptimizing Genetic Algorithms for Time Critical Problems
Master Thesis Software Engineering Thesis no: MSE-2003-09 June 2003 Optimizing Genetic Algorithms for Time Critical Problems Christian Johansson Gustav Evertsson Department of Software Engineering and
More informationData Mining for Genetics: A Genetic Algorithm Approach
Data Mining for Genetics: A Genetic Algorithm Approach G. Madhu, Dr. Keshava Reddy E. Dept of Mathematics,J.B. Institute of Engg. & Technology, Yenkapally, R.R.Dist Hyderabad-500075, INDIA, A.P Dept of
More informationLAB ACTIVITY ONE POPULATION GENETICS AND EVOLUTION 2017
OVERVIEW In this lab you will: 1. learn about the Hardy-Weinberg law of genetic equilibrium, and 2. study the relationship between evolution and changes in allele frequency by using your class to represent
More informationRouting Optimization of Fourth Party Logistics with Reliability Constraints based on Messy GA
Journal of Industrial Engineering and Management JIEM, 2014 7(5) : 1097-1111 Online ISSN: 2013-0953 Print ISSN: 2013-8423 http://dx.doi.org/10.3926/jiem.1126 Routing Optimization of Fourth Party Logistics
More informationQuantitative Genetics
Quantitative Genetics Polygenic traits Quantitative Genetics 1. Controlled by several to many genes 2. Continuous variation more variation not as easily characterized into classes; individuals fall into
More informationOptimizing Online Auction Bidding Strategies Using Genetic Programming
Optimizing Online Auction Bidding Strategies Using Genetic Programming Ekaterina Smorodkina December 8, 2003 Abstract The research presented in this paper is concerned with creating optimal bidding strategies
More informationEnhancing genetic algorithms using multi mutations
Enhancing genetic algorithms using multi mutations Ahmad B Hassanat Corresp., 1, Esra a Alkafaween 1, Nedal A Alnawaiseh 2, Mohammad A Abbadi 1, Mouhammd Alkasassbeh 1, Mahmoud B Alhasanat 3 1 IT, Mutah
More informationPopulation Genetics. Lab Exercise 14. Introduction. Contents. Objectives
Lab Exercise Population Genetics Contents Objectives 1 Introduction 1 Activity.1 Calculating Frequencies 2 Activity.2 More Hardy-Weinberg 3 Resutls Section 4 Introduction Unlike Mendelian genetics which
More informationNEUROEVOLUTION AND AN APPLICATION OF AN AGENT BASED MODEL FOR FINANCIAL MARKET
City University of New York (CUNY) CUNY Academic Works Master's Theses City College of New York 2014 NEUROEVOLUTION AND AN APPLICATION OF AN AGENT BASED MODEL FOR FINANCIAL MARKET Anil Yaman CUNY City
More informationPOPULATION GENETICS. Evolution Lectures 4
POPULATION GENETICS Evolution Lectures 4 POPULATION GENETICS The study of the rules governing the maintenance and transmission of genetic variation in natural populations. Population: A freely interbreeding
More informationCS 5984: Application of Basic Clustering Algorithms to Find Expression Modules in Cancer
CS 5984: Application of Basic Clustering Algorithms to Find Expression Modules in Cancer T. M. Murali January 31, 2006 Innovative Application of Hierarchical Clustering A module map showing conditional
More informationOPTIMIZATION OF SUSTAINABLE OFFICE BUILDINGS IN STEEL USING GENETIC ALGORITHMS
Nordic Steel Construction Conference 2012 Hotel Bristol, Oslo, Norway 5-7 September 2012 OPTIMIZATION OF SUSTAINABLE OFFICE BUILDINGS IN STEEL USING GENETIC ALGORITHMS Martin Mensinger 1 a, Li Huang 2
More informationApplying Computational Intelligence in Software Testing
www.stmjournals.com Applying Computational Intelligence in Software Testing Saumya Dixit*, Pradeep Tomar School of Information and Communication Technology, Gautam Buddha University, Greater Noida, India
More informationA Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests
A Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests Pandhapon Sombuntham and Voratas Kachitvichayanukul Abstract A particle swarm optimization
More informationOptimization of Shell and Tube Heat Exchangers Using modified Genetic Algorithm
Optimization of Shell and Tube Heat Exchangers Using modified Genetic Algorithm S.Rajasekaran 1, Dr.T.Kannadasan 2 1 Dr.NGP Institute of Technology Coimbatore 641048, India srsme@yahoo.co.in 2 Director-Research
More informationTravelingSalesmanProblemBasedonDNAComputing
TravelingSalesmanProblemBasedonDNAComputing Yan Li Weifang University College of computer and communication Engineering Weifang, P.R.China jk97@zjnu.cn Abstract Molecular programming is applied to traveling
More informationSelf-Improvement for the ADATE Automatic Programming System
Self-Improvement for the ADATE Automatic Programming System Roland Olsson Computer Science Dept. Østfold College 1750 HALDEN Norway http://www-ia.hiof.no/ rolando Abstract Automatic Design of Algorithms
More informationCBA #4 Practice Exam Genetics. 1) (TEKS 5A) Which of the diagrams below shows the process of transcription:
CBA #4 Practice Exam Genetics 1) (TEKS 5A) Which of the diagrams below shows the process of transcription: 2) (TEKS 5C) All of the following are true statements about cell differentiation EXCEPT A. Cell
More informationAnswers to additional linkage problems.
Spring 2013 Biology 321 Answers to Assignment Set 8 Chapter 4 http://fire.biol.wwu.edu/trent/trent/iga_10e_sm_chapter_04.pdf Answers to additional linkage problems. Problem -1 In this cell, there two copies
More informationOutline. Reference : Aho Ullman, Sethi
Outline Code Generation Issues Basic Blocks and Flow Graphs Optimizations of Basic Blocks A Simple Code Generator Peephole optimization Register allocation and assignment Instruction selection by tree
More informationRecessive Trait Cross Over Approach of GAs Population Inheritance for Evolutionary Optimisation
Recessive Trait Cross Over Approach of GAs Population Inheritance for Evolutionary Optimisation Amr Madkour, Alamgir Hossain, and Keshav Dahal Modeling Optimization Scheduling And Intelligent Control (MOSAIC)
More informationOptimization of Software Testing for Discrete Testsuite using Genetic Algorithm and Sampling Technique
Optimization of Software Testing for Discrete Testsuite using Genetic Algorithm and Sampling Technique Siba Prasada Tripathy National Institute of Science & Technology Berhampur, India Debananda Kanhar
More informationBio-inspired Models of Computation. An Introduction
Bio-inspired Models of Computation An Introduction Introduction (1) Natural Computing is the study of models of computation inspired by the functioning of biological systems Natural Computing is not Bioinformatics
More informationOptimal, Efficient Reconstruction of Root-Unknown Phylogenetic Networks with Constrained and Structured Recombination 1
UC Davis Computer Science Technical Report CSE-2004-31 Optimal, Efficient Reconstruction of Root-Unknown Phylogenetic Networks with Constrained and Structured Recombination 1 Dan Gusfield November 25,
More informationCHAPTER 21 LECTURE SLIDES
CHAPTER 21 LECTURE SLIDES Prepared by Brenda Leady University of Toledo To run the animations you must be in Slideshow View. Use the buttons on the animation to play, pause, and turn audio/text on or off.
More informationLINKAGE AND CHROMOSOME MAPPING IN EUKARYOTES
LINKAGE AND CHROMOSOME MAPPING IN EUKARYOTES Objectives: Upon completion of this lab, the students should be able to: Understand the different stages of meiosis. Describe the events during each phase of
More informationGenetics and Gene Therapy
Genetics and Gene Therapy Optional Homework Instructions: Print and read this article. Answer the questions at the end to the best of your ability. Extra credit will be given based on quality of responses.
More informationAn Approach to Analyze and Quantify the Functional Requirements in Software System Engineering
An Approach to Analyze and Quantify the Functional Requirements in Software System Engineering M.Karthika, Assistant Professor MCA Department NMSS Vellaichamy Nadar College Tami Nadu, India X.Joshphin
More informationAdaptive Genetic Programming applied to Classification in Data Mining
Adaptive Genetic Programming applied to Classification in Data Mining Nailah Al-Madi and Simone A. Ludwig Department of Computer Science North Dakota State University Fargo, ND, USA nailah.almadi@my.ndsu.edu,
More informationParallel evolution using multi-chromosome cartesian genetic programming
DOI 10.1007/s10710-009-9093-2 ORIGINAL PAPER Parallel evolution using multi-chromosome cartesian genetic programming James Alfred Walker Katharina Völk Stephen L. Smith Julian Francis Miller Received:
More informationTheory and Application of Multiple Sequence Alignments
Theory and Application of Multiple Sequence Alignments a.k.a What is a Multiple Sequence Alignment, How to Make One, and What to Do With It Brett Pickett, PhD History Structure of DNA discovered (1953)
More informationImplementation of Genetic Algorithm for Agriculture System
Implementation of Genetic Algorithm for Agriculture System Shweta Srivastava Department of Computer science Engineering Babu Banarasi Das University,Lucknow, Uttar Pradesh, India Diwakar Yagyasen Department
More informationUsing evolutionary techniques to improve the multisensor fusion of environmental measurements
Using evolutionary techniques to improve the multisensor fusion of environmental measurements A.L. Hood 1*, V.M.Becerra 2 and R.J.Craddock 3 1 Technologies for Sustainable Built Environments Centre, University
More informationCS273B: Deep Learning in Genomics and Biomedicine. Recitation 1 30/9/2016
CS273B: Deep Learning in Genomics and Biomedicine. Recitation 1 30/9/2016 Topics Genetic variation Population structure Linkage disequilibrium Natural disease variants Genome Wide Association Studies Gene
More informationA Genetic Algorithm Based Pattern Matcher
International Journal of Scientific & Engineering Research, Volume 3, Issue 11, November-2012 A Genetic Algorithm Based Pattern Matcher Sagnik Banerjee, Tamal Chakrabarti, Devadatta Sinha Abstract Pattern
More informationGenetic Algorithms-Based Model for Multi-Project Human Resource Allocation
Genetic Algorithms-Based Model for Multi-Project Human Resource Allocation Abstract Jing Ai Shijiazhuang University of Applied Technology, Shijiazhuang 050081, China With the constant development of computer
More informationEvolving Artificial Neural Networks using Cartesian Genetic Programming
Evolving Artificial Neural Networks using Cartesian Genetic Programming Andrew James Turner PhD University of York Electronics September 2015 Abstract NeuroEvolution is the application of Evolutionary
More informationAn Evolutionary Approach to Pickup and Delivery Problem with Time Windows
An Evolutionary Approach to Pickup and Delivery Problem with Time Windows 2 Jean-Charles Créput 1, Abder Koukam 1, Jaroslaw Kozlak 1,2, and Jan Lukasik 1,2 1 University of Technology of Belfort-Montbeliard,
More informationGene Linkage and Genetic. Mapping. Key Concepts. Key Terms. Concepts in Action
Gene Linkage and Genetic 4 Mapping Key Concepts Genes that are located in the same chromosome and that do not show independent assortment are said to be linked. The alleles of linked genes present together
More information3. A student performed a gel electrophoresis experiment. The results are represented in the diagram below.
Base your answers to questions 1 and 2 on the statement below and on your knowledge of biology. Scientists have found a gene in the DNA of a certain plant that could be the key to increasing the amount
More information9 Genetic Algorithms. 9.1 Introduction
9 Genetic Algorithms Genetic algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions you might not otherwise find
More informationGen e e n t e i t c c V a V ri r abi b li l ty Biolo l gy g Lec e tur u e e 9 : 9 Gen e et e ic I n I her e itan a ce
Genetic Variability Biology 102 Lecture 9: Genetic Inheritance Asexual reproduction = daughter cells genetically identical to parent (clones) Sexual reproduction = offspring are genetic hybrids Tendency
More informationUltimate and serviceability limit state optimization of cold-formed steel hat-shaped beams
NSCC2009 Ultimate and serviceability limit state optimization of cold-formed steel hat-shaped beams D. Honfi Division of Structural Engineering, Lund University, Lund, Sweden ABSTRACT: Cold-formed steel
More informationExploring the Genetic Basis of Congenital Heart Defects
Exploring the Genetic Basis of Congenital Heart Defects Sanjay Siddhanti Jordan Hannel Vineeth Gangaram szsiddh@stanford.edu jfhannel@stanford.edu vineethg@stanford.edu 1 Introduction The Human Genome
More information