Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Combinatorial optimization by simulated cross-entropy

  • Reuven Y. Rubinstein
Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_131

INTRODUCTION

Most combinatorial optimization problems, involving optimization of the topologies and configurations of very large-scale systems such as computer communication systems, reliability systems, manufacturing, robotics and traffic systems, are NP-hard problems. Well-known methods for large-scale combinatorial optimization are simulated annealing (Kirkpatrick, Gelatt and Vecchi, 1983; Romejn and Smith, 1994), tabu search (Glover, 1996), and genetic algorithms (Goldberg, 1989). Recent work on combinatorial optimization includes the nested partitioning method of Shi and Olafsson (1998), the stochastic comparison method of Gong, Ho and Zhai (1996), the method of Andradóttir, 1996, the method of Norkin, Pflug and Ruszczyński, (where the classical deterministic branch-and-bound is extended to stochastic problems) and the simulated entropy (SE) method, which is presented below (Rubinstein, 1999).

To find the optimal solution of a combinatorial problem, SE solves a sequence of simple...

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

References

  1. [1]
    Aarts, E. H.L. and Lenstra, J. K. (1997). Local Search in Combinatorial Optimization, Wiley, Chichester, UK.Google Scholar
  2. [2]
    Andradóttir, S. (1996). “A Global Search Method for Discrete Stochastic Optimization,” SIAM Jl. Optimization, 6, 513–530.Google Scholar
  3. [3]
    Glover, F. (1996). “Tabu search,” in Encyclopedia of Operations Research and Management Science, S. I. Gass and C. M. Harris, eds., Kluwer, Norwell, Massachusetts.Google Scholar
  4. [4]
    Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, Reading, Massachusetts.Google Scholar
  5. [5]
    Gong, W. B., Ho, Y. C., and Zhai, W. (1992). “Stochastic Comparison of the Algorithm for Discrete Optimization with Estimation,” Proceedings of the 31st IEEE Conference on Decision and Control, 795–800, Piscataway, New Jersey. Google Scholar
  6. [6]
    Kapur, J. N. and Kesavan, H. K. (1992). Entropy Optimization Principles with Applications, Academic Press, New York.Google Scholar
  7. [7]
    Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P. (1983). “Optimization by simulated annealing,” Science, 220, 671–680.Google Scholar
  8. [8]
    Lieber, D. (1999). “The cross-entropy method for estimating probabilities of rare events,” Ph.D. Dissertation, William Davidson Faculty of Industrial Engineering and Management, Technion, Haifa, Israel.Google Scholar
  9. [9]
    Norkin, W. I., Pflug, G. C., and Ruszczyński, A. (1996). “A Branch and Bound Method for Stochastic Global Optimization.” Working paper, International Institute for Applied System Analysis, WP-96-065, Laxenburg, Austria. Google Scholar
  10. [10]
    Podgaetsky, A. and Rubinstein, R. Y. (1999). “The cross-entropy method in graph partition problems,” Working paper, Faculty of Industrial Engineering, Technion, Haifa, Israel.Google Scholar
  11. [11]
    Romejn, H. E. and Smith, R. L. (1994). “Simulated Annealing for Constrained Global Optimization,” Jl. Global Optimization, 5, 101–126.Google Scholar
  12. [12]
    Rubinstein, R. Y. (1999). “The cross-entropy method for combinatorial optimization,” Methodology and Computing in Applied Probability, 2, 1–48.Google Scholar
  13. [13]
    Rubinstein, R. Y. and Melamed, B. (1998). Efficient Simulation and Modeling, John Wiley, New York.Google Scholar
  14. [14]
    Shi, L. and Olafsson, S. (1998). “Nested Partitioning Method for Global Optimization,” Working paper, Department of Industrial Engineering, University of Wisconsin, Madison.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Reuven Y. Rubinstein
    • 1
  1. 1.TechnionHaifaIsrael