Comparative Study of Simulated Annealing Algorithms for Optimal Arrangement Problems in a Linear Consecutive-k-out-of-n: F System

2010 ◽  
pp. 157-168
Author(s):  
Koji Shingyochi ◽  
Hisashi Yamamoto
Keyword(s):  
Simulated Annealing ◽  
Comparative Study ◽  
Optimal Arrangement ◽  
Annealing Algorithms ◽  
F System

scholarly journals A simulated annealing-based algorithm for selecting balanced samples

2021 ◽  
Author(s):  
Roberto Benedetti ◽  
Maria Michela Dickson ◽  
Giuseppe Espa ◽  
Francesco Pantalone ◽  
Federica Piersimoni
Keyword(s):  
Simulated Annealing ◽  
Optimization Problem ◽  
Sample Selection ◽  
Auxiliary Information ◽  
Real Data ◽  
Simulation Experiments ◽  
Balanced Sampling ◽  
Inclusion Probabilities ◽  
Random Method ◽  
Annealing Algorithms

AbstractBalanced sampling is a random method for sample selection, the use of which is preferable when auxiliary information is available for all units of a population. However, implementing balanced sampling can be a challenging task, and this is due in part to the computational efforts required and the necessity to respect balancing constraints and inclusion probabilities. In the present paper, a new algorithm for selecting balanced samples is proposed. This method is inspired by simulated annealing algorithms, as a balanced sample selection can be interpreted as an optimization problem. A set of simulation experiments and an example using real data shows the efficiency and the accuracy of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document