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

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 c...

Full description

Saved in:
Bibliographic Details
Published in:International journal of system assurance engineering and management Vol. 15; no. 4; pp. 1407 - 1414
Main Authors: Nakamura, Taishin, Homma, Isshin, Yamamoto, Hisashi
Format: Journal Article
Language:English
Published: New Delhi Springer India 01.04.2024
Springer Nature B.V
Subjects:
Algorithms
Assignment problem
Cameras
Computing time
Engineering
Engineering Economics
Experiments
Failure
Genetic algorithms
Logistics
Marketing
Organization
Original Article
Quality Control
Reliability
Reliability engineering
Safety and Risk
Simulated annealing
Surveillance
System reliability
 
Birnbaum importance
out-of-
F lattice system
Simulated annealing
Linear connected-
Component assignment problem
ISSN:0975-6809, 0976-4348
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0975-6809
0976-4348
DOI:10.1007/s13198-022-01848-2