Application of the Cross-Entropy Method to the Buffer Allocation Problem in a Simulation-Based Environment
暂无分享,去创建一个
[1] Ijbf Ivo Adan,et al. Monotonicity of the throughput in single server production and assembly networks with respect to the buffer sizes , 1987 .
[2] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[3] J. Shanthikumar,et al. Concavity of the throughput of tandem queueing systems with finite buffer storage space , 1990, Advances in Applied Probability.
[4] John A. Buzacott,et al. Stochastic models of manufacturing systems , 1993 .
[5] H. T. Papadopoulos,et al. The throughput rate of multistation reliable production lines , 1993 .
[6] Donald F. Towsley,et al. Equivalence, reversibility, symmetry and concavity properties in fork-join queuing networks with blocking , 1994, JACM.
[7] David D. Yao,et al. Structured buffer-allocation problems , 1996, Discret. Event Dyn. Syst..
[8] Reuven Y. Rubinstein,et al. Optimization of computer simulation models with rare events , 1997 .
[9] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[10] H. T. Papadopoulos,et al. A model management system (MMS) for the design and operation of production lines , 1997 .
[11] George A. Vouros,et al. Buffer allocation in unreliable production lines using a knowledge based system , 1998, Comput. Oper. Res..
[12] Marco Dorigo,et al. AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..
[13] Reuven Y. Rubinstein,et al. Modern simulation and modeling , 1998 .
[14] R. Rubinstein. The Cross-Entropy Method for Combinatorial and Continuous Optimization , 1999 .
[15] Leyuan Shi,et al. New parallel randomized algorithms for the traveling salesman problem , 1999, Comput. Oper. Res..
[16] Stanley B. Gershwin,et al. Efficient algorithms for buffer space allocation , 2000, Ann. Oper. Res..
[17] Walter J. Gutjahr,et al. A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..
[18] Leyuan Shi,et al. Nested Partitions Method for Global Optimization , 2000, Oper. Res..
[19] Diomidis Spinellis,et al. A simulated annealing approach for buffer allocation in reliable production lines , 2000, Ann. Oper. Res..
[20] Bjarne E. Helvik,et al. Using the Cross-Entropy Method to Guide/Govern Mobile Agent's Path Finding in Networks , 2001, MATA.
[21] R. Rubinstein. Combinatorial Optimization, Cross-Entropy, Ants and Rare Events , 2001 .
[22] Dirk P. Kroese,et al. Sequence alignment by rare event simulation , 2002, Proceedings of the Winter Simulation Conference.
[23] Reuven Y. Rubinstein,et al. Cross-entropy and rare events for maximal cut and partition problems , 2002, TOMC.
[24] C.. The throughput rate of multistation unreliable production lines , 2003 .
[25] W. Gutjahr. A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC , 2003, Probability in the Engineering and Informational Sciences.
[26] Dirk P. Kroese,et al. The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning , 2004 .
[27] Dirk P. Kroese,et al. The Cross Entropy Method: A Unified Approach To Combinatorial Optimization, Monte-carlo Simulation (Information Science and Statistics) , 2004 .