SpringerPlus

Table 1 Transit times and fuzzy capacities for network G

From: Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities

t	\(\tilde{u}\), b
t	\(\tilde{u}(1,3,t)\)	\(b(1,3,t)\)	\(\tilde{u}(2,5,t)\)	\(b(2,5,t)\)	\(\tilde{u}(2,6,t)\)	\(b(2,6,t)\)	\(\tilde{u}(3,5,t)\)	\(\,\,b(3,5,t)\)
0	(1, 2, 3, 4; 0.5)	1	(2, 3, 4, 5; 0.4)	1	(2, 3, 4, 6; 0.3)	1	(2, 3, 5, 6; 0.6)	3
1	(2, 3, 4, 5; 0.6)	1	(2, 4, 6, 8; 0.3)	2	(1, 2, 3, 4; 0.4)	1	(1, 3, 5, 6; 0.5)	2
2	(1, 3, 5, 7; 0.5)	2	(1, 3, 4, 5; 0.3)	2	(2, 3, 5, 7; 0.4)	2	(2, 4, 5, 7; 0.7)	1
3	(2, 4, 6, 8; 0.4)	2	(2, 3, 4, 6; 0.5)	1	(1, 3, 4, 6; 0.4)	2	(2, 4, 6, 8; 0.6)	2
4	(1, 2, 3, 4; 0.5)	3	(1, 4, 5, 7; 0.6)	3	(2, 3, 5, 6; 0.3)	2	(3, 4, 5, 7; 0.6)	2
5	(1, 2, 3, 5; 0.6)	2	(2, 5, 6, 8; 0.5)	4	(3, 4, 5, 6; 0.3)	3	(2, 3, 4, 7; 0.5)	2
6	(3, 4, 5, 7; 0.5)	3	(1, 3, 5, 7; 0.4)	3	(2, 3, 5, 7; 0.5)	3	(1, 2, 3, 4; 0.6)	3

t	\(\tilde{u}\), b
t	\(\tilde{u}(3,6,t)\)	\(b(3,6,t)\)	\(\tilde{u}(4,5,t)\)	\(b(4,5,t)\)	\(\tilde{u}(4,6,t)\)	\(b(4,6,t)\)	\(\tilde{u}(6,5,t)\)	\(\,\,b(6,5,t)\)
0	(2, 3, 6, 7; 0.4)	3	(3, 4, 5, 6; 0.4)	4	(1, 2, 3, 4; 0.4)	3	(1, 3, 4, 6; 0.6)	4
1	(2, 4, 5, 6; 0.5)	3	(3, 5, 6, 7; 0.4)	3	(2, 3, 4, 6; 0.4)	3	(2, 3, 4, 5; 0.6)	4
2	(2, 4, 6, 8; 0.6)	4	(2, 3, 6, 8; 0.6)	2	(2, 4, 5, 7; 0.3)	2	(1, 4, 5, 7; 0.6)	3
3	(2, 3, 4, 5; 0.6)	2	(2, 4, 6, 7; 0.6)	2	(3, 4, 5, 7; 0.6)	2	(2, 4, 5, 7; 0.7)	2
4	(1, 2, 3, 4; 0.6)	2	(3, 5, 6, 8; 0.7)	2	(3, 5, 6, 7; 0.6)	2	(1, 3, 5, 6; 0.7)	2
5	(2, 4, 6, 8; 0.4)	2	(3, 5, 7, 9; 0.7)	1	(2, 4, 6, 8; 0.4)	2	(3, 4, 6, 7; 0.6)	2
6	(1, 2, 3, 4; 0.6)	1	(1, 3, 4, 7; 0.6)	3	(3, 4, 7, 8; 0.5)	4	(2, 4, 6, 8; 0.6)	2

Back to article page