TY - JOUR
T1 - Reliability optimization of component assignment problem for a multistate network in terms of minimal cuts
AU - Lin, Yi-Kuei
AU - Yeh, Cheng Ta
PY - 2011/2/1
Y1 - 2011/2/1
N2 - A network constructed by arcs and vertices is a useful tool to model a real-life system, such as a computer/communication, an electric power transmission, a transportation, or a logistics system. Network reliability, the probability to satisfy customers' demand, is a common performance index of such a system. From the quality of service viewpoint, the network reliability optimization is an important objective which many enterprises pursue to maintain their customer satisfaction. Combining with the characteristic of assignment problem, this study is mainly to search for the optimal components assignment with maximal network reliability. A set of components is ready to be assigned to the arcs, each component may have several modes, such as failure, maintenance, or partially reserved by other customers, and thus the network according to any component assignment is multistate. A minimal-cut based genetic algorithm is developed to solve such a problem. In order to show the computational efficiency of the proposed algorithm, a simple computer network and a real one are adopted while comparing with the implicit enumeration method and the approach of random solution generation, respectively.
AB - A network constructed by arcs and vertices is a useful tool to model a real-life system, such as a computer/communication, an electric power transmission, a transportation, or a logistics system. Network reliability, the probability to satisfy customers' demand, is a common performance index of such a system. From the quality of service viewpoint, the network reliability optimization is an important objective which many enterprises pursue to maintain their customer satisfaction. Combining with the characteristic of assignment problem, this study is mainly to search for the optimal components assignment with maximal network reliability. A set of components is ready to be assigned to the arcs, each component may have several modes, such as failure, maintenance, or partially reserved by other customers, and thus the network according to any component assignment is multistate. A minimal-cut based genetic algorithm is developed to solve such a problem. In order to show the computational efficiency of the proposed algorithm, a simple computer network and a real one are adopted while comparing with the implicit enumeration method and the approach of random solution generation, respectively.
KW - Component assignment
KW - Genetic algorithm
KW - Minimal cut
KW - Multistate network
KW - Reliability optimization
UR - http://www.scopus.com/inward/record.url?scp=78851470349&partnerID=8YFLogxK
U2 - 10.3934/jimo.2011.7.211
DO - 10.3934/jimo.2011.7.211
M3 - Article
AN - SCOPUS:78851470349
VL - 7
SP - 211
EP - 227
JO - Journal of Industrial and Management Optimization
JF - Journal of Industrial and Management Optimization
SN - 1547-5816
IS - 1
ER -