Skip to main content
Log in

A combined procedure for discrete simulation–optimization problems based on the simulated annealing framework

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

This paper addresses the problem of optimizing a function over a finite or countable infinite set of alternatives, whenever the objective function cannot be evaluated exactly, but has to be estimated via simulation. We present an iterative method, based on the simulated annealing framework, for solving such discrete stochastic optimization problems. In the proposed method, we combine the robustness of this metaheuristic method with a statistical procedure for comparing the solutions that are generated. The focus of our work is on devising an effective procedure rather than addressing theoretical issues. In fact, in our opinion, although significant progresses have been made in studying the convergence of a number of simulation–optimization algorithms, at present there is no procedure able to consistently provide good results in a reasonable amount of time. In addition, we present a parallelization strategy for allocating simulation runs on computing resources.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aarts, E.H.L., Van Laarhoven, P.J.M.: Simulated Annealing: Theory and Applications. Kluwer Academic, Boston (1997)

    Google Scholar 

  2. Ahmed, M.A., Alkhamis, T.M.: Simulation-based optimization using simulated annealing with ranking and selection. Comput. Oper. Res. 29, 387–402 (2002)

    Article  MATH  Google Scholar 

  3. Andradóttir, S.: A review of simulation optimization techniques. In: Medeiros, D.J., Watson, E.F., Carson, J.S., Manivannan, M.S. (eds.) Proceedings of the 1998 Winter Simulation Conference, pp. 151–158

  4. Crainic, T.G., Toulouse, M., Gendreau, M.: Towards a taxonomy of parallel tabu search algorithm. INFORMS J. Comput. 9, 61–72 (1997)

    MATH  Google Scholar 

  5. Diekmann, R., Lüling, R., Simon, J.: A general purpose distributed implementation of simulated annealing. In: 4th IEEE Symposium on Parallel and Distributed Processing (1992)

  6. Fu, M.C.: Simulation–optimization. In: Peters, B.A., Smith, J.S., Medeiros, D.J., Rohrer, M.W. (eds.) Proceedings of the 2001 Winter Simulation Conference, pp. 53–61

  7. Hyden, P.D., Jacobson, S.H., Schruben, L.W., Swisher, J.R.: A survey of simulation optimization techniques and procedures. In: Joines, J.A., Barton, R.R., Kang, K., Fishwick, P.A. (eds.) Proceedings of the 2000 Winter Simulation Conference, pp. 119–128

  8. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Boston (1997)

    MATH  Google Scholar 

  9. Goldsman, D., Marshall, W.S.: Ranking and selection for steady-state simulation. In: Joines, J.A., Barton, R.R., Kang, K., Fishwick, P.A. (eds.) Proceedings of the 2000 Winter Simulation Conference, pp. 544–553

  10. Goldsman, D., Nelson, B.L.: Comparing systems via simulation. In: Banks, J. (ed.) Handbook on Simulation. Wiley, New York (1998) (Chap. 8)

    Google Scholar 

  11. Hilliard, M.R., Liepins, G.E.: Genetic algorithms: foundations and applications. Ann. Oper. Res. 21, 31–58 (1989)

    Article  MATH  Google Scholar 

  12. Kelton, W.D., Law, A.M.: Comparing alternative system configurations. In: Simulation Modeling and Analysis. McGraw–Hill, New York (1991) (Chap. 10)

    Google Scholar 

  13. Kim, J., Ólafsson, S.: Towards a framework for black-box simulation optimization. In: Peters, B.A., Smith, J.S., Medeiros, D.J., Rohrer, M.W. (eds.) Proceedings of the 2001 Winter Simulation Conference, pp. 300–306

  14. Kim, J., Ólafsson, S.: Simulation optimization. In: Yücesan, E., Chen, C.-H., Snowdon, J.L., Charnes, J.M. (eds.) Proceedings of the 2002 Winter Simulation Conference, pp. 79–84

  15. Leite, J.P.B., Topping, B.H.V.: Parallel simulated annealing for structural optimization. Comput. Struct. 73, 545–564 (1999)

    Article  MATH  Google Scholar 

  16. Meketon, M.S.: Optimization in simulation: a survey of recents results. In: Thesen, A., Grant, H., Kelton, W.D. (eds.) Proceedings of the 1987 Winter Simulation Conference, pp. 58–67

  17. Rinott, Y.: On two-stage selection procedures and related probability-in-equalities. Commun. Stat. A7, 799–811 (1978)

    Article  MathSciNet  Google Scholar 

  18. Wilcox, R.R.: A table for Rinott’s selection procedure. J. Qual. Technol. 16, 97–100 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gianpaolo Ghiani.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghiani, G., Legato, P., Musmanno, R. et al. A combined procedure for discrete simulation–optimization problems based on the simulated annealing framework. Comput Optim Appl 38, 133–145 (2007). https://doi.org/10.1007/s10589-007-9010-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-007-9010-7

Keywords

Navigation