2021
DOI: 10.1071/an21076
|View full text |Cite
|
Sign up to set email alerts
|

The Modular Breeding Program Simulator (MoBPS) allows efficient simulation of complex breeding programs

Abstract: Context.Breeding programs aim at improving the genetic characteristics of livestock populations with respect to productivity, fitness and adaptation, while controlling negative effects such as inbreeding or health and welfare issues. As breeding is affected by a variety of interdependent factors, the analysis of the effect of certain breeding actions and the optimisation of a breeding program are highly complex tasks.Aims. This study was conducted to display the potential of using stochastic simulation to anal… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…Combined with the high number of parameters to consider, it becomes computationally challenging to simulate each potential breeding scheme and directly derive the optimal one. Therefore, to overcome these computational challenges, analysis of breeding programs via stochastic simulations is usually limited to a couple of potentially interesting scenarios, which are then simulated and compared against each other (Wensch-Dorendorf et al 2011;Esfandyari et al 2015;Gaynor et al 2017;Büttgen et al 2020;Pook et al 2021).…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Combined with the high number of parameters to consider, it becomes computationally challenging to simulate each potential breeding scheme and directly derive the optimal one. Therefore, to overcome these computational challenges, analysis of breeding programs via stochastic simulations is usually limited to a couple of potentially interesting scenarios, which are then simulated and compared against each other (Wensch-Dorendorf et al 2011;Esfandyari et al 2015;Gaynor et al 2017;Büttgen et al 2020;Pook et al 2021).…”
mentioning
confidence: 99%
“…The grid-search approach is a commonly used algorithm for finding the optimum allocation of test resources when there are few parameters to optimize (Longin et al 2006;Gordillo and Geiger 2008;Mi et al 2014Mi et al , 2016Pook et al 2021). However, although grid-search provides an acceptable solution to the problem in many smaller applications, as it is relatively straightforward to define a grid of possible parameter combinations and evaluate the performance of each combination, it is not efficient for a large number of parameters due to the increased computational time and, or the need for a sparse grid.…”
mentioning
confidence: 99%