By Topic

A New Universal Generating Function Method for Solving the Single (d, \tau ) -Quick-Path Problem in Multistate Flow Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wei-Chang Yeh ; Integration & Collaboration Lab., Univ. of Technol. Sydney, Sydney, NSW, Australia ; El Khadiri, M.

Many real-world multistate systems, including distribution systems and supply chain management systems, can be modeled as multistate flow networks (MFNs). A single quick-path MFN (QMFN) is a special MFN with two characteristics-bandwidth and lead time-in each arc. A (d, τ)-quick path (i.e., (d, τ)-QP) is also a special minimal path (MP) such that d units of data can be sent from the source node to the sink node within τ units of time. The associated QMFN reliability problem evaluates the probability that a (d, τ)-QP exists in a QMFN. All known algorithms for this reliability problem require the advance determination of all MPs, which is an NP-hard problem. A very straightforward and easily programmed algorithm derived from the universal generating function method (UGFM) is suggested to find all (d, τ)-QPs prior to calculating the QMFN reliability, without the necessity of all MPs being known in advance. The correctness of the proposed UGFM is proven, and an analysis of its computational complexity indicates that it is more efficient than known algorithms. An example is provided by way of illustration.

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:42 ,  Issue: 6 )