skip to main content
article

A combined procedure for optimization via simulation

Published:01 April 2003Publication History
Skip Abstract Section

Abstract

We propose an optimization-via-simulation algorithm for use when the performance measure is estimated via a stochastic, discrete-event simulation, and the decision variables may be subject to deterministic linear integer constraints. Our approach---which consists of a global guidance system, a selection-of-the-best procedure, and local improvement---is globally convergent under very mild conditions.

References

  1. Alrefaei, M. H. and Andradóttir, S. 1999. A simulated annealing algorithm with constant temperature for discrete stochastic optimization. Manage. Sci. 45, 748--764. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Andradóttir, S. 1995. A method for discrete stochastic optimization. Manage. Sci. 41, 1946--1961. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Andradóttir, S. 1996. A global search method for discrete stochastic optimization. SIAM J. Optim. 6, 513--530.Google ScholarGoogle ScholarCross RefCross Ref
  4. Andradóttir, S. 1998. Simulation optimization. In Handbook of Simulation. J. Banks, Ed. Wiley, New York.Google ScholarGoogle Scholar
  5. Andradóttir, S. 1999. Accelerating the convergence of random search methods for discrete stochastic optimization. ACM Trans. Model. Comput. Simulat. 9, 349--380. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Boesel, J. 1999. Search and selection for large-scale stochastic optimization. Ph.D. Dissertation, Department of Industrial Engineering and Management Sciences, Northwestern Univ., Evanston, Ill. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Boesel, J., Nelson, B. L., and Ishii, N. 2003a. A framework for simulation-optimization software. IIE Trans. 35, 3, 221--230.Google ScholarGoogle ScholarCross RefCross Ref
  8. Boesel J., Nelson, B. L., and Kim, S.-H. 2003b. Using ranking and selection to 'clean up' after simulation optimization. Oper. Res., forthcoming. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Buzacott, J. A. and Shantikumar, J. G. 1993. Stochastic Models of Manufacturing Systems. Prentice-Hall, Englewood Cliffs, N.J.Google ScholarGoogle Scholar
  10. Fu, M. C. 1994. Optimization via simulation: A review. Ann. Oper. Res. 53, 199--247.Google ScholarGoogle ScholarCross RefCross Ref
  11. Fu, M. C. 2002. Optimization for simulation: Theory vs. practice. INFORMS J. Comput. 14, 192--215. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Gelfand, S. B. and Mitter, S. K. 1989. Simulated annealing with noisy or imprecise energy measurements. J. Optim. Theory Appl. 62, 49--62.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Goldsman, D. and Nelson, B. L. 1998. Comparing systems via simulation. In Handbook of Simulation. J. Banks, Ed. Wiley, New York.Google ScholarGoogle Scholar
  14. Gutjahr, W. J. and Pflug, G. Ch. 1996. Simulated annealing for noisy cost functions. J. Glob. Optimiz. 8, 1--13.Google ScholarGoogle ScholarCross RefCross Ref
  15. Jacobson, S. H. and Schruben, L. W. 1989. Techniques for simulation response optimization. Oper. Res. Lett. 8, 1--9.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Koenig, L. W. and Law, A. M. 1985. A procedure for selecting a subset of size m containing the l best of k independent normal populations, with applications to simulation. Communi. Stat.: Simul. Comput. 14, 719--734.Google ScholarGoogle ScholarCross RefCross Ref
  17. Pichitlamken, J. 2002. A combined procedure for optimization via simulation. Ph.D. Dissertation, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Pichitlamken, J. and Nelson, B. L. 2001. Selection-of-the-best procedures for optimization via simulation. In Proceedings of the 2001 Winter Simulation Conference (Arlington, Va, Dec.) B. A. Peters, J. S. Smith, D. J. Medeiros, and M. W. Rohrer, Eds. IEEE. Piscataway, N.J., 401--407. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Shi, L. and Chen, C.-H. 2000. A new algorithm for stochastic discrete resource allocation optimization. J. Disc. Event Dyn. Syst. 10, 271--294. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Shi, L. and Ólafsson, S. 2000. Nested partitions method for stochastic optimization. Meth. Comput. Appl. Prob. 2, 271--291. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Shi, L., Ólafsson, S., and Chen, Q. 2001. An optimization framework for product design. Manage. Sci. 47, 1681--1692. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Smith R. L. 1984. Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Oper. Res. 32, 1296--1308.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Swisher, J. R., Hyden, P. D., Jacobson, S. H., and Schruben, L. W. 2004. A survey of recent advances in discrete input parameter discrete-event simulation optimization. IIE Trans., forthcoming.Google ScholarGoogle Scholar
  24. Wolsey, L. A. 1998. Integer Programming. Wiley, New York.Google ScholarGoogle Scholar
  25. Yan, D. and Mukai, H. 1992. Stochastic Discrete Optimization. SIAM J. Cont. Optim. 30, 594--612. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A combined procedure for optimization via simulation

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Modeling and Computer Simulation
      ACM Transactions on Modeling and Computer Simulation  Volume 13, Issue 2
      April 2003
      105 pages
      ISSN:1049-3301
      EISSN:1558-1195
      DOI:10.1145/858481
      Issue’s Table of Contents

      Copyright © 2003 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 April 2003
      Published in tomacs Volume 13, Issue 2

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader