Application of the Cross-Entropy Method to the Buffer Allocation Problem in a Simulation-Based Environment

• Adan, I. and J. van der Wal. (1989). “Monotonicity of the Throughput in Single Server Production and Assembly Networks with Respect to the Buffer Sizes. In H.G. Perros and T. Altiok (eds.), Queueing Networks with Blocking, Elsevier Science, pp. 345–356.

• Buzacott, J.A. and J. G. Shanthikumar. (1993). Stochastic Models of Manufacturing Systems. Prentice-Hall.

• Caro, G.D. and M. Dorigo. (1998). “AntNet: Distributed Stigmergetic Control for Communications Networks.” Journal of Artificial Intelligence Research 9, 317–365.

  Google Scholar 

• Dallery, Y., Z. Liu, and D. Towsley. (1994). “Equivalence, Reversibility, Symmetry and Concavity Properties in Fork/Join Queueing Networks with Blocking.” Journal of the ACM 41(5), 903–942.

  Article  Google Scholar 

• Dorigo, M. and L.M. Gambardella. (1997). “Ant Colony Systems: A Cooperative Learning Approach to the Travelling Salesman Problem.” IEEE Transactions on Evolutionary Computation 1(1), 53–66.

  Article  Google Scholar 

• Gershwin, S.B. and J.E. Schor. (2000). “Efficient Algorithms for Buffer Space Allocation.” Annals of Operations Research 93, 117–144.

  Article  Google Scholar 

• Glasserman, P. and D.D. Yao. (1996). “Structured Buffer-Allocation Problems.” Journal of Discrete Event Dynamic Systems 6, 9–42.

  Article  Google Scholar 

• Glover, F. and M. Laguna. (1993). Modern Heuristic Techniques for Combinatorial Optimization, chapter Chapter 3: Tabu Search. Blackwell Scientific Publications.

• Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley.

• Gutjahr, W.J. (2000a). “A Generalized Convergence Result for the Graph-Based ant System Meta-Heuristic.” Technical Report 91-016, Dept. of Statistics and Decision Support Systems, University of Vienna, Austria.

• Gutjahr, W.J. (2000b). “A Graph-Based ant System and its Convergence.” Future Generations Computing 16, 873–888.

  Article  Google Scholar 

• Heavy, C., H.Y. Papadopoulos, and J. Browne. (1993). “The Throughput Rate of Multistation Unreliable Production Lines.” European Journal of Operation Research 68, 69–89.

  Article  Google Scholar 

• Helvik, B.E. and O. Wittner. (2001). “Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks. ” In 3rd International Workshop on Mobile Agents for Telecommunication Applications - MATA’01.

• Keith, J. and D.P. Kroese. (2002). “Sequence Alignment by Rare Event Simulation.” In Proceedings of the 2002 Winter Simulation Conference. San Diego, pp. 320–327.

• Lieber, D. (1998). “Rare-Events Etimation via Cross-Entropy and Importance Sampling.” Ph.D. thesis, William Davidson Faculty of Industrial Engineering and Management, Technion, Haifa, Israel.

• Margolin, L. (2002). “Cross-Entropy Method for Combinatorial Optimization.” Master’s thesis, The Technion, Israel Institute of Technology, Haifa.

• Meester, L.E. and J.G. Shanthikumar. (1990). “Concavity of the Throughput of Tandem Queueing Systems with Finite Buffer Storage Space.” Advances in Applied Probability 22, 764–767.

  Article  Google Scholar 

• Papadopoulos, H.T. and G.A. Vouros. (1997). “A Model Management System (MMS) for the Design and Operation of Production Lines.” International Journal of production Research 35(8), 2213–2236.

  Article  Google Scholar 

• Rubinstein, R.Y. (1997). “Optimization of Computer Simulation Models with Rare Events.” European Journal of Operational Research 99, 89–112.

  Article  Google Scholar 

• Rubinstein, R.Y. (1999). “The Cross-Entropy Method for Combinatorial and Continuous Optimization.” Methodology and Computing in Applied Probability 2, 127–190.

  Article  Google Scholar 

• Rubinstein, R.Y. (2001). “Combinatorial Optimization, Cross-Entropy, Ants and Rare Events.” In S. Uryasev and P.M. Pardalos (eds.), Stochastic Optimization: Algorithms and Applications, Kluwer, pp. 304–358.

• Rubinstein, R.Y. (2002). “The Cross-Entropy Method and Rare-Events for Maximal Cut and Bipartition Problems.” ACM Transactions on Modelling and Computer Simulation 12(1), 27–53.

  Article  Google Scholar 

• Rubinstein, R.Y. and D.P. Kroese. (2004). The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning, Springer-Verlag, New York.

  Google Scholar 

• Rubinstein, R.Y. and B. Melamed. (1998). Modern Simulation and Modeling. Wiley series in probability and Statistics.

• Shanthikumar, J.G. and D.D. Yao. (1989). “Monotonicity and Concavity Properties in Cyclic Queueing Networks with Finite Buffers.” In H. Perros and T. Altiok, (eds.), Queueing Networks with Blocking, Elsevier Science, pp. 325–344.

• Shi, L. and S. Olafsson. (2000). “Nested Partitioning Method for Global Optimization.” Operations Research 48(3), 390–407.

  Article  Google Scholar 

• Shi, L., S. Olafsson, and N. Sun. (1999). “New Parallel Randomized Algorithm for Traveling Salesman Problem.” Computers and Operations Research 26, 371–394.

  Article  Google Scholar 

• Spinellis, D.D. and H.T. Papadopoulos. (2002). “Production Line Buffer Allocation: Genetic Algorithms Versus Simulated Annealing.” Annals of OR 93(1), 373–384.

  Article  Google Scholar 

• Vouros, G.A. and H.T. Papadopoulos. (1998). “Buffer Allocation in Unreliable Production Lines Using a Knowledge Based System.” Computer & Operation Research 25(12), 1055–1067.

  Article  Google Scholar 

Download references