| Discrete stochastic optimization via a modification of the stochastic ruler method |
| Full text |
Pdf
(552 KB)
|
| Source
|
Winter Simulation Conference
archive
Proceedings of the 28th conference on Winter simulation
table of contents
Coronado, California, United States
Pages: 406 - 411
Year of Publication: 1996
ISBN:0-7803-3383-7
|
|
Authors
|
|
Mahmoud H. Alrefaei
|
Department of Industrial Engineering, University of Wisconsin - Madison, 1513 University Avenue, Madison, Wisconsin
|
|
Sigrún Andradóttir
|
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia
|
|
| Sponsors |
|
| Publisher |
IEEE Computer Society
Washington, DC, USA
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 20, Citation Count: 2
|
|
|
ABSTRACT
In this paper, we present a modification of the stochastic ruler method for solving discrete stochastic optimization problems. Our method generates a stationary Markov chain sequence taking values in the feasible set of the underlying discrete optimization problem. The number of visits to every state by this Markov chain is used to estimate the optimal solution. Unlike the original stochastic ruler method, our method is guaranteed to converge almost surely to a global optimal solution. We present empirical results that illustrate the performance of our method, and we show that these results compare favorably with empirical results obtained using the original stochastic ruler method.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
Alrefaei, M. H., and S. Andrad6ttir. 1996. A modification of the stochastic ruler method. Working paper.
|
| |
3
|
|
| |
4
|
Andrad6ttir, S. 1996. A global search method for discrete stochastic optimization. To appear in the SIAM Journal on Optimization.
|
| |
5
|
Bechhofer, R. E., T. J. $antner, and D. M. Goldsman. 1995. Design and Analysis of Experiments for Statistical Selection, Screening, and Multiple Comparisons. New York: Wiley.
|
| |
6
|
Fox, B. L., and G. W. Heine. 1995. Probabilistic search with overrides. The Annals of Applied Probability 5:1087-1094.
|
| |
7
|
Gelfand, S. B., and S. K. Mitter. 1989. Simulated annealing with noisy or imprecise energy measuremeats. Journal of Optimization Theory and Applications 62:49-62.
|
| |
8
|
David Goldsman , Barry L. Nelson , Bruce Schmeiser, Methods for selecting the best system, Proceedings of the 23rd conference on Winter simulation, p.177-186, December 08-11, 1991, Phoenix, Arizona, United States
|
| |
9
|
Ho, Y. C., R. S. Sreenivas, and P. Vakili. 1992. Ordinal optimization of DEDS. journal of Discrete Event Dynamical Systems 2:61-88.
|
| |
10
|
Lee, j. 1995. Faster simulated annealing techniques for stochastic optimization problems, with application to queueing network simulation. Ph.D. Thesis, North Carolina State University, Raleigh.
|
| |
11
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|