Computers and Operations Research
Information Processing Letters
The all-pairs quickest path problem
Information Processing Letters
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
Computers and Operations Research
Minimum time paths in a network with mixed time constraints
Computers and Operations Research
A heuristic technique for generating minimal path and cutsets of a general network
Computers and Industrial Engineering
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Computers and Operations Research
A label-setting algorithm for finding a quickest path
Computers and Operations Research
An algorithm for ranking quickest simple paths
Computers and Operations Research
Reliability Evaluation for an Information Network With Node Failure Under Cost Constraint
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
An algorithm for the quickest path problem
Operations Research Letters
| Hi-index | 0.00 |
The quickest path (QP) problem is to find a path which sends a given amount of data from the source to the sink such that the transmission time is minimized. Two attributes are involved, namely, the capacity and the lead time. The capacity of each arc is assumed to be deterministic. However, in many real-life flow networks such as computer systems, telecommunication systems, etc., the capacity of each arc should be stochastic due to failure, maintenance, etc. Such a network is named a stochastic-flow network. Hence, the minimum transmission time is not a fixed number. We modify the QP problem to a stochastic case. The new problem is to evaluate the probability that d units of data can be sent from the source to the sink under both time T and budget B constraints. Such a probability is named the system reliability. In particular, the data can be transmitted through two disjoint minimal paths (MPs) simultaneously. A simple algorithm is proposed to generate all (d, T, B)-QPs, and the system reliability can subsequently be computed. The optimal pair of MPs with highest system reliability could further be obtained.