Table 1.
Literature on transportation network restoration.
Fig 1.
The workflow in this study.
Table 2.
Pseudocode for the GA.
Fig 2.
Solution representation.
Fig 3.
Crossover operation.
Fig 4.
Mutation operation.
Fig 5.
Six-node network.
Fig 6.
Nguyen–dupuis network.
Table 3.
Parameter settings in the metaheuristic algorithms.
Table 4.
Information about disrupted links.
Table 5.
Results of disrupted links.
Table 6.
Restoration results for the three strategies.
Fig 7.
Comparison of total travel time and total restoration duration.
Table 7.
Information about disrupted links of the Nguyue–Dupuis network.
Table 8.
Comparison between the GA and the other methods.
Fig 8.
Performance of the three algorithms.
Table 9.
Optimal restoration results under different confidence levels.
Fig 9.
Impact of the confidence level on the CVaR-R value.
Fig 10.
Changes in the network performance under different confidence levels.
Table 10.
Optimal restoration results under different demand levels.
Fig 11.
Changes in the network performance under different demand levels.
Table 11.
Optimal restoration results under different resource levels.
Fig 12.
Impact of the resource level on the CVaR-R value.
Fig 13.
Changes in the network performance under different resource levels.