English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14639636      Online Users : 47
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 工學院  > 工業工程與工程管理學系 > 期刊論文 >  A sum of disjoint products algorithm for reliability evaluation of flow networks

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/46475

    Title: A sum of disjoint products algorithm for reliability evaluation of flow networks
    Authors: Chin-Chia Jane;John Yuan
    教師: 阮約翰
    Date: 2001
    Publisher: Elsevier
    Relation: European Journal of Operational Research, Elsevier, Volume 131, Issue 3, 16 June 2001, Pages 664-675
    Keywords: Reliability
    Flow network
    Combinatorial analysis
    Sum of disjoint products
    Abstract: This paper proposes a revised algorithm to evaluate the unreliability of a flow network in which capacities of arcs are assumed to be independent binary-valued random variables. Such a problem is a generalization of the well-known NP-hard two-terminal reliability problem which evaluates the probability of the connection from a source node to a sink node. The proposed algorithm is motivated by Rueger. Both in a branching manner, the proposed and Rueger’s algorithms express the system unreliability in terms of a sum of disjoint products where each product is derived from a branching condition B via a d-cutB in O(m·log m) time and via the first system failure under B in O(d·n2·2m) time respectively where d is the demand, n and m are the numbers of nodes and arcs in the network respectively. Experimental experiences show that the proposed algorithm drastically reduces the execution time and performs more robustly, when compare to Rueger’s algorithm, but the number of disjoint products derived by it will be a little bit larger.
    URI: http://www.elsevier.com/
    Appears in Collections:[工業工程與工程管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback