TY  - JOUR
T1  - Moving towards an optimal sample using VNS algorithm
AU  - Dash, Priyaranjan
AU  - Hore, Samrat
PY  - 2016
DA  - October
JF  - Hacettepe Journal of Mathematics and Statistics
PB  - Hacettepe University
WT  - DergiPark
SN  - 2651-477X
SP  - 1519
EP  - 1524
VL  - 45
IS  - 5
LA  - en
AB  - In almost all random sampling schemes, we adopt different sampling designs with an objective of obtaining a better representative sample (optimal sample) for the population. Application of different randomization techniques were adopted for providing a supportive basis for this. Now the question arises, whether the final sample selected, on which all our efforts are utilized, from the population is an optimal sample or not? No where we are checking about the optimality of this sample, i.e., whether this sample is the best one or there exists any other sample which is more optimal than the selected one satisfying all the constraints. In all these procedures, we only assume but, nowhere we are establishing a guarantee about the achievement of such a representative sample. The present paper emphasizes on achieving an optimal sample by using variable neighborhood search (VNS) technique.
KW  - Optimal Sample
KW  - Representative Sample
KW  - Variable Neighborhood Search
CR  - .
CR  - .
UR  - https://dergipark.org.tr/en/pub/hujms/issue//524502
L1  - https://dergipark.org.tr/en/download/article-file/644906
ER  -