IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v15y2024i4d10.1007_s13198-022-01848-2.html
   My bibliography  Save this article

Birnbaum importance-based simulated annealing algorithm for solving the component assignment problem of linear connected-(r, s)-out-of-(m, n):F lattice systems

Author

Listed:
  • Taishin Nakamura

    (Tokai University)

  • Isshin Homma

    (Tokyo Metropolitan University)

  • Hisashi Yamamoto

    (Tokyo Metropolitan University)

Abstract

The component assignment problem (CAP) is one of the most important problems in reliability engineering. This paper proposes a Birnbaum importance-based simulated annealing (SA) algorithm for the CAP of linear connected-(r, s)-out-of-(m, n):F lattice systems. Here, the CAP is assigning the components to maximize system reliability, and Birnbaum importance is a measure of the importance of a component assigned at a certain position in the CAP. If the number of components is small, this problem can be solved within an acceptable time by enumerating all solution candidates. However, it is difficult to solve the problem by using this approach with large numbers of components, because the required computational time increases rapidly with the number of components. Based on these factors, we propose an algorithm to solve the CAP of large-sized linear connected-(r, s)-out-of-(m, n):F lattice systems within an acceptable time. We performed numerical experiments to evaluate the effectiveness of combining Birnbaum importance and SA because the proposed algorithm could aid in designing reliable systems.

Suggested Citation

  • Taishin Nakamura & Isshin Homma & Hisashi Yamamoto, 2024. "Birnbaum importance-based simulated annealing algorithm for solving the component assignment problem of linear connected-(r, s)-out-of-(m, n):F lattice systems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(4), pages 1407-1414, April.
    • Handle: RePEc:spr:ijsaem:v:15:y:2024:i:4:d:10.1007_s13198-022-01848-2
    DOI: 10.1007/s13198-022-01848-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-022-01848-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-022-01848-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Cai, Zhiqiang & Si, Shubin & Sun, Shudong & Li, Caitao, 2016. "Optimization of linear consecutive-k-out-of-n system with a Birnbaum importance-based genetic algorithm," Reliability Engineering and System Safety, Elsevier, vol. 152(C), pages 248-258.
    2. Qingzhu Yao & Xiaoyan Zhu & Way Kuo, 2011. "Heuristics for component assignment problems based on the Birnbaum importance," IISE Transactions, Taylor & Francis Journals, vol. 43(9), pages 633-646.
    3. Mingjian Zuo & Way Kuo, 1990. "Design and performance analysis of consecutive‐K‐out‐of‐n structure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 203-230, April.
    4. M. V. Koutras & G. K. Papadopoulos & S. G. Papastavridis, 1994. "Note: Pairwise rearrangements in reliability structures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(5), pages 683-687, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wang, Dan & Si, Shubin & Cai, Zhiqiang & Zhao, Jiangbin, 2021. "Reliability optimization of linear consecutive-k-out-of-n: F systems driven by reconfigurable importance," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    2. Liu, Mingli & Wang, Dan & Si, Shubin, 2023. "Mixed reliability importance-based solving algorithm design for the cost-constrained reliability optimization model," Reliability Engineering and System Safety, Elsevier, vol. 237(C).
    3. Xiaoyan Zhu & Way Kuo, 2014. "Importance measures in reliability and mathematical programming," Annals of Operations Research, Springer, vol. 212(1), pages 241-267, January.
    4. Liu, Mingli & Wang, Dan & Zhao, Jiangbin & Si, Shubin, 2022. "Importance measure construction and solving algorithm oriented to the cost-constrained reliability optimization model," Reliability Engineering and System Safety, Elsevier, vol. 222(C).
    5. Qiu, Siqi & Ming, Xinguo & Sallak, Mohamed & Lu, Jialiang, 2022. "A Birnbaum importance-based two-stage approach for two-type component assignment problems," Reliability Engineering and System Safety, Elsevier, vol. 218(PA).
    6. Ma, Chenyang & Wang, Qiyu & Cai, Zhiqiang & Si, Shubin & Zhao, Jiangbin, 2021. "Component reassignment for reliability optimization of reconfigurable systems considering component degradation," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    7. Qiu, Siqi & Ming, Xinguo, 2020. "An extended Birnbaum importance-based two-stage heuristic for component assignment problems under uncertainty," Reliability Engineering and System Safety, Elsevier, vol. 204(C).
    8. Liu, Mingli & Wang, Dan & Si, Shubin, 2024. "Solving algorithm design for the cost minimization reliability optimization model driven by a novel cost-based importance measure," Reliability Engineering and System Safety, Elsevier, vol. 244(C).
    9. Qingzhu Yao & Xiaoyan Zhu & Way Kuo, 2014. "A Birnbaum-importance based genetic local search algorithm for component assignment problems," Annals of Operations Research, Springer, vol. 212(1), pages 185-200, January.
    10. Fu, Yuqiang & Zhu, Xiaoyan & Ma, Xiaoyang, 2020. "Optimum component reallocation and system replacement maintenance for a used system with increasing minimal repair cost," Reliability Engineering and System Safety, Elsevier, vol. 204(C).
    11. Stathis Chadjiconstantinidis & Markos V. Koutras, 1999. "Measures of component importance for markov chain imbeddable reliability structures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 613-639, September.
    12. Fu, Yuqiang & Yuan, Tao & Zhu, Xiaoyan, 2019. "Importance-measure based methods for component reassignment problem of degrading components," Reliability Engineering and System Safety, Elsevier, vol. 190(C), pages 1-1.
    13. Zhao, Jiangbin & Si, Shubin & Cai, Zhiqiang, 2019. "A multi-objective reliability optimization for reconfigurable systems considering components degradation," Reliability Engineering and System Safety, Elsevier, vol. 183(C), pages 104-115.
    14. Qiu, Siqi & Sallak, Mohamed & Schön, Walter & Ming, Henry X.G., 2018. "Extended LK heuristics for the optimization of linear consecutive-k-out-of-n: F systems considering parametric uncertainty and model uncertainty," Reliability Engineering and System Safety, Elsevier, vol. 175(C), pages 51-61.
    15. Serkan Eryilmaz, 2013. "Component importance for linear consecutive‐ k ‐Out‐of‐ n and m ‐Consecutive‐ k ‐Out‐of‐ n systems with exchangeable components," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 313-320, June.
    16. Si, Shubin & Levitin, Gregory & Dui, Hongyan & Sun, Shudong, 2014. "Importance analysis for reconfigurable systems," Reliability Engineering and System Safety, Elsevier, vol. 126(C), pages 72-80.
    17. Maneckshaw, B. & Mahapatra, G.S., 2024. "Crossover point analysis with Jensen-Shannon divergence lower bound for bi-objective reliability optimization of k-out-of-n system," Reliability Engineering and System Safety, Elsevier, vol. 252(C).
    18. Chia‐Shin Chung & James Flynn, 1997. "A heuristic algorithm for determining replacement policies in k‐out‐of‐n systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 273-286, April.
    19. Endharta, Alfonsus Julanto & Yun, Won Young & Ko, Young Myoung, 2018. "Reliability evaluation of circular k-out-of-n: G balanced systems through minimal path sets," Reliability Engineering and System Safety, Elsevier, vol. 180(C), pages 226-236.
    20. Ma, Chengye & Du, Yongjun & Zhang, Yuchun & Cai, Zhiqiang, 2022. "Marginal and joint failure importance for K-terminal network edges under counting process," Reliability Engineering and System Safety, Elsevier, vol. 223(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:ijsaem:v:15:y:2024:i:4:d:10.1007_s13198-022-01848-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.