Rapid screening procedures for zero-one optimization via simulation

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


Some existing simulation optimization algorithms (e.g., adaptive random search) become pure random search methods and thus are ineffective for the zero-one optimization via simulation problem. In this paper, we present highly efficient rapid screening procedures for solving the zero-one optimization via simulation problem. Three approaches adopting different sampling rules and providing different statistical guarantees are described. We also propose efficient neighborhood search methods and a simple algorithm for generation of initial solutions, all of which can be incorporated into our rapid screening procedures. The proposed procedures are more adaptive than ordinary ranking and selection procedures because in each iteration they can eliminate inferior solutions and intelligently sample promising solutions from the neighborhood of the survivors. Empirical studies are performed to compare the efficiency of the proposed procedures with other existing ones.

Original languageEnglish
Pages (from-to)317-331
Number of pages15
JournalINFORMS Journal on Computing
Issue number2
Publication statusPublished - 2013 Mar 1

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Computer Science Applications
  • Management Science and Operations Research


Dive into the research topics of 'Rapid screening procedures for zero-one optimization via simulation'. Together they form a unique fingerprint.

Cite this