Skip to main content

Table 1 Summary of optimal PFCP solutions

From: Optimizing facility siting for probabilistic collection and distribution of information in support of urban transportation

Network assignment scenario \(\lambda_{o}\) \(\alpha_{m}\)
0.78 0.82 0.86
MC FC MC FC MC FC
Many OD paths 0.20 6.9 44.5 6.9 43.5 6.9 42.5
0.60 14.7 67.3 17.3 69.3 17.8 68.5
1.0 74.6 100.0 86.3 100.0 88.3 100.0
Moderate OD paths 0.20 9.8 47.6 10.1 43.3 10.1 43.8
0.60 17.7 68.5 21.1 69.8 21.1 70.5
1.0 74.5 100.0 80.9 100.0 83.6 100.0
Few OD paths 0.20 9.9 49.7 10.1 43.0 10.4 42.2
0.60 18.8 70.9 21.2 72.7 21.2 72.6
1.0 53.4 100.0 59.8 100.0 60.7 100.0
  1. Summary of optimal PFCP solutions for the three network flow assignment scenarios and model parameterizations involving different combinations of \(\lambda_{o}\) and \(\alpha_{m}\). MC = % of total system cost, FC = % of total system flow covered