Table 2 Calculation of optimal solution for example 1
From: Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities
Vertex | \(P,T,\xi\) | Vertex | \(P,T,\xi\) | ||||
|---|---|---|---|---|---|---|---|
Path | Time | \(\xi (P)\) | Path | Time | \(\xi (P)\) | ||
1 | P(1) | 0 | \(\infty\) | 7 | P(1–2–5–7) | 6 | (2, 3, 4, 5; 0.2) |
2 | P(1–2) | 1 | (5, 6, 7, 8; 0.5) | 8 | P(1–2) | 1 | (5, 6, 7, 8; 0.5) |
3 | P(1–3) | 1 | (1, 2, 3, 4; 0.2) | 9 | P(1–2–5–9) | 6 | (5, 6, 7, 8; 0.5) |
4 | P(1–2–4) | 3 | (2, 3, 4, 5; 0.2) | 10 | P(1–2–5–8–10) | 10 | (1, 2, 3, 4; 0.7) |
5 | P(1–2–5) | 3 | (5, 6, 7, 8; 0.5) | 11 | P(1–2–5–8–11) | 1 | (5, 6, 7, 8; 0.5) |
6 | P(1–3–6) | 3 | (1, 2, 3, 4; 0.2) | 12 | P(1–2–5–8–11–12) | 15 | (5, 6, 7, 8; 0.5) |