The Metaphor. Individuals living in that environment Individual s degree of adaptation to its surrounding environment
|
|
- Collin Harry Bradley
- 6 years ago
- Views:
Transcription
1 Genetic Algorithms Sesi 14 Optimization Techniques Mathematical Programming Network Analysis Branch & Bound Simulated Annealing Tabu Search Classes of Search Techniques Calculus Base Techniqes Fibonacci Tabu Search Sort Search Techniqes Guided random search techniqes Hill Climbing Simulated Anealing Genetic Programming DFS Enumerative Techniqes Dynamic Programming Evolutionary Algorithms Genetic Algorithms BFS IF-UTAMA 1 The Metaphor The Metaphor (cont) Based on Darwinian Paradigm Reproduction Competition Optimization problem Environment Nature A set of feasible solutions Nature A population of organisms (species) Survive Selection Intrinsically a robust search and optimization mechanism Feasible solutions Solutions quality (fitness function) Individuals living in that environment Individual s degree of adaptation to its surrounding environment Stochastic operators Iteratively applying a set of stochastic operators on a set of feasible solutions Selection, recombination and mutation in nature s evolutionary process Evolution of populations to suit their environment IF-UTAMA 6 IF-UTAMA 1
2 Conceptual Algorithm initiate & evaluate The Evolutionary Cycle selection population parents evaluated offspring modification evaluation discard modified offspring deleted members Introduction 1 Inspired by natural evolution Population of individuals Individual is feasible solution to problem Each individual is characterized by a Fitness function Higher fitness is better solution Based on their fitness, parents are selected to reproduce offspring for a new generation Fitter individuals have more chance to reproduce New generation has same size as old generation; old generation dies Offspring has combination of properties of two parents If well designed, population will converge to optimal solution Algorithm BEGIN Generate initial population; Compute fitness of each individual; REPEAT /* New generation /* FOR population_size / 2 DO Select two parents from old generation; /* biased to the fitter ones */ Recombine parents for two offspring; Compute fitness of offspring; Insert offspring in new generation END FOR UNTIL population has converged END Example of convergence Introduction 2 Reproduction mechanisms have no knowledge of the problem to be solved Link between genetic algorithm and problem: Coding Fitness function IF-UTAMA 2
3 Basic principles 1 Basic principles 2 Coding Coding or Representation String with all parameters Fitness function Parent selection Reproduction Crossover Mutation Convergence When to stop An individual is characterized by a set of parameters: Genes The genes are joined into a string: Chromosome The chromosome forms the genotype The genotype contains all information to construct an organism: the phenotype Reproduction is a dumb process on the chromosome of the genotype Fitness is measured in the real world ( struggle for life ) of the phenotype Parameters of the solution (genes) are concatenated to form a string (chromosome) All kind of alphabets can be used for a chromosome (numbers, characters), but generally a binary alphabet is used Order of genes on chromosome can be important Generally many different codings for the parameters of a solution are possible Good coding is probably the most important factor for the performance of a GA In many cases many possible chromosomes do not code for feasible solutions Representation Possible individual s encoding Bit strings ( ) Real numbers ( ) Permutations of element (E11 E3 E7... E1 E15) Lists of rules (R1 R2 R3... R22 R23) Program elements (genetic programming)... any data structure... Representation (cont) When choosing an encoding method rely on the following key ideas Use a data structure as close as possible to the natural representation Write appropriate genetic operators as needed If possible, ensure that all genotypes correspond to feasible solutions If possible, ensure that genetic operators preserve feasibility Encoding Fitness Evaluation Reproduction Survivor Selection IF-UTAMA 3
4 Encoding Design alternative individual (chromosome) Single design choice gene Design objectives fitness Problem Example Schedule n jobs on m processors such that the maximum span is minimized. Design alternative: job i ( i=1,2, n) is assigned to processor j (j=1,2,,m) Individual: A n-vector x such that x i = 1,,or m Design objective: minimize the maximal span Fitness: the maximal span for each processor Reproduction Reproduction operators Crossover Mutation Crossover Reproduction Two parents produce two offspring There is a chance that the chromosomes of the two parents are copied unmodified as offspring There is a chance that the chromosomes of the two parents are randomly recombined (crossover) to form offspring Generally the chance of crossover is between 0.6 and 1.0 Mutation There is a chance that a gene of a child is changed randomly Generally the chance of mutation is low (e.g ) Reproduction Operators Crossover Generating offspring from two selected parents Single point crossover Two point crossover (Multi point crossover) Uniform crossover One-point crossover 1 Randomly one position in the chromosomes is chosen Child 1 is head of chromosome of parent 1 with tail of chromosome of parent 2 Child 2 is head of 2 with tail of 1 Randomly chosen position Parents: Offspring: IF-UTAMA 4
5 Two-point crossover Reproduction Operators comparison Uniform crossover Randomly two positions in the chromosomes are chosen Avoids that genes at the head and genes at the tail of a chromosome are always split when recombined Randomly chosen positions Parents: Single point crossover Cross point Two point crossover (Multi point crossover) A random mask is generated The mask determines which bits are copied from one parent and which from the other parent Bit density in mask determines how much material is taken from the other parent (takeover parameter) Mask: (Randomly generated) Parents: Offspring: Offspring: Reproduction Operators Uniform crossover Is uniform crossover better than single crossover point? Trade off between Exploration: introduction of new combination of features Exploitation: keep the good features in the existing solution Problems with crossover Depending on coding, simple crossovers can have high chance to produce illegal offspring E.g. in TSP with simple binary or path coding, most offspring will be illegal because not all cities will be in the offspring and some cities will be there more than once Uniform crossover can often be modified to avoid this problem E.g. in TSP with simple path coding: Where mask is 1, copy cities from one parent Where mask is 0, choose the remaining cities in the order of the other parent Reproduction Operators Mutation Generating new offspring from single parent Maintaining the diversity of the individuals Crossover can only explore the combinations of the current gene pool Mutation can generate new genes IF-UTAMA 5
6 Reproduction Operators Control parameters: population size, crossover/mutation probability Problem specific Increase population size Increase diversity and computation time for each generation Increase crossover probability Increase the opportunity for recombination but also disruption of good combination Increase mutation probability Closer to randomly search Help to introduce new gene or reintroduce the lost gene Varies the population Usually using crossover operators to recombine the genes to generate the new population, then using mutation operators on the new population Example Example: the MAXONE problem Suppose we want to maximize the number of ones in a string of l binary digits Is it a trivial problem? It may seem so because we know the answer in advance However, we can think of it as maximizing the number of correct answers, each encoded by 1, to l yes/no difficult questions` Example (cont) An individual is encoded (naturally) as a string of l binary digits The fitness f of a candidate solution to the MAXONE problem is the number of ones in its genetic code We start with a population of n random strings. Suppose that l = 10 and n = 6 Example (initialization) We toss a fair coin 60 times and get the following initial population: s 1 = f (s 1 ) = 7 s 2 = f (s 2 ) = 5 s 3 = f (s 3 ) = 7 s 4 = f (s 4 ) = 4 s 5 = f (s 5 ) = 8 s 6 = f (s 6 ) = 3 Example (selection1) Next we apply fitness proportionate selection with the roulette wheel method: f ( i) Individual i will have a f ( i) We repeat the extraction as many times as the number of individuals we need to have the same parent population size (6 in our case) probability to be chosen n i Area is Proportio nal to fitness value IF-UTAMA 6
7 Example (selection2) Suppose that, after performing selection, we get the following population: s 1` = (s 1 ) s 2` = (s 3 ) s 3` = (s 5 ) s 4` = (s 2 ) s 5` = (s 4 ) s 6` = (s 5 ) Example (crossover1) Next we mate strings for crossover. For each couple we decide according to crossover probability (for instance 0.6) whether to actually perform crossover or not Suppose that we decide to actually perform crossover only for couples (s 1`, s 2`) and (s 5`, s 6`). For each couple, we randomly extract a crossover point, for instance 2 for the first and 5 for the second Example (crossover2) Before crossover: s 1` = s 2` = After crossover: s 1`` = s 2`` = s 5` = s 6` = s 5`` = s 6`` = Example (mutation1) The final step is to apply random mutation: for each bit that we are to copy to the new population we allow a small probability of error (for instance 0.1) Before applying mutation: s 1`` = s 2`` = s 3`` = s 4`` = s 5`` = s 6`` = Example (mutation2) After applying mutation: s 1``` = f (s 1``` ) = 6 s 2``` = f (s 2``` ) = 7 s 3``` = f (s 3``` ) = 8 s 4``` = f (s 4``` ) = 5 s 5``` = f (s 5``` ) = 5 s 6``` = f (s 6``` ) = 6 Example (end) In one generation, the total population fitness changed from 34 to 37, thus improved by ~9% At this point, we go through the same process all over again, until a stopping criterion is met IF-UTAMA 7
8 Another Example: The Traveling Salesman Problem (TSP) The traveling salesman must visit every city in his territory exactly once and then return to the starting point; given the cost of travel between all cities, how should he plan his itinerary for minimum total cost of the entire tour? TSP NP-Complete Note: we shall discuss a single possible approach to approximate the TSP by GAs TSP (Representation, Evaluation, Initialization and Selection) A vector v = (i 1 i 2 i n ) represents a tour (v is a permutation of {1,2,,n}) Fitness f of a solution is the inverse cost of the corresponding tour Initialization: use either some heuristics, or a random sample of permutations of {1,2,,n} We shall use the fitness proportionate selection TSP (Crossover1) OX builds offspring by choosing a sub-sequence of a tour from one parent and preserving the relative order of cities from the other parent and feasibility Example: p 1 = ( ) and p 2 = ( ) First, the segments between cut points are copied into offspring o 1 = (x x x x x) and o 2 = (x x x x x) TSP (Crossover2) Next, starting from the second cut point of one parent, the cities from the other parent are copied in the same order The sequence of the cities in the second parent is After removal of cities from the first offspring we get This sequence is placed in the first offspring o 1 = ( ), and similarly in the second o 2 = ( ) TSP (Inversion) The sub-string between two randomly selected points in the path is reversed Example: ( ) is changed into ( ) Such simple inversion guarantees that the resulting offspring is a legal tour Referensi 1. Jaap Hofstede, Beasly, Bull, Martin Genetic Algorithms And other approaches for similar applications [online] url : Algorithm.ppt Tanggal akses: 21 Mei Assaf Zaritsky.-. Introduction to s[online] url : Tanggal Akses:21 Mei 2011 IF-UTAMA 8
Evolutionary 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 informationLogistics. Final exam date. Project Presentation. Plan for this week. Evolutionary Algorithms. Crossover and Mutation
Logistics Crossover and Mutation Assignments Checkpoint -- Problem Graded -- comments on mycourses Checkpoint --Framework Mostly all graded -- comments on mycourses Checkpoint -- Genotype / Phenotype Due
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 - 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 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 informationEFFECT OF CROSS OVER OPERATOR IN GENETIC ALGORITHMS ON ANTICIPATORY SCHEDULING
24th International Symposium on on Automation & Robotics in in Construction (ISARC 2007) Construction Automation Group, I.I.T. Madras EFFECT OF CROSS OVER OPERATOR IN GENETIC ALGORITHMS ON ANTICIPATORY
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 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 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 informationA Genetic Algorithm on Inventory Routing Problem
A Genetic Algorithm on Inventory Routing Problem Artvin Çoruh University e-mail: nevin.aydin@gmail.com Volume 3 No 3 (2014) ISSN 2158-8708 (online) DOI 10.5195/emaj.2014.31 http://emaj.pitt.edu Abstract
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 informationEvolutionary Algorithms and Simulated Annealing in the Topological Configuration of the Spanning Tree
Evolutionary Algorithms and Simulated Annealing in the Topological Configuration of the Spanning Tree A. SADEGHEIH Department of Industrial Engineering University of Yazd, P.O.Box: 89195-741 IRAN, YAZD
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 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 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 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 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 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 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 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 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 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 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 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 informationChapter 6: SELECTION. 6.1 Introduction
Chapter 6: SELECTION 6.1 Introduction Selection is the first genetic operation in the reproductive phase of genetic algorithm. The objective of selection is to choose the fitter individuals in the population
More informationA Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
Engineering Letters, 14:1, EL_14_1_14 (Advance online publication: 12 February 2007) A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem Raymond Chiong,
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 information11.1 Genetic Variation Within Population. KEY CONCEPT A population shares a common gene pool.
11.1 Genetic Variation Within Population KEY CONCEPT A population shares a common gene pool. 11.1 Genetic Variation Within Population Genetic variation in a population increases the chance that some individuals
More informationTRAINING FEED FORWARD NEURAL NETWORK USING GENETIC ALGORITHM TO PREDICT MEAN TEMPERATURE
IJRRAS 29 (1) October 216 www.arpapress.com/volumes/vol29issue1/ijrras_29_1_3.pdf TRAINING FEED FORWARD NEURAL NETWORK USING GENETIC ALGORITHM TO PREDICT MEAN TEMPERATURE Manal A. Ashour 1,*, Somia A.
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 informationKeywords Genetic, pseudorandom numbers, cryptosystems, optimal solution.
Volume 6, Issue 8, August 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Apply Genetic
More informationImprovement of Control System Responses Using GAs PID Controller
International Journal of Industrial and Manufacturing Systems Engineering 2017; 2(2): 11-18 http://www.sciencepublishinggroup.com/j/ijimse doi: 10.11648/j.ijimse.20170202.12 Case Report Improvement of
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 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 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 informationPermutation Free Encoding Technique for Evolving Neural Networks
Permutation Free Encoding Technique for Evolving Neural Networks Anupam Das, Md. Shohrab Hossain, Saeed Muhammad Abdullah, and Rashed Ul Islam Department of Computer Science and Engineering, Bangladesh
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 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 informationGenetic Algorithm with Upgrading Operator
Genetic Algorithm with Upgrading Operator NIDAPAN SUREERATTANAN Computer Science and Information Management, School of Advanced Technologies, Asian Institute of Technology, P.O. Box 4, Klong Luang, Pathumthani
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 informationImmune Programming. Payman Samadi. Supervisor: Dr. Majid Ahmadi. March Department of Electrical & Computer Engineering University of Windsor
Immune Programming Payman Samadi Supervisor: Dr. Majid Ahmadi March 2006 Department of Electrical & Computer Engineering University of Windsor OUTLINE Introduction Biological Immune System Artificial Immune
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 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 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 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 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 informationChanging Mutation Operator of Genetic Algorithms for optimizing Multiple Sequence Alignment
International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 3, Number 11 (2013), pp. 1155-1160 International Research Publications House http://www. irphouse.com /ijict.htm Changing
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 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 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 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 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 A THREE-PHASE INDUCTION MACHINE USING GENETIC ALGORITHM
MultiScience - XXX. microcad International Multidisciplinary Scientific Conference University of Miskolc, Hungary, 21-22 April 2016, ISBN 978-963-358-113-1 OPTIMIZATION OF A THREE-PHASE INDUCTION MACHINE
More informationGenetic drift. 1. The Nature of Genetic Drift
Genetic drift. The Nature of Genetic Drift To date, we have assumed that populations are infinite in size. This assumption enabled us to easily calculate the expected frequencies of alleles and genotypes
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 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 informationEvolutionary Computation
Evolutionary Computation Evolutionary Computation A Unified Approach Kenneth A. De Jong ABradfordBook The MIT Press Cambridge, Massachusetts London, England c 2006 Massachusetts Institute of Technology
More informationSimulation-Based Analysis and Optimisation of Planning Policies over the Product Life Cycle within the Entire Supply Chain
From the SelectedWorks of Liana Napalkova June, 2009 Simulation-Based Analysis and Optimisation of Planning Policies over the Product Life Cycle within the Entire Supply Chain Galina Merkuryeva Liana Napalkova
More informationLAB. POPULATION GENETICS. 1. Explain what is meant by a population being in Hardy-Weinberg equilibrium.
Period Date LAB. POPULATION GENETICS PRE-LAB 1. Explain what is meant by a population being in Hardy-Weinberg equilibrium. 2. List and briefly explain the 5 conditions that need to be met to maintain a
More informationAn Improved Genetic Algorithm for Generation Expansion Planning
916 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 15, NO. 3, AUGUST 2000 An Improved Genetic Algorithm for Generation Expansion Planning Jong-Bae Park, Young-Moon Park, Jong-Ryul Won, and Kwang Y. Lee Abstract
More informationAn evolutionary algorithm for a real vehicle routing problem
Int. Journal of Business Science and Applied Management, Volume 7, Issue 3, 2012 An evolutionary algorithm for a real vehicle routing problem Panagiotis Adamidis Alexander TEI of Thessaloniki, Department
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 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 informationLinkage & Genetic Mapping in Eukaryotes. Ch. 6
Linkage & Genetic Mapping in Eukaryotes Ch. 6 1 LINKAGE AND CROSSING OVER! In eukaryotic species, each linear chromosome contains a long piece of DNA A typical chromosome contains many hundred or even
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 informationChapter 23: The Evolution of Populations. 1. Populations & Gene Pools. Populations & Gene Pools 12/2/ Populations and Gene Pools
Chapter 23: The Evolution of Populations 1. Populations and Gene Pools 2. Hardy-Weinberg Equilibrium 3. A Closer Look at Natural Selection 1. Populations & Gene Pools Chapter Reading pp. 481-484, 488-491
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 informationStudy Guide A. Answer Key. The Evolution of Populations
The Evolution of Populations Answer Key SECTION 1. GENETIC VARIATION WITHIN POPULATIONS 1. b 2. d 3. gene pool 4. combinations of alleles 5. allele frequencies 6. ratio or percentage 7. mutation 8. recombination
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 informationParameter identification in the activated sludge process
Parameter identification in the activated sludge process Päivi Holck, Aki Sorsa and Kauko Leiviskä Control Engineering Laboratory, University of Oulu P.O.Box 4300, 90014 Oulun yliopisto, Finland e-mail:
More informationAdapting Operator Settings in Genetic Algorithms
Adapting Operator Settings in Genetic Algorithms Andrew Tuson and Peter Ross Department of Artificial Intelligence, University of Edinburgh 5 Forrest Hill, Edinburgh EH1 2QL, U.K. Email: fandrewt,peterg@dai.ed.ac.uk
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 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. 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 informationGENETIC ALGORITHMS FOR DESIGN OF PIPE NETWORK SYSTEMS
116 Journal of Marine Science and Technology, Vol. 13, No. 2, pp. 116-124 (2005) GENETIC ALGORITHMS FOR DESIGN OF PIPE NETWORK SYSTEMS Hong-Min Shau*, Bi-Liang Lin**, and Wen-Chih Huang*** Key words: genetic
More informationSummary Genes and Variation Evolution as Genetic Change. Name Class Date
Chapter 16 Summary Evolution of Populations 16 1 Genes and Variation Darwin s original ideas can now be understood in genetic terms. Beginning with variation, we now know that traits are controlled by
More informationProcedia - Social and Behavioral Sciences 189 ( 2015 ) XVIII Annual International Conference of the Society of Operations Management (SOM-14)
Available online at www.sciencedirect.com ScienceDirect Procedia - Social and ehavioral Sciences 189 ( 2015 ) 184 192 XVIII Annual International Conference of the Society of Operations Management (SOM-14)
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 informationGenetic Algorithm and Neural Network
Proceedings of the 7th WSEAS International Conference on Applied Informatics and Communications, Athens, Greece, August 24-26, 2007 345 Genetic Algorithm and Neural Network JIRI STASTNY*, VLADISLAV SKORPIL**
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 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 informationChapter 8. An Introduction to Population Genetics
Chapter 8 An Introduction to Population Genetics Matthew E. Andersen Department of Biological Sciences University of Nevada, Las Vegas Las Vegas, Nevada 89154-4004 Matthew Andersen received his B.A. in
More informationA New Approach to Solve Multiple Traveling Salesmen Problem by Clonal Selection Algorithm
International Journal of Applied Engineering Research ISSN 0973-4562 Volume 9, Number 21 (2014) pp. 11005-11017 Research India Publications http://www.ripublication.com A New Approach to Solve Multiple
More informationOptimal Operator Assignment In An Assembly Line Using Genetic Algorithm
Optimal Operator Assignment in an Assembly Line using Genetic Algorithm 1 Optimal Operator Assignment In An Assembly Line Using Genetic Algorithm TANZINA ZAMAN, SANJOY KUMAR PAUL* AND ABDULLAHIL AZEEM
More informationPreventive Maintenance Optimization of Critical Equipments in Process Plant using Heuristic Algorithms
Proceedings of the 200 International Conference on Industrial Engineering and Operations Management Dhaka, Bangladesh, January 9 0, 200 Preventive Maintenance Optimization of Critical Equipments in Process
More informationGenetic Algorithms and Sensitivity Analysis in Production Planning Optimization
Genetic Algorithms and Sensitivity Analysis in Production Planning Optimization CECÍLIA REIS 1,2, LEONARDO PAIVA 2, JORGE MOUTINHO 2, VIRIATO M. MARQUES 1,3 1 GECAD Knowledge Engineering and Decision Support
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 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 informationResearch and Applications of Shop Scheduling Based on Genetic Algorithms
1 Engineering, Technology and Techniques Vol.59: e16160545, January-December 2016 http://dx.doi.org/10.1590/1678-4324-2016160545 ISSN 1678-4324 Online Edition BRAZILIAN ARCHIVES OF BIOLOGY AND TECHNOLOGY
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 informationREVIEW 5: EVOLUTION UNIT. A. Top 10 If you learned anything from this unit, you should have learned:
Period Date REVIEW 5: EVOLUTION UNIT A. Top 10 If you learned anything from this unit, you should have learned: 1. Darwin s Principle of Natural Selection a. Variation individuals within a population possess
More informationProceeding, Seminar of Intelligent Technology and Its Applications (SITIA 2000) Graha Institut Teknologi Sepuluh Nopember, Surabaya, 19 April 2000
Proceeding, Seminar of Intelligent Technology and Its Applications (SITIA ) Graha Institut Teknologi Sepuluh Nopember, Surabaya, 19 April Experimental Approach of Mutation Probability Selection of Floating-point-based
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 informationEvolving Bidding Strategies for Multiple Auctions
Evolving Bidding Strategies for Multiple Auctions Patricia Anthony and Nicholas R. Jennings 1 Abstract. Due to the proliferation of online auctions, there is an increasing need to monitor and bid in multiple
More informationThe Genetic Algorithm CSC 301, Analysis of Algorithms Department of Computer Science Grinnell College December 5, 2016
The Genetic Algorithm CSC 301, Analysis of Algorithms Department of Computer Science Grinnell College December 5, 2016 The Method When no efficient algorithm for solving an optimization problem is available,
More informationUSING GENETIC ALGORITHMS TO GENERATE ALTERNATIVES FOR MULTI-OBJECTIVE CORRIDOR LOCATION PROBLEMS
USING GENETIC ALGORITHMS TO GENERATE ALTERNATIVES FOR MULTI-OBJECTIVE CORRIDOR LOCATION PROBLEMS Xingdong Zhang Department of Geography, University of Iowa, 16 Jessup Hall, Iowa City, IA 2242, Tel 1-19-1,
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 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 informationPackage DNABarcodes. March 1, 2018
Type Package Package DNABarcodes March 1, 2018 Title A tool for creating and analysing DNA barcodes used in Next Generation Sequencing multiplexing experiments Version 1.9.0 Date 2014-07-23 Author Tilo
More information