Applications of Robust Methods in Spatial Analysis
Algorithm 2
We suppose that permanent locations are in a two dimensional space, for instance, water wells in a region. The experimenter is interested in choosing optimal locations from these permanent locations. Let be a design space, where contains information about th permanent location for . Define the index set .
Step 1: Let , where is the nearest integer function.
Step 2: Identify a rectangle that includes all permanent locations.
Step 3: Generate equispaced locations with size in the rectangle. We assume that the generated design space is , where contains information that is related to th generated location for .
Step 4: Choose optimal locations with size using Algorithm 1 from . Let be the selected optimal locations.
