Network reliability optimization via the cross-entropy method

IEEE Transactions on Reliability

Volumn 56, Issue 2, 2007, Pages 275-287

  Kroese, Dirk P ^a   Hui, Kin Ping ^b   Nariai, Sho ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b Department of Defence Science and Technology Organisation ^*  (Australia)

Author keywords

Cross entropy method; Merge process; Monte Carlo simulation; Network reliability; Noisy optimization

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL MODELS; MONTE CARLO METHODS; OPTIMIZATION; RELIABILITY;

CROSS-ENTROPY METHOD; NETWORK RELIABILITY;

TELECOMMUNICATION NETWORKS;

EID: 34250336421     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2007.895303     Document Type: Article

References (35)

1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman, 1979.
2. M. Bern and P. Plassman, "The Steiner problem with edge lengths 1 and 2," Information Processing Letters, vol. 32, pp. 171-176, 1989.
3. D. Li, X. L. Sun, and K. McKinnon, "An exact solution method for reliability optimization in complex systems," Annals of Operations Research, vol. 133, pp. 129-144, 2005.
4. C. J. Colbourn, The Combinatorics of Network Reliability. : Oxford University Press, 1987.
5. J. S. Provan and M. O. Ball, "The complexity of counting cuts and of computing the probability that a graph is connected," SIAM Journal of Computing, vol. 12, pp. 777-787, 1982.
6. H. Kumamoto, K. Tanaka, K. Inoue, and E. J. Henley, "Dagger sampling Monte Carlo for system unavailability evaluation," IEEE Transactions on Reliability, vol. R-29, no. 2, pp. 376-380, 1980.
7. G. Fishman, "A Monte Carlo sampling plan for estimating network reliability," Operations Research, vol. 34, no. 4, pp. 581-594, Jul.-Aug. 1986.
8. C. J. Colbourn and D. D. Harms, "Evaluating performability: Most probable states and bounds," Telecommunication Systems, vol. 2, pp. 275-300, 1994.
9. T. Elperin, I. B. Gertsbakh, and M. Lomonosov, "Estimation of network reliability using graph evolution models," IEEE Transactions on Reliability, vol. 40, no. 5, pp. 572-581, Dec. 1991.
10. T. Elperin, I. B. Gertsbakh, and M. Lomonosov, "An evolution model for Monte Carlo estimation of equilibrium network renewal parameters," Probability in the Engineering and Informational Sciences, vol. 6, pp. 457-469, 1992.
11. K.-P. Hui, N. Bean, M. Kraetzl, and D. P. Kroese, "The tree cut and merge algorithm for estimation of network reliability," Probability in the Engineering and Informational Sciences, vol. 17, no. 1, pp. 24-45, 2003.
12. K.-P. Hui, N. Bean, M. Kraetzl, and D. P. Kroese, "Network reliability estimation using the tree cut and merge algorithm with importance sampling," in Proceedings. Fourth International Workshop on Design of Reliable Communication Networks, 2003, pp. 254-262.
13. K.-P. Hui, N. Bean, M. Kraetzl, and D. P. Kroese, "The cross-entropy method for network reliability estimation," Annals of Operations Research, vol. 134, no. 1, pp. 101-118, 2005.
14. W.-C. Yeh, "A new Monte Carlo method for the network reliability," in Proceedings of First International Conference on Information Technologies and Applications (ICITA2002), November 2002.
15. C. Srivaree-Ratana and A. E. Smith, "Estimating all-terminal network reliability using a neural network," in Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics, October 1998, vol. 5, pp. 4734-4740.
16. I. B. Gertsbakh, Statistical Reliability Theory. New York: Marcel Dekker Inc., 1989.
17. H. Cancela and M. E. Urquhart, "Simulated annealing for communication network reliability improvements," in Proceedings of the XXI Latin American Conference On Informatics CLEI-SBC, July 1995.
18. B. Dengiz, F. Altiparmak, and A. E. Smith, "Local search genetic algorithm for optimal design of reliable networks," IEEE Transactions on Evolutionary Computation, vol. 1, no. 3, pp. 179-188, September 1997.
19. Y.-S. Yeh, C. C. Chiu, and R.-S. Chen, "A genetic algorithm for k node set reliability optimization with capacity constraint of a distributed system," Proc. Natl. Sci. Counc. ROC(A), vol. 25, no. 1, pp. 27-34, 2001.
20. D. Reichelt, F. Rothlauf, and P. Bmilkowsky, "Designing reliable communication networks with a genetic algorithm using a repair heuristic," in Evolutionary Computation in Combinatorial Optimization. Heidelberg: Springer-Verlag, 2004.
21. W. Kuo and V. Prasad, "An annotated overview of system-reliability optimization," IEEE Trans. Reliability, pp. 176-187, 2000.
22. R. Y. Rubinstein and D. P. Kroese, "The cross-entropy method: A unified approach to combinatorial optimization," in Monte Carlo Simulation and Machine Learning. New York: Springer Verlag, 2004.
23. R. Y. Rubinstein, "Optimization of computer simulation models with rare events," European Journal of Operations Research, vol. 99, pp. 89-112, 1997.
24. R. Y. Rubinstein, "The simulated entropy method for combinatorial and continuous optimization," Methodology and Computing in Applied Probability, vol. 2, pp. 127-190, 1999
25. R. Y. Rubinstein, "Combinatorial optimisation, cross-entropy, ants and rare events," in Stochastic Optimization: Algorithms and Applications, S. Uryasev and P. M. Pardalos, Eds. : Kluwer, 2001, pp. 304-358.
26. G. Alon, D. P. Kroese, T. Raviv, and R. Y. Rubinstein, "Application of the buffer allocation problem in simulation-based environment," Annals of Operations Research, vol. 134, no. 1, pp. 137-151, 2005.
27. K. Chepuri and T. Homem de Mello, "Solving the vehicle routing problem with stochastic demands using the cross-entropy method," Annals of Operations Research, vol. 134, no. 1, pp. 153-181, 2005.
28. D. P. Bertsekas and J. N. Tsitsiklis, "An analysis of stochastic shortest path problems," Mathematics of Operations Research, vol. 16, pp. 580-595, 1991.
29. P. T. de Boer, D. P. Kroese, S. Mannor, and R. Y. Rubinstein, "A tutorial on the cross-entropy method," Annals of Operations Research vol. 134, no. 1, pp. 19-67, 2005.
30. M. Lomonosov, "On Monte Carlo estimates in network reliability," Probability in the Engineering and Informational Sciences, vol. 8, pp. 245-264, 1994.
31. B. Bollobás, Graph Theory: An Introductory Course. : Springer-Verlag, 1979.
32. G. Chartrand and O. R. Oellermann, Applied and Algorithmic Graph Theory. : McGraw Hill, 1993.
33. L. Margolin, "On the convergence of the cross-entropy method," Annals of Operations Research, vol. 134, no. 1, pp. 201-214, 2005.
34. A. Costa, O. Jones, and D. P. Kroese, "Convergence properties of the cross-entropy method for discrete optimization," Operations Research Letters, 2007, to be published.
35. K.-P. Hui, "Monte Carlo network reliability ranking estimation," IEEE Transactions on Reliability, April 2007.