OPTIMIZATION VIA SIMULATION: SOLUTION CONCEPTS, ALGORITHMS, PARALLELCOMPUTING STRATEGIES AND COMMERCIAL SOFTWARE

Authors

  • Gianpaolo Ghiani
  • Pasquale Legato
  • Roberto Musmanno
  • Francesca Vocaturo

DOI:

https://doi.org/10.47839/ijc.3.3.299

Keywords:

Stochastic Systems, Simulation Optimization, Metaheuristics, Parallelization Strategy

Abstract

Simulation optimization (or optimization via simulation) is defined as the optimization of performance measures based on outputs from stochastic simulations. Although several articles on this topic have been published, the literature on optimization via simulation is still in its infancy. In this paper the research in this field is reviewed and some issues that have not received attention so far are highlighted. In particular, a survey of solution methodologies is presented, followed by a critical review of parallel computing strategies and commercial software packages. A particular emphasis is put on problems with discrete decision variables.

References

M. H. Alrefaei and S. Andradottir. 1999. A simulated annealing algorithm with constant temperature for discrete stochastic optimization. Management Science 45, 748-764.

Andradottir, S. 1998. Simulation optimization. Chapter 9 in J. Banks, ed. Handbook of Simulation: Principles, Methodology, Advances, Applications, and Practice. John Wiley & Sons, New York.

April, J., F. Glover, J. Kelly, and M. Laguna. 2001. “Simulation/Optimization using “Real-World” Applications,” in Proceedings of the 2001Winter Simulation Conference, 134-138.

Banks, J., J. S. Carson, B. L. Nelson, D. M. Nicol. 2000. Discrete Event Systems Simulation, 3rd ed. Prentice Hall, Englewood Cliffs, NJ.

Bitron, J. 2000. Optimizing AutoMod Models with Auto-Stat. AutoFlash Monthly Newsletter, AutoSimulations, Inc., Bountiful, UT.

Chen, H. C., C. H. Chen, E. Yucesan. 2000. Computing efforts allocation for ordinal optimization and discrete event simulation. IEEE Transactions on Automatic Control 45 960–964.

M. C. Fu. 1994. Optimization via simulation: A review. Annals of Operations Research 53 199–248.

M. C. Fu. 2002. INFORMS Journal on Computing 14, 3, 192–215.

F. Glover, J. P. Kelly, M. Laguna. 1999. New advances for wedding optimization and simulation. In Proceedings of the 1999 Winter SimulationConference, eds. J.A. Joines, R.R. Barton, K. Kang, and P.A.

Fishwick, 255-260. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.

F. Glover, G. A. Kochenberger (Editors), 2003. Handbook of Metaheuristics, Kluwer, Amsterdam. Glover, F. and M. Laguna. 1997. Tabu Search. Boston: Kluwer Academic.

Law, A.M. and W.D. Kelton. 2000. Simulation Modeling and Analysis, 3rd edition. New York: McGraw-Hill.

Haddock, J. and Mittenhall. 1992. “Simulation Optimization using Simulated Annealing,” Computers and Industrial Engineering, 22, 387-395.

M. Hartmann. An improvement on Paulson's sequential ranking procedure. Sequential Analysis, 7: 363-372, 1988.

M. Hartmann. An improvement on Paulson's procedure for selecting the population with the largest mean from k normal populations with a common unknown variance. Sequential Analysis, 10: 1-16, 1991.

Hochberg, Y. and A.C. Tamhane. 1987. Multiple Comparison Procedures. New York: John Wiley & Sons.

S.-H. Kim and B. L. Nelson. A fully sequential procedure for indifference-zone selection in simulation. ACM Transactions on Modeling and Computer Simulation, 11:251{273, 2001.

Matejcik, F.J. and B.L. Nelson. 1995. “Two-Stage Multiple Comparisons with the Best for Computer Simulation”, Operations Research, 43, 633-640.

Nelson, B. L., J. Swann, D. Goldsman, W. Song. 2001. Simple procedures for selectingthe best simulated system when the number of alternatives is large. Operations Research 49 950–963.

E. Paulson. 1964. A sequential procedure for selecting the population with the largest mean from k normal populations. Annals of Mathematical Statistics, 35:174-180.

Rinott Y. 1978. On two-stage selection procedures and related probability-in-equalities. Communications in Statistics, A7, 799-811.

Shi, L., S. Olafsson. 2000. Nested partitioned method for global optimization. Operations Research 48, 390–407.

Downloads

Published

2014-08-01

How to Cite

Ghiani, G., Legato, P., Musmanno, R., & Vocaturo, F. (2014). OPTIMIZATION VIA SIMULATION: SOLUTION CONCEPTS, ALGORITHMS, PARALLELCOMPUTING STRATEGIES AND COMMERCIAL SOFTWARE. International Journal of Computing, 3(3), 7-12. https://doi.org/10.47839/ijc.3.3.299

Issue

2004, Volume 3, Issue 3

Section

Articles

License

International Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:
•    Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
•    Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
•    Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.