By Topic

Search for All Minimal Paths in a General Large Flow Network

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
$33 $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)
Shin-Guang Chen ; Department of Industrial Engineering and Management, Tungnan University, New Taipei City, Taiwan ; Yi-Kuei Lin

An active research field is the evaluation of the reliability of a complex network. The most popular methods for such evaluation often use Minimal Paths (MP) or Minimal Cuts (MC) of the network. Although there are many algorithms developed to search for MP or MC, most of them are inefficient for searching a large network due to the combinatorial explosion problem. Another disadvantage is that the existing algorithms are applicable to specific counts of source and sink nodes (e.g., one-to-one, one-to-many, and so on). This article proposes a novel approach to search for all MP in a general flow network. The term “general” means that the approach can be used to search for all MP with multi-sources, multi-sinks in the network. The edges can be directed, undirected, or hybrid (mixed with directed and undirected arcs). Some benchmarks from the well-known algorithms in the literature are examined and compared. Moreover, the comprehensive tests are also performed with the grid networks, as well as the well-known networks in the literature to show the efficiency of the approach. A sample code is provided in the article for quick validation.

Published in:

IEEE Transactions on Reliability  (Volume:61 ,  Issue: 4 )