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

摘要

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 reported minimum-inbreeding distance of the extended MI scheme was the lowest in comparison to the completely randomized and the randomized, replicated, staggered clonal-row ((RSCR)-S-2) 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 considered.