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

Research output: Contribution to journalArticle

18 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)211-227
Number of pages17
JournalJournal of Industrial and Management Optimization
Volume7
Issue number1
DOIs
StatePublished - 1 Feb 2011

Keywords

  • Component assignment
  • Genetic algorithm
  • Minimal cut
  • Multistate network
  • Reliability optimization

Fingerprint Dive into the research topics of 'Reliability optimization of component assignment problem for a multistate network in terms of minimal cuts'. Together they form a unique fingerprint.

Cite this