Performance Assessment of a Freight Network with Stochastic Capacities
Algorithm 1
Input: A stochastic-flow network with demand level .
Output: All -minimal paths.
Step 0. Compute min for , min and for .
Step 1. Use the enumeration algorithm to solve all of the feasible flow vectors satisfying conditions (6)-(8), and transform each feasible flow vector into its corresponding d-minimal path candidate by Equation (9). Suppose are all the obtained d-minimal path candidates.
Step 2. Use the comparison method to check whether is a d-minimal path or not.
(2.1) I = Φ (stores the index of each non d-minimal path after checking).
(2.2) For i = 1 to λ and iI.
(2.3) For j = 2 to λ and jI.
(2.4) If xj < xi, xi is not a -minimal path, I = I i and go to (2.7); if xj ≥ xi, xj is not a d-minimal path, I = I j and go to (2.7).
