POPSIM etc Note that this is discussion, not firm statements, and written very late yesterday evening without checking. But as we have one hour to fill...

Slides:



Advertisements
Similar presentations
Fitness Uniform Deletion: A Simple Way to Preserve Diversity Shane Legg & Marcus Hutter IDSIA Galleria Manno-Lugano Switzerland.
Advertisements

Darius Danusevičius and Dag Lindgren Optimize your breeding with Breeding Cycler Efficient long-term cycling strategy 35 min + 10 min Lithuanian Forest.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Planning rice breeding programs for impact
Choices Involving Risk
1 Evolutionary Computational Inteliigence Lecture 6b: Towards Parameter Control Ferrante Neri University of Jyväskylä.
Considerations about life time and graft density of future Scots pine seed orchards Dag Lindgren, Finnvid Prescher, Yousry El- Kassaby, Curt Almqvist,
Variance reduction techniques. 2 Introduction Simulation models should be coded such that they are efficient. Efficiency in terms of programming ensures.
12 Inventory Management.
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
Gene diversity measured by status number and other breeding concepts Dag Lindgren Department of Forest Genetics and Plant Physiology Swedish University.
Comparison of long-term breeding strategies using phenotype, clonal, progeny testing for Eucalyptus Darius Danusevičius 1,2 and Dag Lindgren Department.
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
DaDa work Efficient long-term cycling strategy.
Introduction to Cryptography and Security Mechanisms: Unit 5 Theoretical v Practical Security Dr Keith Martin McCrea
Low Input Tree Breeding Strategies Dag Lindgren 1 and Run-Peng Wei 2,3 1Department of Forest Genetics and Plant Physiology Swedish University of Agricultural.
Lindgren, Dag.(Swedish University of Agricultural Sciences, Sweden), Danusevicius, Darius. (Lithuanian Forest Research Institute. Lithuania), Högberg,
Dag Lindgren 2007 Much from DaDa work and presentation by DaDa 2004 For more information look there Phenotype-progeny two stage is best for Scots.
Estimation of Distribution Algorithms Let’s review what have done in EC so far: We have studied EP and found that each individual searched via Gaussian.
Evolutionary Computational Intelligence
Genetic algorithms for neural networks An introduction.
Balanced Breeding in a Grand Parent Perspective. - Consideration for Swedish Scots pine breeding Dag Lindgren Förädlingsutredningsmöte Uppsala
Size of breeding population Dag Lindgren and Darius Danusevicius DaDa March 2004 For some reason all slides are not visible from my portable, but from.
Dag Lindgren and Xiao-Ru Wang
Unbalances in Tree Breeding Dag Lindgren, SLU, Sweden Let’s have the discussion on the net instead of oral, this show and a discussion site is available.
Norway spruce breeding in Sweden is based on clone testing Presentation at IUFRO WP Norway spruce Poland, Sept 4, 2007 Dag Lindgren Swedish University.
Combining genetic gain, gene diversity, time components, cost components when optimizing breeding strategies Dag Lindgren Seminar at the research school.
Stratified sublining Dag Lindgren, Swedish University of Agricultural Sciences, UMEÅ, Sweden. Seppo Ruotsalainen, The Finnish Forest Research Institute,
Long term tree breeding as analyzed by the breeding cycler tool DaDa (Dag & Darius) or (Darius & Dag)
Low Input Tree Breeding Strategies Dag Lindgren Department of Forest Genetics and Plant Physiology, Swedish University of Agricultural Sciences, Umeå Sweden.
BASIC FEATURES OF BREEDING Taryono Faculty of Agriculture Gadjah Mada University.
Determining the Size of
TOPIC FOUR: INHERITANCE OF A SINGLE GENE Why can’t we all just get along and, say, call an inbred line in the F 6­ generation simply ‘an F 6 line’? Well.
Neural Network Tools. Neural Net Concepts The package provides a “standard” multi-layer perceptron –Composed of layers of neurons –All neurons in a layer.
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 17 Slide 1 Extreme Programming.
Genetic Programming.
1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.
Security Risk Management
Breeding for Yield PLS 664 Spring Issues How do we build yield potential into a cross? How do we select for yield in the generations prior to yield.
Darius Danusevičius and Dag Lindgren Breeding cycler: Efficient long-term cycling strategy.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
Presentation at Subtropical Forest Research Institute, Chinese Academy of Forestry, August 19, 2010.
DaDa work Deployment of related clones into seed orchards The road to efficient breeding Seed orchard conference, Umea, Sept Darius.
PBG 650 Advanced Plant Breeding
Chapter 13: Inferences about Comparing Two Populations Lecture 8b Date: 15 th November 2015 Instructor: Naveen Abedin.
Chapter 12 Risk and Refinements on CB © 2012 Pearson Prentice Hall. All rights reserved
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.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Genetic Variation. KEY CONCEPT A population shares a common gene pool.
STT2073 Plant Breeding and Improvement. Quality vs Quantity Quality: Appearance of fruit/plant/seed – size, colour – flavour, taste, texture – shelflife.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 12 Inventory Management.
11.1 Genetic Variation Within Population KEY CONCEPT A population shares a common gene pool.
Chapter 5: Software effort estimation
Gene350 Animal Genetics Lecture September 2009.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Energy management strategy review Proton Driver Efficiency Workshop Piero Valente
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Generating, Maintaining, and Exploiting Diversity in a Memetic Algorithm for Protein Structure Prediction Mario Garza-Fabre, Shaun M. Kandathil, Julia.
PRINCIPLES OF CROP PRODUCTION ABT-320 (3 CREDIT HOURS)
Fossils provide a record of evolution.
Chapter 5: Software effort estimation
HMD Bio CH 11.1 KEY CONCEPT A population shares a common gene pool.
Genetic Algorithms Chapter 3.
Boltzmann Machine (BM) (§6.4)
Extreme Programming.
Presentation transcript:

POPSIM etc Note that this is discussion, not firm statements, and written very late yesterday evening without checking. But as we have one hour to fill... Dag Lindgren Uppsala May 14

Possible reasons why Breeding Cycler favors a 2-step strategy more than POPSIM Cycling is penalized by 3 years budget and a drop in gain for increase in coancestry. (Here Breeding cycler may be to harsh to cycling) Optimization for timing gives higher weight and longer time in field to the more efficient progeny- test. Even other optimisations may be more efficient in a 2 stage strategy. POPSIM does not credit extra gain for a two years longer phenotypic test in two step.

POPSIM vs. BREEDING CYCLER Two steps, first phenotype when progeny testing of pre-selected has been run by BREEEDING CYCLER and when POPSIM. POPSIM runs indicate they are similar in annual gain, while BREEDING CYCLER found it 20% better in main scenario. What could the reasons be?? BREEDING CYCLER considers cost for crosses and generation turn over and optimizes more, including duration for field testing and cycling, POPSIM does not. This is a possible reason for the different results.

Timing considerations Program Strategy Breeding Cycler POPSIM Phenotypic prese Phenotypic Progeny Combined Followed by progeny Basic Intensive Strategy Cycling time, total Sel age Phenotype Sel age progeny Use of cycle for testing 81% 65%36%46%75%

Two stage is an efficient use of the breeding cycle Progeny testing and phenotypic testing uses the breeding cycle much more effective for testing if used 2 stage wise than if used as two independent subsequent cycles. Thus it is surprising for me that 2 stage does not appear still better than phenotypic in POPSIM.

Timing considerations Program Strategy POPSIM Phenotypic prese Phenotypic Progeny Combined Followed by progeny Basic Intensive Strategy43125 Cycling time, total Sel age Phenotype 1513 Sel age progeny Use of cycle for testing 81%65%36%46%75%

Efficient use of breeding cycle Note that progeny-testing utilizes the breeding cycle for field testing very inefficient Two stage and combined utilizes most of the breeding cycle for field testing Phenotypic is rather efficient but not in top

POPSIM Does not adapt well to testing time. Longer field testing does not increase gain. Most strategies use different testing time and can thus not be fairly compared. This is not trivial to mend and need some thinking. Does not consider costs for e.g. grafts, but cost is easily adjusted for that, and needs no change in the code. The difficulty is actually that not much effort has been done to estimate costs. Calculates gene diversity loss and can make gene diversity loss equal in different scenarios, but has no mechanism for ranking scenarios with different gene diversity loss. But a cost and genetic penalty of gene diversity loss can easily be made and needs no change in the code. Invests rather much energy in creating the actual base line situation. That is history and just set to base line. It is a bit unfortunate that the creation of the founder population depends on a variable among scenarios, so this trivial factor may cause false differences among scenarios. The latest will probably be remedied but at the cost of an additional input variable. It is bloody difficult to set up mating schemes with desires about a high degree of PAM and restrict against half-sib mating. To restrict for half-sibs is easier for a real breeder, but a real breeder would also find it hard to make perfect PAM except for SPM.

Strategy 5, combined Development of this part seems to be very worthwhile and for me looks as the most important and promising development. However we have differences in opinion about concepts and terminology, and I suggest that we discuss that more and try to reach a consensus before writing the actual code. The manus Dag, Darius and Ola is one of the sources for this discussion. As it also tries to exploit basically this strategy, it would be better if the concepts converged. E.g. I feel more comfortable with “breeding population” rather than “pre-selections”, and now call Olas pre-selections for candidate parents.