Skip to main content
Log in

A cross entropy based algorithm for reliability problems

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

The Cross Entropy method has recently been applied to combinatorial optimization problems with promising results. This paper proposes a Cross Entropy based algorithm for reliability optimization of complex systems, where one wants to maximize the reliability of a system through optimal allocation of redundant components while respecting a set of budget constraints. We illustrate the effectiveness of the proposed algorithm on two classes of problems, software system reliability optimization and complex network reliability optimization, by testing it on instances from the literature as well as on randomly generated large scale instances. Furthermore, we show how a Cross Entropy-based algorithm can be fine-tuned by using a training scheme based upon the Response Surface Methodology. Computational results show the effectiveness as well as the robustness of the algorithm on different classes of problems.

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.

Institutional subscriptions

Similar content being viewed by others

References

  • Aggarwal, K.K.: Redundancy optimization in general systems. IEEE Trans. Reliab. R-25, 330–332 (1976)

    Google Scholar 

  • Alon, G., Kroese, D., Raviv, T., Rubinstein, R.Y.: Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment. Ann. Oper. Res. 1(134), 137–151 (2005)

    Article  MathSciNet  Google Scholar 

  • Belli, F., Jedrzejowicz, P.: An approach to the reliability optimization of software with redundancy. IEEE Trans. Softw. Eng. 17(3), 310–312 (1991)

    Article  Google Scholar 

  • Berman, O., Ashrafi, N.: Optimization models for reliability of modular software systems. IEEE Trans. Softw. Eng. 19(11), 1119–1123 (1993)

    Article  Google Scholar 

  • Berman, O., Ashrafi, N.: Optimal design of large software-systems using N-version programming. IEEE Trans. Reliab. 43(2), 344 (1994)

    Article  Google Scholar 

  • Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)

    Article  Google Scholar 

  • Chepuri, K., Homem De Mello, T.: Solving the vehicle routing problem with stochastic demands using the cross-entropy method. Ann. Oper. Res. 1(134), 153–181 (2005)

    Article  MathSciNet  Google Scholar 

  • Coit, D.W., Smith, A.E.: Penalty guided genetic search for reliability design optimization. Comput. Ind. Eng. 30(4), 895–904 (1996a)

    Article  Google Scholar 

  • Coit, D.W., Smith, A.E.: Reliability optimization of series-parallel systems using a genetic algorithm. IEEE Trans. Reliab. 45(2), 254–266 (1996b)

    Article  Google Scholar 

  • Crama, Y.: Recognition problems for special classes of polynomials in 0–1 variables. Math. Program. 44, 139–155 (1987)

    Article  MathSciNet  Google Scholar 

  • De Boer, P., Kroese, D.P., Mannor, S., Rubinstein, R.Y.: A tutorial on the cross-entropy method. Ann. Oper. Res. 134(1), 19–67 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  • Dorigo, M., Di Caro, G.: The ant colony optimization meta-heuristic. In: New Ideas in Optimization, pp. 11–32. McGraw-Hill, Cambridge (1999)

    Google Scholar 

  • Feo, T.A., Resende, G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  • Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  • Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)

    MATH  Google Scholar 

  • Hsieh, Y.C.: A linear approximation for redundant reliability problems with multiple component choices. Comput. Ind. Eng. 44, 91–103 (2002)

    Article  Google Scholar 

  • Ilog Cplex 10.0: http://www.ilog.com. ILOG Cplex Component Libraries (2007)

  • Keith, J., Kroese, D.P.: SABRES: sequence alignment by rare event simulation. In: Proceedings of the 2002 Winter Simulation Conference, pp. 320–327, San Diego (2002)

  • Kim, J.H., Yum, B.J.: A heuristic method for solving redundancy optimization problem in complex systems. IEEE Trans. Reliab. 42(4), 572–578 (1993)

    Article  MATH  Google Scholar 

  • Kohda, T., Inoue, K.: A reliability optimization method for complex systems with the criterion of local optimality. IEEE Trans. Reliab. R-31(1), 109–111 (1982)

    Google Scholar 

  • Kuo, W., Prasad, V.R.: An annotated overview of system-reliability optimization. IEEE Trans. Reliab. 49(2), 176–187 (2000)

    Article  Google Scholar 

  • Kuo, W., Prasad, V.R., Tillman, F.A., Hwang, C.: Optimal Reliability Design. Cambridge University Press, Cambridge (2001)

    Google Scholar 

  • Liang, Y.C., Smith, A.E.: An ant colony optimization algorithm for the redundancy allocation problem (RAP). IEEE Trans. Reliab. 53(3), 417–423 (2004)

    Article  Google Scholar 

  • Nakawara, Y., Miyazaki, S.: Surrogate constraints algorithm for reliability optimization problems with two constraints. IEEE Trans. Reliab. R30(2), 175–180 (1981)

    Google Scholar 

  • Ravi, V., Murty, B.S.N., Reddy, P.: Nonequilibrium simulated annealing algorithm applied to reliability optimization of complex systems. IEEE Trans. Reliab. 46(2), 233–239 (1997)

    Article  Google Scholar 

  • Rubinstein, R.Y.: Optimization of computer simulation models with rare events. Eur. J. Oper. Res. 99, 89–112 (1997)

    Article  Google Scholar 

  • Rubinstein, R.Y.: The cross-entropy method for combinatorial and continuous optimization. Methodol. Comput. Appl. Probab. 2, 127–190 (1999)

    Article  Google Scholar 

  • Rubinstein, R.Y.: Combinatorial optimization, cross-entropy, ants and rare events. In: Uryasev, S., Pardalos, P.M. (eds.) Stochastic Optimization: Algorithms and Applications, pp. 304–358. Kluwer, New York (2001)

    Google Scholar 

  • Rubinstein, R.Y.: The cross-entropy method and rare-events for maximal cut and bipartition problems. ACM Trans. Model. Comput. Simul. 12(1), 27–53 (2002)

    Article  Google Scholar 

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

    MATH  Google Scholar 

  • Shi, D.H.: A new heuristic algorithm for constrained redundancy-optimization in complex systems. IEEE Trans. Reliab. R-36(5), 621–623 (1987)

    Article  Google Scholar 

  • You, P.S., Chen, T.C.: An efficient heuristic for series-parallel redundant reliability problems. Comput. Oper. Res. 32(8), 2117–2127 (2005)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marco Caserta.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Caserta, M., Nodar, M.C. A cross entropy based algorithm for reliability problems. J Heuristics 15, 479–501 (2009). https://doi.org/10.1007/s10732-008-9074-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-008-9074-2

Keywords

Navigation