Do harvest refuges buffer kangaroos against evolutionary responses to selective harvesting?

There is a wealth of literature documenting a directional change of body size in heavily harvested populations. Most of this work concentrates on aquatic systems, but terrestrial populations are equally at risk. This paper explores the capacity of harvest refuges to counteract potential effects of size-selective harvesting on the allele frequency,of populations. We constructed a stochastic, individual-based model parameterized with data on red kangaroos. Because we do not know which part of individual growth would change in the course of natural selection, we explored the effects of two alternative models of individual growth in which alleles affect either the growth rate or the maximum size. The model results show that size-selective harvesting can result in significantly smaller kangaroos for a given age when the entire population is subject to harvesting. In contrast, in scenarios that include dispersal from harvest refuges, the initial allele frequency remains virtually unchanged.

Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment

The buffer allocation problem (BAP) is a well-known difficult problem in the design of production lines. We present a stochastic algorithm for solving the BAP, based on the cross-entropy method, a new paradigm for stochastic optimization. The algorithm involves the following iterative steps: (a) the generation of buffer allocations according to a certain random mechanism, followed by (b) the modification of this mechanism on the basis of cross-entropy minimization. Through various numerical experiments we demonstrate the efficiency of the proposed algorithm and show that the method can quickly generate (near-)optimal buffer allocations for fairly large production lines.

Estimating buffer overflows in three stages using cross-entropy

In this paper we propose a fast adaptive Importance Sampling method for the efficient simulation of buffer overflow probabilities in queueing networks. The method comprises three stages. First we estimate the minimum Cross-Entropy tilting parameter for a small buffer level; next, we use this as a starting value for the estimation of the optimal tilting parameter for the actual (large) buffer level; finally, the tilting parameter just found is used to estimate the overflow probability of interest. We recognize three distinct properties of the method which together explain why the method works well; we conjecture that they hold for quite general queueing networks. Numerical results support this conjecture and demonstrate the high efficiency of the proposed algorithm.