A parallel optimization approach for controlling allele diversity in conservation schemes

We propose a novel method to control allelic diversity in conservation schemes based on an optimization problem, characterized by a convex program subject to integer linear constraints. Departing from previous studies considering similar problems, we implement a parallel simulated annealing algorithm to minimize the number of alleles lost across generations. The proposed algorithm shows excellent timing and minimization performances. Execution time decreases linearly with the number of processors used, providing similar results in all cases.