Search bioRxiv⌕ Search

Biology subjects

Hassanpour, A.

Publications and source records attributed to Hassanpour, A..

3 recordsLinked to original sources

Optimization of wheat breeding programs using an evolutionary algorithm achieves enhanced genetic gain through strategic resource allocation

Plant breeding is a complex process that involves trade-offs among competing breeding objectives and limited resources. Despite the necessity for optimization of breeding program design, the inherent complexity can make optimization challenging. Most often, a predefined set of scenarios is compared or a single parameter of a breeding scheme is assessed in depth. In a previous study, we developed an optimization pipeline, utilizing stochastic simulations and an evolutionary algorithm, suitable for the joint optimization of multiple class and continuous parameters. Here, we assess the applicability of our framework to realistic plant breeding schemes. For this, a wheat line breeding scheme simulated using AlphaSimR and a wheat hybrid breeding scheme simulated using MoBPS were considered. Both schemes were further optimized using our optimization pipeline. When aiming to maximize genetic gain while maintaining a fixed budget, the breeding program design suggested by our optimization pipeline results in 32.6% higher genetic gain compared to a proposed baseline wheat line breeding program. When adjusting the breeding objective to put 20% of the weight on the maintenance of genetic diversity, genetic gain still increased by 4.5% while maintaining 9.1% higher genetic diversity compared to the baseline. Similarly, 4.6%/8.8% higher genetic gains for the male/female part of the hybrid breeding scheme compared to its baseline scenario were obtained. Results highlight the importance of optimizing breeding program design to improve breeding efficiency, with the suggested pipeline offering breeders a powerful framework to refine breeding designs, balance breeding goals, and enhance competitiveness, profitability, and sustainability. Core Ideas Evolutionary algorithm can improve breeding design by optimizing many breeding decisions simultaneously Our framework is compatible with various backend simulators, enabling broad application across platforms Optimized designs enhance genetic gain and diversity, demonstrating greater overall breeding program efficiency Genetic gain in wheat line program increased by over 30% compared to a baseline program without additional costs Plain Language Summary Modern plant breeding programs must make many complex decisions, such as how many plants to test or where to grow them while staying with tight budgets. These choices are often connected and involve trade-offs between goals like improving genetic gain, maintaining diversity, and reducing costs. In this study, we used an evolutionary algorithm framework to evaluate thousands of breeding program designs and identify the most effective ones. The optimized programs outperformed the respective baseline programs, increasing genetic gain by up to 32% and preserving 9% more genetic diversity - all without additional costs. This flexible framework can support a wide range of breeding decisions and adapt to different program types, providing breeders with a powerful tool to improve outcomes and use resources more efficiently.

genetics↗

Strategies to improve selection compared to selection based on estimated breeding values

BackgroundSelection of individuals based on their estimated breeding values aims to maximize response to selection to the next generation in the additive model. However, when the aim is not only about short-term population-wide genetic gain but also the gain over multiple generations, an optimal strategy is not as clear-cut, as the maintenance of genetic diversity may become an important factor. This study provides an extended comparison of existing selection strategies in a unifying testing pipeline using the simulation software MoBPS. ResultsApplying a weighting factor on the estimated SNP effects based on the frequency of the beneficial allele resulted in an increase of the long-term genetic gain of 1.6% after 50 generations while reducing inbreeding rates by 16.2% compared to truncation selection based on estimated breeding values. However, this also resulted in short-term losses in genetic gain of 1.2% with the break-even point reached after 25 generations. In contrast, inclusion of the average kinship of an individual to top individuals of the population as an additional trait in the selection index with a weight of 17.5% resulted in no short-term losses and increased long-term genetic gains by 4.3% while reducing inbreeding by 15.8%, achieving very similar efficiency to the use of optimum genetic contribution selection. Combining multiple diversity management strategies, with weights for each strategy optimized using an evolutionary algorithm resulted in a breeding scheme with 5.1% increased genetic gain and 37.3% reduced inbreeding rates. The proposed strategy included the use of optimum genetic contribution, weighting of SNP effects based on allele frequency, average kinship as a trait in the selection index, avoiding matings between related individuals, and lowering the proportion of selected individuals. ConclusionsThe combination of selection strategies for the management of genetic diversity was shown to be far superior to the use of any singular method tested in this study. As an efficient use of methods for the management of genetic diversity and inbreeding does not necessarily lead to short-term losses in genetic gain and comes at no extra costs, it is critical for breeding companies to implement such strategies for long-term success.

genetics↗

Beyond Scenarios - Optimization of breeding program design (MoBPSopti)

In recent years, breeding programs have become increasingly larger and more structurally complex, with various highly interdependent parameters and contrasting breeding goals. Therefore, resource allocation in a breeding program has become more complex, and the derivation of an optimal breeding strategy has become more and more challenging. As a result, it is a common practice to reduce the optimization problem to a set of scenarios that are only changed in a few parameters and, in turn, can be deeply analyzed in detail. This paper aims to provide a framework for the numerical optimization of breeding programs beyond just comparing scenarios. For this, we first determine the space of potential breeding programs that is only limited by basic constraints like the budget and housing capacities. Subsequently, the goal is to identify the optimal breeding program by finding the parametrization that maximizes the target function, as a combination of the different breeding goals. To assess the value of the target function for a parametrization, we propose the use of stochastic simulations and the subsequent use of a kernel regression method to cope with the stochasticity of simulation outcomes. This procedure is performed iteratively to narrow down the most promising areas of the search space and perform more and more simulations in these areas of interest. The developed concept was applied to a dairy cattle program with a target function aiming at genetic gain and genetic diversity conservation limited by budget constraints.

genetics↗