Skip to main content
SpringerLink
Log in

A corridor method based hybrid algorithm for redundancy allocation

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

In this paper a hybrid algorithm for the redundancy allocation problem is presented. The problem is the allocation of redundant components within series-parallel systems. We present an algorithm that deals with the classical formulation, where at least one component per subsystem must be included in the final configuration, as well as the \(k\)-out-of-\(n\) formulation, in which at least \(k\) components per subsystem must be included in the final network configuration. We propose a three-phase scheme in which the cross entropy method, the corridor method and a dynamic programming-based scheme are effectively intertwined. Computational results on well-known benchmark instances as well as on randomly generated large scale instances are presented, proving the effectiveness and robustness of the proposed algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Altiparmak, F., Dengiz, B., Smith, A.E.: Optimal design of reliable computer networks: a comparison of metaheuristics. J. Heuristics 9, 471–487 (2003)

    Article  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.: Optimal design of large software-systems using N-version programming. IEEE Trans. Reliab. 43(2), 344–350 (1994)

    Article  Google Scholar 

  • Billionnet, A.: Redundancy allocation for series-parallel systems using integer linear programming. IEEE Trans. Reliab. 57(3), 507–516 (2008)

    Article  MathSciNet  Google Scholar 

  • Bulfin, R.L., Liu, C.Y.: Optimal allocation of redundancy components for large systems. IEEE Trans. Reliab. R–34(3), 241–247 (1985)

    Article  MATH  Google Scholar 

  • Caserta, M., Márquez, A.: Tabu search-based metaheuristic algorithm for software system reliability problems. Comput. Operat. Res. 36(3), 811–822 (2009)

    Article  MATH  Google Scholar 

  • Caserta, M., Quiñonez, E.: A Cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times. Comput. Operat. Res. 36, 530–548 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  • Caserta, M., Voß, S.: Corridor selection and fine tuning for the corridor method. Lect. Notes Comput. Sci. 5851, 163–175 (2009)

    Article  Google Scholar 

  • Caserta, M., Voß, S.: A discrete-binary transformation of the reliability redundancy allocation problem. Technical report, University of Hamburg, Institute of Information Systems, (2011)

  • Caserta, M., Voß, S.: A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing. Ann. Math. Artif. Intell. 69, 207–224 (2013a)

  • Caserta, M., Voß, S.: An exact algorithm for the reliability redundancy allocation problem. Technical report, University of Hamburg, Institute of Information Systems, (2013b)

  • Caserta, M., Voß, S., Sniedovich, M.: Applying the corridor method to a blocks relocation problem. OR Spectr 33, 915–929 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  • Chern, M.-S.: On the computational complexity of reliability redundancy allocation in a series system. Oper. Res. Lett. 11, 309–315 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  • Coit, D.W., Konak, A.: Multiple weighted objectives heuristic for the redundancy allocation problem. IEEE Trans. Reliab. 55(3), 551–558 (2006)

    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 (1996)

    Article  Google Scholar 

  • Coit, D.W., Liu, J.: System reliability optimization with k-out-of-n subsystems. Int. J. Reliab. Qual. Saf. Eng. 7(02), 129–142 (2000)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Deeter, D.E., Smith, A.E.: Economic design of reliable networks. IIE Trans. 30, 1161–1174 (1998)

  • Fréville, A.: The multidimensional 0–1 knapsack problem: an overview. Eur. J. Oper. Res. 155(1), 1–21 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  • Ha, C., Kuo, W.: Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems. Eur. J. Oper. Res. 127, 24–38 (2006)

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

    Article  Google Scholar 

  • Kim, H.G., Bae, C.O., Park, D.J.: Reliability redundancy optimization using simulated annealing algorithms. J. Qual. Maint. Eng. 12(4), 354–363 (2006)

    Article  Google Scholar 

  • Kulturel-Konak, S., Smith, A.E., Coit, D.W.: Efficiently solving the redundancy allocation problem using tabu search. IIE Trans. 35(6), 515–526 (2003)

  • 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, New York (2001)

    Google Scholar 

  • Kuo, W., Wan, R.: Recent advances in optimal reliability allocation. IEEE Trans. Syst. Man Cybern. A 37(2), 143–156 (2007)

    Article  Google Scholar 

  • Liang, Y.-C., Chen, Y.-C.: Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm. Reliab. Eng. Syst. Saf 92(3), 323–331 (2007)

    Article  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 

  • Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)

    MATH  Google Scholar 

  • Nahas, N., Nourelfath, M., Ait-Kadi, D.: Coupling ant colony and the degraded ceiling algorithm for the redundancy allocation problem of series-parallel systems. Reliab. Eng. Syst. Saf. 92(2), 211–222 (2007)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Ng, K.Y., Sancho, N.G.: A hybrid dynamic programming/depth first search algorithm, with an application to redundancy allocation. IIE Trans. 33, 1047–1058 (2001)

    Google Scholar 

  • Onishi, J., Kimura, S., James, R.J., Nakagawa, Y.: Solving the redundancy allocation problem with a mix of components using the improved surrogate constraint method. IEEE Trans. Reliab. 56(1), 94–101 (2007)

    Article  Google Scholar 

  • Ouzineb, M., Nourelfath, M., Gendreau, M.: An efficient heuristic for reliability design optimization problems. Comput. Oper. Res. 37, 223–235 (2010)

  • Painton, L., Campbell, J.: Genetic algorithms in optimization of system reliability. IEEE Trans. Reliab. 44, 172–178 (1995)

    Article  Google Scholar 

  • Ramirez-Marquez, J.E., Coit, D.W., Konak, A.: Redundancy allocation for series-parallel systems using a max-min approach. IIE Trans. 36, 891–898 (2004)

    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, New York (2004)

    Book  MATH  Google Scholar 

  • Sadjani, S.J., Soltani, R.: An efficient heuristic versus a robust hybrid metaheuristic for general framework of serial-parallel redundancy problem. Reliab. Eng. Syst. Saf. 94(11), 1703–1710 (2009)

    Article  Google Scholar 

  • Sniedovich, M., Voß, S.: The corridor method: a dynamic programming inspired metaheuristic. Control Cybern. 35(3), 551–578 (2006)

    MathSciNet  MATH  Google Scholar 

  • Taillard, E., Voß, S.: POPMUSIC—Partial Optimization Metaheuristic Under Special Intensification Conditions. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 613–629. Kluwer, Boston (2002)

    Chapter  Google Scholar 

  • Tavakkoli-Moghaddam, R., Safari, J., Sassani, F.: Reliability optimization of series-parallel systems with a choice of redundancy strategies using a genetic algorithm. Reliab. Eng. Syst. Saf. 93(4), 550–556 (2008)

    Article  Google Scholar 

  • Twum, S.B., Aspinwall, E.: Models in design for reliability optimisation. Am. J. Sci. Ind. Res. 4(1), 95–110 (2013)

    Google Scholar 

  • Yalaoui, A., Châtelet, E., Chu, C.: A new dynamic programming method for reliability & redundancy allocation in a parallel-series system. IEEE Trans. Reliab. 54(2), 254–261 (2005)

    Article  Google Scholar 

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

Download references

Author information

Authors and Affiliations

  1. IE Business School, Maria de Molina 12, 28006, Madrid, Spain

    Marco Caserta

  2. Institute of Information Systems, University of Hamburg, Von-Melle-Park 5, 20146, Hamburg, Germany

    Stefan Voß

  3. Escuela de Ingeniera Industrial, Pontificia Universidad Católica de Valparaíso, Valparaiso, Chile

    Stefan Voß

Authors
  1. Marco Caserta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Voß
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Voß.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Caserta, M., Voß, S. A corridor method based hybrid algorithm for redundancy allocation. J Heuristics 22, 405–429 (2016). https://doi.org/10.1007/s10732-014-9265-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-014-9265-y

Keywords

Search

Navigation