-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathND.net
48 lines (48 loc) · 1.22 KB
/
ND.net
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
##################################################
# #
# Network ND (Nguyen-Duspuis) #
# linear cost functions as in
# An efficient method for computing traffic equilibria in networks with asymmetric transportation... (1984)
# (table II, symmetric costs)
# #
# Generated on Aug. 13, 2018 #
# #
##################################################
#
function nd (f) a*f+b
node 1
node 2
node 3
node 4
node 5
node 6
node 7
node 8
node 9
node 10
node 11
node 12
node 13
dedge 1to5 1 5 nd 0.0125 7.
dedge 1to12 1 12 nd 0.01 9.
dedge 4to5 4 5 nd 0.01 9.
dedge 4to9 4 9 nd 0.005 12.
dedge 5to6 5 6 nd 0.0075 3.
dedge 5to9 5 9 nd 0.0075 9.
dedge 6to7 6 7 nd 0.0125 5.
dedge 6to10 6 10 nd 0.005 13.
dedge 7to8 7 8 nd 0.0125 5.
dedge 7to11 7 11 nd 0.0125 9.
dedge 8to2 8 2 nd 0.0125 9.
dedge 9to10 9 10 nd 0.005 10.
dedge 9to13 9 13 nd 0.005 9.
dedge 10to11 10 11 nd 0.0025 6.
dedge 11to2 11 2 nd 0.005 9.
dedge 11to3 11 3 nd 0.01 8.
dedge 12to6 12 6 nd 0.0025 7.
dedge 12to8 12 8 nd 0.01 14.
dedge 13to3 13 3 nd 0.01 11.
od 1|2 1 2 400
od 1|3 1 3 800
od 4|2 4 2 600
od 4|3 4 3 200