SAR-BSA
A Smart Adaptive Repair Algorithm for Constructing generalized balanced sampling plans excluding adjacent units with relaxed pairwise inclusion probabilities
Developed by ICAR-IASRI, New Delhi, India
This web application facilitates the generation of a set of blocks (samples), each comprising exactly
k distinct experimental units drawn from a population of N units, while adhering to two primary constraints:
- Spacing constraint — no two units separated by less than a specified minimum proximity m (in circular distance) may appear together within the same block.
- Pairwise inclusion constraint — the frequency with which any unordered pair of units occurs across all blocks must not exceed a predetermined threshold λ.
Note: Here, it is not a necessary condition that all non-adjacent pairs must occur with the same frequency in the generated blocks.
Developed by: ICAR-IASRI, New Delhi, India