INFORMS Journal on Computing
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


INFORMS JOURNAL ON COMPUTING
Vol. 21, No. 2, Spring 2009, pp. 193-208
DOI: 10.1287/ijoc.1080.0309
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Andradóttir, S.
Right arrow Articles by Prudius, A. A.
Right arrow Search for Related Content

Balanced Explorative and Exploitative Search with Estimation for Simulation Optimization

Sigrún Andradóttir, Andrei A. Prudius

H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
Quantitative Financial Development, Bloomberg LP, New York, New York 10022

sa{at}gatech.edu
aprudius{at}gmail.com

We discuss desirable features that optimization algorithms should possess to exhibit good empirical performance when applied to solve simulation optimization problems possessing little known structure. Our framework emphasizes maintaining an appropriate balance between exploration, exploitation, and estimation. With the exception of estimation, our ideas are also applicable in (unstructured) deterministic optimization. Exploration refers to (globally) searching the entire feasible region for promising solutions, exploitation refers to the (local) search for improved solutions in promising subregions, and estimation refers to obtaining enhanced estimates of the objective function values at promising solutions and of the optimal solution. We also present two new random search methods that possess these desirable features, prove their almost-sure global convergence, and provide preliminary numerical results that suggest that the proposed framework is promising from a practical point of view.

Key words: stochastic optimization; random search; sampling
History: received September 2006; revised August 2008; accepted September 2008.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2009 by INFORMS.