Annals of Operations Research

, Volume 63, Issue 2, pp 321–336 | Cite as

Heuristic reliability optimization by tabu search

  • Pierre Hansen
  • Keh-Wei Lih
Tabu Search


A new heuristic algorithm, based on the tabu search methodology, is proposed for constrained redundancy optimization in series and in complex systems. It has the advantage of not being blocked as soon as a local optimum is found. Results given by the new method are compared with those of previous heuristics on a series of examples.


Complex System Local Optimum Tabu Search Heuristic Algorithm Reliability Optimization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K.K. Aggarwal, Redundancy optimization in general systems, IEEE Trans. Reliability R-25(1976)330–332.Google Scholar
  2. [2]
    R.L. Bulfin and C.-Y. Liu, Optimal allocation of redundant components for large system, IEEE Trans. Reliability R-34(1985)241–247.Google Scholar
  3. [3]
    M.-S. Chern and R.-H. Jan, Parametric programming applied to reliability optimization problems, IEEE Trans. Reliability R-34(1985)165–170.Google Scholar
  4. [4]
    M.-S. Chern and R.-H. Jan, Reliability optimization problems with multiple constraints, IEEE Trans. Reliability R-35(1986)431–436.Google Scholar
  5. [5]
    P.M. Ghare and R.E. Taylor, Optimal redundancy for reliability in series systems, Oper. Res. 17(1969)838–847.Google Scholar
  6. [6]
    F. Glover and M. Laguna, Tabu search, in:Modern Heuristic Techniques for Combinatorial Problems, ed. C. Reeves (Blackwell Scientific, Oxford, UK, 1992).Google Scholar
  7. [7]
    F. Glover, M. Laguna and D. de Werra, A user's guide to tabu search, Ann. Oper. Res. 41(1993)3–28.CrossRefGoogle Scholar
  8. [8]
    F. Glover, M. Laguna, E. Taillard and D. de Werra (eds.),Annals of Operations Research 41: Tabu Search (J.C. Baltzer, Basel, Switzerland, 1993).Google Scholar
  9. [9]
    F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 13(1986)533–549.CrossRefGoogle Scholar
  10. [10]
    F. Glover, Candidate list strategies and tabu search, Technical Report, Center for Artificial Intelligence, Graduate School of Business, Box 419, University of Colorado, Boulder, CO 80309-0419, USA (1989).Google Scholar
  11. [11]
    F. Glover, Tabu search, Part I, ORSA J. Comp. 1(1989)190–206.Google Scholar
  12. [12]
    F. Glover, Tabu search, Part II, ORSA J. Comp. 2(1990)4–32.Google Scholar
  13. [13]
    K. Gopal, K.K. Aggarwal and J.S. Gupta, A new method for reliability optimization, Microelectr. Reliability 17(1978)605–608.CrossRefGoogle Scholar
  14. [14]
    P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, Computing 44(1990)279–303.MathSciNetGoogle Scholar
  15. [15]
    R.C. Kelahan and J.L. Gaddy, Application of the adaptative random search to discrete and mixed integer optimization, Int. J. Numer. Meth. Eng. 12(1978)289–298.CrossRefGoogle Scholar
  16. [16]
    W. Kuo, C.-L. Hwang and F.A. Tillman, A note on heuristic methods in optimal system reliability, IEEE Trans. Reliability R-27(1978)320–324.Google Scholar
  17. [17]
    R. Luus, Optimization of system reliability by a new nonlinear integer programming procedure, IEEE Trans. Reliability R-24(1975)14–16.Google Scholar
  18. [18]
    H. Mine, Reliability of physical systems, in:Trans. Int. Symp. on Circuit and Information Theory (May 1959) pp. 138–151.Google Scholar
  19. [19]
    R.B. Misra and G. Agnihotri, Pecularities in optimal redundancy for a bridge network, IEEE Trans. Reliability R-28(1979)70–72.Google Scholar
  20. [20]
    V.D. Murty and K.B. Misra, A new heuristic approach for redundancy optimization problems, Microelectr. Reliability 24(1984)1013–1017.CrossRefGoogle Scholar
  21. [21]
    V.D. Murty and K.B. Misra, A fast algorithm for a redundancy optimization problem, Microelectr. Reliability 25(1985)511–523.CrossRefGoogle Scholar
  22. [22]
    V.D. Murty and K.B. Misra, An improved method for a redundancy optimization problem, Microelectr. Reliability 25(1985)93–95.CrossRefGoogle Scholar
  23. [23]
    Y. Nakagawa and S. Miayasaki, An experimental comparison of the heuristic methods for solving reliability optimization problems, IEEE Trans. Reliability R-30(1981)181–184.Google Scholar
  24. [24]
    Y. Nakagawa and K. Nakashima, A heuristic method for determining optimal reliability allocation, IEEE Trans. Reliability R-26(1977)156–161.Google Scholar
  25. [25]
    R. Sasaki, T. Okada and S. Shingai, A new technique to optimize system reliability, IEEE Trans. Reliability R-32(1983)175–182.Google Scholar
  26. [26]
    J. Sharma and K.V. Venkateswaran, A direct method for maximizing the system reliability, IEEE Trans. Reliability R-20(1971)256–259.Google Scholar
  27. [27]
    D. Shi, A new heuristic algorithm for constrained redundancy optimization in complex systems, IEEE Trans. Reliability R-36(1987)621–623.Google Scholar
  28. [28]
    M. Vujosević and D. Meade, Reliability evaluation and optimization of redundant dynamic systems, IEEE Trans. Reliability R-34(1985)171–174.Google Scholar
  29. [20]
    K.M. Yasutake-Baker and E.J. Henley, A heuristic method to upgrade system availability for hot or cold standby, and voting systems, IEEE Trans. Reliability R-34(1985)389–392.Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1996

Authors and Affiliations

  • Pierre Hansen
    • 1
  • Keh-Wei Lih
    • 2
  1. 1.GERAD, Ecole des Hautes Etudes CommercialesMontréalCanada
  2. 2.Bell Communications ResearchRed BankUSA

Personalised recommendations