An Algorithm for Efficient Mate Selection
Author Information
Author(s): Brian P Kinghorn
Primary Institution: School of Environmental and Rural Science, University of New England, Armidale, NSW, Australia
Hypothesis
Can a mate selection algorithm be improved to efficiently apply constraints on certain matings?
Conclusion
The new algorithm significantly increases the speed of mate selection, making it feasible for larger breeding programs.
Supporting Evidence
- The new algorithm is several hundred times faster than previous methods.
- It allows for the inclusion of logistical constraints in mate selection.
- The method has been successfully used in operational breeding programs since 2007.
Takeaway
This study created a new way to choose animal mates that is much faster and can handle more complex rules about who can mate with whom.
Methodology
The study used an evolutionary algorithm to optimize mate selection while respecting grouping constraints.
Limitations
The algorithm's performance may vary based on the complexity of the constraints and the specific breeding program.
Participant Demographics
The study involved 443 male candidates and 596 female candidates from three separate breeding farms.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website