Expansion of the minimum-inbreeding seed orchard design to operational scale

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60460709%3A41320%2F15%3A67297" target="_blank" >RIV/60460709:41320/15:67297 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/s11295-015-0842-5" target="_blank" >http://dx.doi.org/10.1007/s11295-015-0842-5</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s11295-015-0842-5" target="_blank" >10.1007/s11295-015-0842-5</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Expansion of the minimum-inbreeding seed orchard design to operational scale

Popis výsledku v původním jazyce

The minimum-inbreeding (MI) seed orchard layout, formulated originally as a global quadratic assignment problem, was expanded into realistic problem sizes that are often encountered in operational forestry, where two modifications were tested: (1) the merging algorithm of independent MI?s solutions (i.e., smaller blocks) and (2) the extended global (genetic-tabu) algorithm. Extending the global heuristic algorithm of the quadratic assignment problem seems to be the most efficient strategy. The reportedminimum-inbreeding distance of the extended MI scheme was the lowest in comparison to the completely randomized and the randomized, replicated, staggered clonal-row (R2SCR) seed orchard design schemes. These conclusions also hold for more complex scenarios when added relatedness among orchard?s parents or unequal deployment was considered. This improved MI scheme is suitable to large and complex advanced-generation seed orchards, where many practical constraints have to be jointly consid

Název v anglickém jazyce

Expansion of the minimum-inbreeding seed orchard design to operational scale

Popis výsledku anglicky

The minimum-inbreeding (MI) seed orchard layout, formulated originally as a global quadratic assignment problem, was expanded into realistic problem sizes that are often encountered in operational forestry, where two modifications were tested: (1) the merging algorithm of independent MI?s solutions (i.e., smaller blocks) and (2) the extended global (genetic-tabu) algorithm. Extending the global heuristic algorithm of the quadratic assignment problem seems to be the most efficient strategy. The reportedminimum-inbreeding distance of the extended MI scheme was the lowest in comparison to the completely randomized and the randomized, replicated, staggered clonal-row (R2SCR) seed orchard design schemes. These conclusions also hold for more complex scenarios when added relatedness among orchard?s parents or unequal deployment was considered. This improved MI scheme is suitable to large and complex advanced-generation seed orchards, where many practical constraints have to be jointly consid

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

GK - Lesnictví

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Tree Genetics & Genomes

ISSN

1614-2942

e-ISSN

—

Svazek periodika

11

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

8

Strana od-do

1-8

Kód UT WoS článku

000349553500011

EID výsledku v databázi Scopus

—