Skip to main content
Springer Nature Link
Log in

A Heuristic Algorithm for Constrained Redundancy Optimization in Complex Systems

  • Conference paper
Contemporary Computing (IC3 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 94))

Included in the following conference series:

  • 1177 Accesses

Abstract

In this paper, a new sensitivity factor in respect of minimal cut sets is defined and used to develop an efficient heuristic algorithm for solving the problem of constrained reliability optimization in complex systems. The algorithm is tested on complex system structures from the literature by solving a set of problems (with both linear and nonlinear constraints), with given and randomly generated data. It is observed that, in comparison to the other existing heuristics, our algorithm can be used as an attractive alternative.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Kuo, W., Prasad, V.R., Tillman, F.A., Hwang, C.-L.: Optimal Reliability Design: Fundamentals and Applications. Cambridge University Press, Cambridge (2001)

    Google Scholar 

  2. Coit, D.W.: Cold-standby redundancy optimization for nonrepairable systems. IIE Transactions 33, 471–478 (2001)

    Google Scholar 

  3. Shelokar, P.S., Jayaraman, V.K., Kulkarni, B.D.: Ant algorithm for single and multiobjective reliability optimization problems. Quality and Reliability Engineering International 18, 497–514 (2002)

    Article  Google Scholar 

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

    Article  Google Scholar 

  5. Zhao, R., Liu, B.: Redundancy optimization problems with uncertainty of combining randomness and fuzziness. European Journal of Operational Research 157, 716–735 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  6. Agarwal, M., Gupta, R.: Penalty guided heuristic algorithm for constrained redundancy optimization. Journal of Mathematical Sciences 2, 72–94 (2003)

    MATH  MathSciNet  Google Scholar 

  7. Agarwal, M., Gupta, R.: Penalty function approach in heuristic algorithm for constrained redundancy reliability optimization. IEEE Transactions on Reliability 54, 549–558 (2005)

    Article  Google Scholar 

  8. Ha, C., Kuo, W.: Multi-path approach for reliability-redundancy allocation using a scaling method. Journal of Heuristics 11, 201–217 (2005)

    Article  MATH  Google Scholar 

  9. Maringer, D.: Portfolio Management With Heuristic Optimization. Springer, Netherlands (2005)

    MATH  Google Scholar 

  10. Kohda, T., Inoue, K.: A reliability optimization method for complex sys-tems with the criterion of local optimality. IEEE Transactions on Reliability 31, 109–111 (1982)

    Article  MATH  Google Scholar 

  11. Shi, D.H.: A new heuristic algorithm for constrained redundancy-optimization in complex systems. IEEE Transactions on Reliability 36, 621–623 (1987)

    Article  MATH  Google Scholar 

  12. Kim, J.H., Yum, B.J.: A heuristic method for solving redundancy opti-mization problems in complex systems. IEEE Trans. Reliability 42, 572–578 (1993)

    Article  MATH  Google Scholar 

  13. Agarwal, M., Aggarwal, S.: Constrained redundancy optimization in complex systems: A heuristic approach. Statistical Methods 7, 64–80 (2005)

    MATH  MathSciNet  Google Scholar 

  14. Agarwal, M., Aggarwal, S.: A heuristic reliability optimization algorithm for complex systems based on measures of reliability importance. Journal of the Indian Statistical Association 42, 35–48 (2004)

    MathSciNet  Google Scholar 

  15. Agarwal, M., Aggarwal, S.: Heuristic algorithms for constrained redun-dancy optimization in complex systems based on new measures of importance. OPSEARCH 43, 88–102 (2006)

    MATH  MathSciNet  Google Scholar 

  16. Agarwal, M., Aggarwal, S.: A heuristic 3-neighborhood reliability opti-mization algorithm. In: Rao, M.R., Puri, M.C. (eds.) Operational Research And Its Applications: Recent Trends (APORS 2003), vol. I, pp. 214–222. Allied Publishers Pvt. Ltd, New Delhi (2004)

    Google Scholar 

  17. Agarwal, M., Aggarwal, S.: A 3-neighborhood heuristic algorithm for constrained redundancy optimization in complex systems. International Journal of Performability Engineering 2, 331–340 (2006)

    Google Scholar 

  18. Agarwal, M., Aggarwal, S.: An improved 3-neighborhood heuristic algo-rithm for constrained reliability optimization. International Journal of Material & Structural Reliability 6, 1–11 (2008)

    Google Scholar 

  19. Ha, C., Kuo, W.: Multi-path heuristic for redundancy allocation: the tree heuristic. IEEE Transactions on Reliability 55, 37–43 (2006)

    Article  Google Scholar 

  20. Aven, T., Jensen, U.: Stochastic Models in Reliability. Springer, New York (1999)

    Book  MATH  Google Scholar 

  21. Abraham, J.A.: An improved algorithm for network reliability. IEEE Transactions on Reliability 28, 58–61 (1979)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian National Science Academy, Bahadur Shah Zafar Marg, New Delhi, 110002, India

    Sudhanshu Aggarwal

Authors
  1. Sudhanshu Aggarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Sciences, University of Florida, 32611, Gainesville, FL, USA

    Sanjay Ranka

  2. University of Florida, Gainesville, Fl, USA

    Arunava Banerjee

  3. Department of Computer Science and Engineering, Indian Institute of Technology, 110016, New Delhi, INDIA

    Kanad Kishore Biswas

  4. Computer Science, College of Engineering and Science, Louisiana Tech University, LA 71272, Ruston, USA

    Sumeet Dua

  5. University of Florida, Gainesville, FL, USA

    Prabhat Mishra

  6. Department of Computer Science & Engineering, Indian Institute of Technology, 208016, Kanpur, India

    Rajat Moona

  7. National Tsing Hua University, Hsin-Chu, Taiwan, R.O.C.

    Sheung-Hung Poon

  8. Department of Computer Science, The University of Hong Kong, Pokfulam Road, Hong Kong

    Cho-Li Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aggarwal, S. (2010). A Heuristic Algorithm for Constrained Redundancy Optimization in Complex Systems. In: Ranka, S., et al. Contemporary Computing. IC3 2010. Communications in Computer and Information Science, vol 94. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14834-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14834-7_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14833-0

  • Online ISBN: 978-3-642-14834-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics