Discrete optimization via simulation using COMPASS

Operations Research

Volumn 54, Issue 1, 2006, Pages 115-129

  Jeff Hong, L ^a   Nelson, Barry L ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b Northwestern University   (United States)

Author keywords

Programming, stochastic: Adaptive random search; Simulation, design of experiments: Optimization via simulation

Indexed keywords

PROGRAMMING, STOCHASTIC: ADAPTIVE RANDOM SEARCH; SIMULATION, DESIGN OF EXPERIMENTS: OPTIMIZATION VIA SIMULATION;

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; DISCRETE TIME CONTROL SYSTEMS; INTEGER PROGRAMMING; PROBABILITY; PROBLEM SOLVING;

OPTIMIZATION;

EID: 33644525898     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1050.0237     Document Type: Article

References (27)

1. Alrefaei, M. H., S. Andradóttir. 1999. A simulated annealing algorithm with constant temperature for discrete stochastic optimization. Management Sci. 45 748-764.
2. Alrefaei, M. H., S. Andradóttir. 2001. A modification of the stochastic ruler method for discrete stochastic optimization. Eur. J. Oper. Res. 133 160-182.
3. Andradóttir, S. 1995. A method for discrete stochastic optimization. Management Sci. 41 1946-1961.
4. Andradóttir, S. 1996. A global search method for discrete stochastic optimization. SIAM J. Optim. 6 513-530.
5. Andradóttir, S. 1998. Simulation optimization. J. Banks, ed. The Handbook of Simulation. Wiley, New York, 307-334.
6. Andradóttir, S. 1999. Accelerating the convergence of random search methods for discrete stochastic optimization. ACM Trans. Modeling & Comput. Simulation 9 349-380.
7. Andradóttir, S. 2004. Simulation optimization with countably infinite feasible regions: Efficiency and convergence. Working paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA.
8. Billingsley, P. 1995. Probability and Measure. Wiley, New York.
9. Boesel, J., B. L. Nelson, S.-H. Kim. 2003. Using ranking and selection to "clean up" after simulation optimization. Oper. Res. 51 814-825.
10. Chen, C. H., J. Lin, E. Yücesan, S. E. Chick. 2000. Simulation budget allocation for further enhancing the efficiency of ordinal optimization. Discrete Event Dynamic System: Theory Applications 10 251-270.
11. Chen, F., E. Markus, G. Lin, D. Yao. 2002. Inventory-service optimization in configure-to-order systems. Manufacturing Service Oper. Management 4 114-132.
12. Dembo, A., O. Zeitouni. 1998. Large Deviations Techniques and Applications, 2nd ed. Springer-Verlag, New York.
13. Fu, M. C. 2002. Optimization for simulation: Theory vs. practice. INFORMS J. Comput. 14 192-215.
14. Gerencsér, L., S. D. Hill, Z. Vágó. 1999. Optimization over discrete sets via SPSA. Proc. 38th Conf. Decision and Control. 1791-1795.
15. Glasserman, P., Y. Wang. 1998. Leadtime-inventory trade-offs in assemble-to-order systems. Oper. Res. 46 858-871.
16. Glover, F., J. P. Kelly, M. Laguna. 1996. New advances and applications of combining simulation and optimization. Proc. 1996 Winter Simulation Conf. 144-152.
17. Gong, W. B., Y. C. Ho, W. Zhai. 1999. Stochastic comparison algorithm for discrete optimization with estimation. SIAM J. Optim. 10 384-404.
18. Ho, Y. C., C. G. Cassandras, C. H. Chen, L. Y. Dai. 2000. Ordinal optimization and simulation. J. Oper. Res. Soc. 51 490-500.
19. Homem-de-Mello, T. 2000. Monto Carlo methods for discrete stochastic optimization. S. Uryasev, P. M. Pardalos, eds. Stochastic Optimization: Algorithms and Applications. Kluwer Academic Publishers, Boston, MA.
20. Hong, L. J., B. Nelson. 2004. Selecting the best system when the systems are revealed sequentially. Working paper, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
21. Iravani, S. M. R., L. Luangkesorn, D. Simchi-Levi. 2003. On assemble-to-order systems with flexible customers. IIE Trans. 35 389-403.
22. Kleywegt, A., A. Shapiro, T. Homem-de-Mello. 2001. The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12 479-502.
23. Koenig, L. W., A. M. Law. 1985. A procedure for selecting a subset of size m containing the l best of k independent normal populations, with applications to simulation. Comm. in Statist.: Simulation and Comput. 14 719-734.
24. Ólafsson, S., J. Kim. 2002. Simulation optimization. Proc. 2002 Winter Simulation Conf. 79-84.
25. Pichitlamken, J., B. L. Nelson. 2003. A combined procedure for optimization via simulation. ACM Trans. Modeling & Comput. Simulation 13 155-179.
26. Shi, L., S. Ólafsson. 2000. Nested partitions method for stochastic optimization. Methodology and Comput. in Appl. Probab. 2 271-291.
27. Yan, D., H. Mukai. 1992. Stochastic discrete optimization. SIAM J. Control Optim. 30 594-612.