Reliability optimization of component assignment problem for a multistate network in terms of minimal cuts

Yi-Kuei Lin*, Cheng Ta Yeh

*Corresponding author for this work

研究成果: Article同行評審

18 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)211-227
頁數17
期刊Journal of Industrial and Management Optimization
7
發行號1
DOIs
出版狀態Published - 1 二月 2011

指紋 深入研究「Reliability optimization of component assignment problem for a multistate network in terms of minimal cuts」主題。共同形成了獨特的指紋。

引用此