Applications of Robust Methods in Spatial Analysis

Algorithm 1

Let be the required number of optimal locations and be the index set. The set denotes the set difference of and . We follow steps 1–4 to get optimal locations.

	Step 1: Collect n =  locations randomly without replacement from the design space and let be the collected locations and be the corresponding index set, where .
	Step 2: Sequentially select  =  location such that
	where . Thus, we have the chosen locations and corresponding index set .
	Step 3: Remove the initial locations from the set . So, the collected locations are and the corresponding index set is with . Also, we have .
	Step 4: Again sequentially choose  =  location such that
	, .
	Finally, the set contains the selected optimal locations.