Advances in Operations Research

Research Article

Distributed Approach for Solving Time-Dependent Problems in Multimodal Transport Networks

Table 3

Performance and graph reduction for different instances of the SPP with variable transport modes, number of nodes and arcs.
Transfer graphRelevant graphCPU time
SPP Nodes Arcs Transfers Travels Precalcula. Nodes Arcs % Node Avg. Max.
Instance time (second) reduction
SPP 50 200 19 2000 0.72 15 210 70 0.001 0.001
SPP 100 300 33 3000 1.47 25 570 75 0.012 0.108
SPP 200 600 62 6000 2.13 52 2170 74 0.025 0.656
SPP 500 1500 152 15000 6.33 126 13214 75 0.054 0.342
SPP 1000 3000 376 30000 26.11 304 64376 70 0.248 1.295
SPP 2000 6000 850 60000 102.23 652 243982 67 1.053 3.454
SPP 50 200 26 2000 0.71 16 202 68 0.016 0.176
SPP 100 300 50 3000 1.43 30 711 70 0.013 0.250
SPP 200 600 103 6000 2.62 60 3050 70 0.028 0.193
SPP 500 1500 264 15000 6.87 152 19449 70 0.071 0.624
SPP 1000 3000 493 30000 25.87 307 70617 69 0.178 0.975
SPP 2000 6000 904 60000 100.54 657 247018 67 1.141 4.129
SPP 50 200 35 2000 0.69 17 216 66 0.010 0.160
SPP 100 300 52 3000 1.26 33 824 67 0.014 0.387
SPP 200 600 133 6000 2.35 66 3434 67 0.019 0.278
SPP 500 1500 314 15000 5.80 164 19418 67 0.049 0.677
SPP 1000 3000 654 30000 22.12 320 73765 68 0.149 0.774
SPP 2000 6000 926 60000 99.04 662 250643 67 1.005 3.705