Rapid screening algorithms for stochastically constrained problems

Rapid screening algorithms for stochastically constrained problems

0.00 Avg rating0 Votes
Article ID: iaor20172750
Volume: 254
Issue: 1
Start Page Number: 425
End Page Number: 447
Publication Date: Jul 2017
Journal: Annals of Operations Research
Authors: ,
Keywords: optimization, stochastic processes, statistics: sampling, statistics: empirical
Abstract:

A simulation optimization framework containing three fundamental stages (feasibility check, screening, and selection) is proposed for solving the zero‐one optimization via simulation problem in the presence of a single stochastic constraint. We present three rapid screening algorithms that combine these three stages in different manners, such that various sampling mechanisms are applied, therefore yielding different statistical guarantees. An empirical evaluation for the efficiency comparison between the proposed algorithms and other existing works is provided.

Reviews

Required fields are marked *. Your email address will not be published.