Identifying Achillesheel roads in realsized networks
Abstract
Ensuring a minimum operational level of road networks in the presence of unexpected incidents is becoming a hot subject in academic circles as well as industry. To this end, it is important to understand the degree to which each single element of the network contributes to the operation and performance of a network. In other words, a road can become an “Achillesheel” for the entire network if it is closed due to a simple incident. Such insight of the detrimental loss of the closure of the roads would help us to be more vigilant and prepared. In this study, we develop an index dubbed as Achillesheel index to quantify detrimental loss of the closure of the respective roads. More precisely, the Achillesheel index indicates how many drivers are affected by the closure of the respective roads (the number of affected drivers is also called travel demand coverage). To this end, roads with maximum travel demand coverage are sorted as the most critical ones, for which a method—known as “link analysis”—is adopted. In an iterative process, first, a road with highest traffic volume is first labeled as “target link,” and second, a portion of travel demand which is captured by the target link is excluded from travel demand. For the next iteration, the trimmed travel demand is then assigned to the network where all links including the target links run on the initial travel times. The process carries on until all links are labeled. The proposed methodology is applied to a largesized network of Winnipeg, Canada. The results shed light on also bottleneck points of the network which may warrant provision of additional capacity or parallel roads.
Keywords
Critical roads Achillesheel roads Sensor location problem Flowbundle Link analysis1 Introduction
Unexpected traffic disruptions and reliability consequences have made academia and the industry more interested in subjects such as resilience, reliability, vulnerability; flexibility, robustness, fragility and critical roads [1]. Although these concepts are yet to be unambiguously defined [2], each subject stands on its own merit representing some areas of concerns with a common denominator posed as the following key question: how does the transport system respond at such disruptive events? or “what is the damage, given that something happens” [3].
The disruption entails a wide spectrum of events from traffic accidents and incident to extreme events such as natural or manmade disasters. During and in the aftermath of such events, the most vital (or socalled critical) roads must be kept at a functioning level.
Identifying a measure of robustness of the network at extreme events is a worthwhile effort which is also pursued in this study. In the first place, there is no consensus on the definition of network robustness much to the extent of the network stretched in a wide spectrum of disciplines [2, 4]. We adopt an intuitive definition provided by the Institute of Electrical and Electronics Engineers (1990): Robustness is the degree to which the network can function correctly in the presence of stressful conditions [1]. In other words, robustness is a characteristic of a network in withstanding or absorbing disturbances and remaining intact when exposed to disruption [4].
The roads are the backbone of a network based on which the operation is conducted. Irrespective of where we stand on the abovementioned spectrum, the general approach to assessing the robustness (or inversely fragility) of the network is to find the critical roads, which is a daunting task. Critical roads could act like Achillesheel that is that the entire network could become hostage to the disruption of few roads. In case of any incident leading to their closures, the network gets at a standstill. It is obvious that finding such Achillesheel roads holds a central role to develop a mitigation scheme or to be prepared for any eventuality. Perhaps such findings may warrant investment in expanding the road capacity such as new roads, bridges or lane widening, a type of themes known as network design problem [5]. The criticalness degree of roads can also be looked at as an index to measure their importance which in turn is utilized in road constructions and their prioritization [6, 7]. At the other end of this spectrum, there might be a number of roads whose removal, in fact, improves network performance commonly known as Braess’s paradox [8, 9, 10].
According to the findings in the literature, identifying such critical roads faces two main challenges: computational efficiency and theoretical development [11]. To cope with such difficulties, we proposed a heuristic method inspired by sensor (loop detector) location problem (SLP) [12]. The SLP basically stands for finding the minimum number and location of counting posts (in traffic count survey) in order to infer all traffic flows in a transport network. The widely accepted solution for the SLP is finding roads which can represent a broader range of origin–destination (OD) travel demand. This method is known as OD demand coverage based on which our heuristic method for identifying the Achillesheel roads is developed. To this end, roads with maximum travel demand coverage are sorted as the most critical one, for which a method widely popular among practitioners known as “link analysis” is adopted. The proposed methodology is applied to a largesized network of Winnipeg, Canada. The results shed light on also bottleneck points of the network which may warrant provision of additional capacity or parallel roads. These roads can also be considered as best possible locations for petrol station or police checkpoints since they represent the maximum number of vehicles passed through.
The impacts of the roads closure are simulated based on userequilibrium traffic assignment for which the following assumptions—widely used in the literature—are made: (a) travel demand is fixed and quantified as a single matrix, (b) commuters have a perfect understanding of the travel time, (c) neither demand nor travel time changes over time. In other words, we solve for a static and deterministic traffic assignment problem (TAP) subject to a fixed travel demand. However, by relaxing one or some of the abovementioned assignment—which resulted in stochastic, dynamic and variable travel demand methods—one can increase the realism and fidelity of the traffic simulation at the costs of additional computational times as well as some other computational complexities. Nevertheless, the consensus in the literature is to resort to the abovementioned assumptions.
The rest of the article is organized as follows. Section 2 contains a literature review. Section 3 discusses the methodology. Section 4 presents numerical results of two case studies: Gao’s test network and a largesize network of Winnipeg, Canada. Conclusion remarks are provided in Sect. 5.
2 Literature review
In this section, we provide a review of the studies related to the concepts of vulnerability followed by the literature related to the SLP.
The subjects such as vulnerability, robustness, flexibility and resilience do not have a clear demarcation and definition [4]. Recent thorough reviews have been made by [4, 13, 14, 15]. Given the extensive breadth of the research, in the present review, we seek only the most recent takes of the literature on the subject of critical roads.
Most of the previous studies are conceptual methods on vulnerability lacking a holistic approach to quantifying and evaluating the vulnerability of transportation networks. Rosenkrantz et al. [16] suggest the idea of a “StructureBased Resilience Matrix” to measure the vulnerability/resilience of networks’ components. Scott et al. [17] used network flows, link capacity and network topology to develop a network robust index measure. Leu et al. [18] used a network analysis to measure the robustness considering physical features of the network. Mattsson and Jenelius [19] provide an overview of recent research on vulnerability and the resilience of transport systems.
The consensus in the literature is to investigate the vulnerability based on the network topology [20, 21]. de Oliveira et al. [22] investigated two performance attributes of road networks, reliability and vulnerability and discuss the indicators found in the literature. The results show that the vulnerability indicators are more strongly affected by the characteristics of alternative routes. Aided by geography information systems (GIS), Kermanshah and Derrible [23] developed a datadriven approach to determining vulnerable locations in road networks with respect to land use information, demographic data and travel demand as well as some topological indicators. Similarly, Thekdi and Joshi [24] describe a scenariobased Bayesian approach to evaluate evidence from bigdata resources, such as geographical landscape and demographic data, to identify vulnerable sections of the transportation network.
The plethora of the relevant studies can be divided into two groups: (a) A vast number of studies only consider topological characteristics of networks, such as accessibility, connectivity, shortest path [25, 26, 27, 28, 29, 30]. What is missing in such approaches is the dynamic of the flow on the network. (b) Other studies are primarily concerned with the dynamic characteristic of flow such as commuters’ route choosing behavior in the road network [1, 20, 31]. This study obviously belongs to the second group.
The critical roads sometimes are dealt with in the context of vulnerability or via resilience or through robustness and fragility. The consensus is to examine removals of the roads to find their impacts on the respective network. The roads are then attributed with an index based on which the critical ones are flagged [1, 32, 33]. Conforming to the aforementioned classification, there are also two major categories of indices to measure the overall performance of the network (also known as a measure of effectiveness): functional and topological [4]. The flow dynamic as an overall network performance index is largely formulated as changes in total travel time [4, 31].
Similarly, Jenelius et al. [3] elicited a number of link importance indices and site exposure indices based on the increase in generalized travel cost when links are closed. These measures are divided into two groups: one reflecting an “equal opportunities perspective” and the other a “social efficiency perspective” pertaining to the connectivity and weighted by travel demand, respectively. The generalized travel costs are measured based on the Dijkstra’s shortest paths algorithm, and it is called “dynamic shortest path algorithm.” In other words, the effects of the traffic congestions arising from the disruptions (road closures) are yet to be taken into account.
Albert et al. [34] investigated a class of in homogeneously wired networks called scalefree networks, which include the worldwide web, the Internet, social networks, cells as well as road networks. They found out that in response to random failures such networks exhibit an unexpected degree of robustness, to the extent their overall operations become unaffected. However, these networks are extremely vulnerable to targeted attacks aiming at a few links or nodes that play a vital role in maintaining the network’s connectivity. A similar observation has also been reported by [35]. They have also displayed that malfunctioning of a single component of a network can generate a cascading effect, thus causing the entire network to collapse.
Wu et al. [36] have extensively studied the cascading effects of a number of failures’ scenarios. In contrary to the previous studies, the congestion effects of the failures’ scenarios are fully taken into account based on the userequilibrium (UE) traffic assignment. They displayed that two removal schemes flowbased and betweennessbased inflict the highest disruption compared to other removal scenarios (betweenness is an indicator of a node’s centrality in a network, and it is equal to the number of shortest paths that pass through the respective node).
As the literature review indicates, though the road networks are resilient to random or natural failures, they are highly fragile to targeted attacks; that is why, we refer to it as Achillesheel phenomenon.
The SLP has been found to be of the utmost difficult problems known as NPhard [37, 38, 39]. The SLP has been of great interest to electrical engineering as well as computer science for which a number of different methods are presented [40, 41, 42, 43, 44, 45]. Given the fact that SLP is NPhard, the heuristic methods are deemed valid [46, 47]. Yang and Zhou [47] proposed four heuristic methods including maximal flow fraction, OD demand coverage. Some researchers consider geographical and/or topological disaggregation of link flows to place the sensors [38, 48, 49]. Zhang et al. [50] proposed a genetic algorithm hybridized with simulated annealing to find appropriate traffic count posts to monitor network’s traffic flow. Viti et al. [41] provide a solution for the SLP by minimizing a measure of information loss of partial observability. Morrison and Martonosi [51] establish a necessary condition on the location of the sensors to enable the traffic flow to be computed. Larsson et al. [12] present a review of the solution methods of the SLP in the literature and appoint the OD demand coverage (ODDC) as a favorable method.
Based on the literature review, the following can be concluded. The road networks are shown to be of scalefree [52] that is there is a few, but a significant number of nodes with a lot of connections, whereas there are a high number of nodes with very few connections. This feature emerges from the fact that networks expand continuously by the addition of new nodes, and new nodes attach preferentially to nodes that are already well connected [53]. This is a clear definition of the road networks. Given the fact that the scalefree network is defenseless to targeted attacks, it is of the highest importance to flag these failures which are the mandate of the current study. To this end, the failure is defined as a number of drivers affected by targeted attacks which in turn calls on the SLP. There are a number of methods proposed for the SLP out of which the OD demand coverage is adopted in our research. Furthermore, we will discuss that the OD demand coverage implies the two most detrimental removal scenarios: flowbased and betweennessbased.
3 Methodology
Notation glossary used in this manuscript
Symbol  Description 

ODE  Origin–destination estimation 
ODDC  Origin–destination demand coverage problem to be solved in phase 1 
SLP  Sensor (loop detector) location problem 
A*  Set of flagged roads as candidate roads deemed critical found at phase 1 
A  Sets of all roads including the candidate roads (i.e., A ⊂ A*) 
N  Set of nodes of the road network, representing, junctions 
x _{ a }  Traffic volume (in passenger car unitpcu) on the road a ∊ A 
t _{ a }(x _{ a })  Travel cost or time of the road a ∊ A, defined by a nondecreasing BPR function of the traffic volume of the respective road x _{ a } (called delay function) 
\(A_{n}^{  } , A_{n}^{ + }\)  Set of links starting and ending at node n ∊ N, respectively; \(A_{n}^{  } , A_{n}^{ + } \subset A\) 
R  Set of origin–destination pairs, R ⊂ N × N 
q _{ r }  Travel demand in pcu for origin–destination r ∊ R 
\(q_{r}^{a}\)  Partial trips belonging to OD trips q _{ r } traversing the road a ∊ A 
P _{ r }  Set of paths between origin–destination r ∊ R 
h _{ p }  Traffic flow (in pcu) on path p ∊ P _{ r }, r ∊ R 
λ _{ r }  It is 1 if sensors (placed on the flagged road) capture any trips pertaining to OD r ∊ R and 0 otherwise 
Π_{ ar }  It is a matrix of the size of A × R with binary entries: Π_{ ar } = 1 if traffic volume on a ∊ A entails any trips pertaining to r ∊ R and Π_{ ar } = 0 otherwise 
μ _{ a }  It is 1 if road a ∊ A is flagged to be allocated a sensor and 0 otherwise 
\(\bar{n}\)  A prespecified value for the total number of flagged roads to be found as Achillesheels: \(\bar{n} = A^{*}\) 
\(\bar{x}\)  A prespecified value for the residual traffic flow 
z  The Beckmann objective function to be minimized 
\(\delta_{r,a}^{p}\)  Linkpath incidence (1: if link a belongs to path p between origin–destination r, and 0 otherwise) 
\(f_{r}^{p}\)  The traffic flow on the path p between origin–destination r ∊ R 
In this section based on the OD demand coverage criterion, a set of highly demanding roads are identified. To put it plainly, the candidate roads must be of highest importance. Such interpretation gives birth to a whole different problem in transportation in which traffic count posts for OD estimation (ODE) are sought. The task of ODE is centered on adjusting an outdated OD demand data based on a recently compiled traffic count of “some selected count posts.” Obviously, the traffic count posts are placed on the road. Evidently, traffic survey and the count are a costly job, and hence, it is not possible to have traffic counts on all roads. Now the question to be first answered is: Which roads must be selected as count posts to be used in the ODE? It is also a valid answer to the SLP.
As discussed before, the SLP is proven to be NPhard. In order to streamline such difficulty (especially in facing with realsized networks), we adopt an intuitive and heuristic approach based on a popular practice among practitioners known as “select link analysis” or “flowbundle” [54] in which, traffic volume seen on a road is traced back and forth to its origins and destinations. In other words, a subset of the OD demand corresponding to the traffic volume of the respective road is first skimmed off and it is then highlighted in the traffic volume plot. By doing so, the trace of the target traffic volume will be shown on the network. The method is carried out in an iterative course. Given a network with the result of the traffic assignment, in each iteration, a road with highest traffic volume is flagged for the sensor. The flagged road is then subjected to the flowbundle procedure to retrieve the corresponding OD trips, and we call it flagged trips. For the next iteration, the OD demand is first shaken off the flagged trips, and it is then used for a new traffic assignment (better to be called “partial traffic assignment”).
Compared to the first traffic assignment effort, this new (partial) traffic assignment can be computed much more efficiently: Any solution algorithm for a TAP needs to start with a feasible solution (traffic volumes on roads for {x _{ a }, a ∊ A}). In an iterative fashion, links’ travel times t _{ a } and traffic volumes x _{ a } are updated until a satisfactory convergence criterion is met (the travel times are updated to also update the shortest paths).
For a new traffic assignment, in the absence of any information the algorithm initiates based on the freeflow travel time (called allornothing traffic assignment). If there were a prior knowledge of the travel times close to those of the final optimal solution, then less number of iterations would be needed to meet the convergence criterion.

Step 0: Set two target values for terminations: (a) \(\bar{n}\): number of flagged roads to allocate sensor, (b) \(\bar{x}\): maximum residual traffic volume. Initialize set A* designated to the roads flagged as selected for sensors. Given network A and OD demand {q _{ i }, i ∊ I}, carry out traffic assignment to get traffic volume on all roads denoted by {x _{ a }, a ∊ A};

Step 1: Find a road a with maximum traffic volume (i.e., {x _{ a } = max(x _{ℓ}), ℓ ∊ A}) and add it to the flagged set (a → A*). Carry out “flowbundle” for the road a, and find the corresponding flagged OD trips denoted by \(q_{r}^{a}\), r ∊ R. Subtract the current OD demand from the flagged trips (i.e., \(q_{r} \leftarrow q_{r}  q_{r}^{a}\), r ∊ R). Save \(\sum_{r \in R} q_{r}^{a}\), as the ODCD of the road a. Now execute a partial traffic assignment.

Step 2: Find number of flagged roads and maximum residual traffic volume; if they are less than the target values (\(\bar{x}\) and \(\bar{n}\)) and then go to step 1; otherwise, terminate the algorithm.
The outcomes of the algorithm are the flagged roads for the sensor. We specify values of the target number of flagged roads and maximum residual traffic volume (\(\bar{x}\) and \(\bar{n}\)) in the undertaken case studies. By now the flagged roads are found. The order at which there are flagged as well as their corresponding OD coverage volumes shows their criticalness degree.
As the literature review indicates, the flowbased and betweennessbased removal schemes are more detrimental and disruptive to the networks’ performance. The OD demand coverage method as implemented above (based on the link analysis) obviously bears traits of these two schemes. It is evidently flowbased because at each iteration the road with highest traffic flow is flagged and taken out of the network. Since a new traffic assignment problem is solved for each iteration and hence a new set of the shortest paths are calculated, the algorithm implicitly considers the betweenness (note that the betweenness refers to a total number of shortest paths passing through a respective node).
4 Numerical evaluations
In this section, we first examine the proposed methodology over a network similar to the Gao’s 12node network [57]. The Gao’s network is readily available in the literature and is being used by the researchers as a common currency or a common benchmark network to exchange their findings. Therefore, the results reported in this paper can then be referred and examined in further studies. We then undertake a largesized network of Winnipeg as a challenging case study to display applicability of the proposed methodology. All delay functions associated with the links conform to BPRtype.
As for the computational technology, we employ a desktop computer with Intel(R) Xeon(R) 3.70 GHz and 64.0 GB RAM. The algorithm is coded in EMME 3 using “macro” the software’s programming language.

The relative gap needed by Frank–Wolfe algorithm to solve a traffic assignment is conservatively considered to be 0.0001 [58];

As for the number of candidates in Phase 1, one can carry out the process until the maximum traffic volume left on the roads becomes insignificant. For instance, the capacity of a local road can be a good criterion for being insignificant. Regardless, a prespecified capped number can also be considered. For instance, for the Winnipeg case study, we intentionally extended the number of candidates to 100 flagged roads, by which the maximum traffic volume left on the network was found 50. By doing so, we wanted to challenge the performance of the proposed algorithm at such an extreme condition.
4.1 Example 1: Gao’s network
The flagged roads are found as follows (start nodeend node): 5–6, 7–8, 6–10, 1–5, 4–8, 3–7, 5–9, 8–12, 6–7, 10–11, 2–6, 2–3; These roads are sorted in descending order based on their respective total demand coverage which are 6.28, 3.79, 3.34, 2, 2, 1.31, 1, 0.98, 0.91, 0.67, 0.24, 0.07. As can be seen, in early stages one can observe significant decreases in the demand coverages.
4.2 Example 2: Winnipeg largesize network
The largesized road network of the city of Winnipeg, Canada, widely used in the literature [59] is undertaken for the numerical test here as well. This dataset has also been provided in the EMME 3 [60]. The road network is comprised of 154 zones, 943 nodes and 3075 directional links. Given a high number of roads, the algorithm runs for 100 iterations to find 100 flagged roads.
Winnipeg network, 100 candidates roads sorted based on their corresponding OD coverages
ID  i node  j node  ffs  Length  Capacity  t0  Timau  ODDC  ID  i node  j node  ffs  Length  Capacity  t0  Timau  ODDC 

1  705  713  50  0.2  2550  0.240  0.384  3941  51  461  458  25  0.44  200  1.056  1.951  191 
2  607  606  50  0.37  2500  0.444  0.828  3936  52  212  213  35  0.41  750  0.703  0.704  190 
3  170  169  50  0.23  1875  0.276  0.656  3263  53  507  508  35  0.33  1250  0.566  0.603  183 
4  457  458  50  1.39  1700  1.668  1.758  2997  54  784  811  50  0.29  1875  0.348  0.348  171 
5  304  412  40  0.38  2625  0.570  0.712  2837  55  230  255  50  1.37  375  1.644  1.651  156 
6  414  973  45  0.12  2500  0.160  0.179  2037  56  613  614  50  0.11  1875  0.132  0.132  144 
7  813  811  50  0.25  2500  0.300  0.323  2019  57  1067  493  65  0.26  1250  0.240  0.264  143 
8  418  890  40  0.15  1750  0.225  0.290  1682  58  744  743  35  0.65  625  1.114  1.116  137 
9  592  596  35  0.61  1875  1.046  1.174  1589  59  699  730  35  0.44  750  0.754  0.756  129 
10  299  1064  40  0.29  1750  0.435  0.472  1462  60  602  601  50  0.58  2500  0.696  0.933  126 
11  790  765  50  0.41  1875  0.492  0.531  1451  61  533  582  50  1.48  1250  1.776  1.777  123 
12  204  205  45  0.26  2500  0.347  0.349  1126  62  628  629  50  0.24  1875  0.288  0.288  120 
13  516  517  50  0.25  2550  0.300  0.306  1023  63  839  838  50  0.45  1250  0.540  0.543  117 
14  441  442  50  0.51  1875  0.612  0.805  951  64  667  669  35  0.51  1250  0.874  1.767  115 
15  746  745  50  0.21  1250  0.252  0.280  858  65  500  499  50  0.34  1250  0.408  0.494  112 
16  727  726  50  0.3  1875  0.360  0.436  843  66  834  833  35  0.2  625  0.343  0.354  106 
17  311  316  35  0.22  1875  0.377  0.384  792  67  222  296  35  0.25  1250  0.429  0.471  103 
18  756  755  65  3.26  625  3.009  4.110  763  68  648  649  50  0.76  1250  0.912  1.061  100 
19  234  240  55  0.98  2500  1.069  1.073  721  69  336  337  50  0.67  625  0.804  0.920  95 
20  516  608  55  0.18  3750  0.196  0.213  670  70  1009  1008  35  0.17  1500  0.291  0.398  95 
21  363  378  50  1.35  1700  1.620  1.625  610  71  886  904  35  0.1  750  0.171  0.175  90 
22  221  222  35  0.19  1250  0.326  0.382  581  72  297  294  40  0.59  1750  0.885  0.885  88 
23  649  651  50  0.79  1250  0.948  1.315  565  73  620  619  50  0.12  1875  0.144  0.144  85 
24  441  440  50  0.5  2550  0.600  0.657  564  74  388  387  50  0.96  1700  1.152  1.152  83 
25  836  837  50  0.51  1250  0.612  0.624  529  75  885  907  35  0.1  750  0.171  0.172  83 
26  483  484  65  0.63  1750  0.582  0.588  481  76  769  765  35  0.83  750  1.423  1.426  81 
27  601  602  50  0.58  1875  0.696  0.830  431  77  171  172  50  0.37  1250  0.444  0.445  79 
28  576  581  50  2.12  1250  2.544  2.928  422  78  422  417  35  0.31  1125  0.531  0.536  73 
29  617  616  50  0.39  2500  0.468  0.558  417  79  795  794  50  0.37  1250  0.444  0.459  73 
30  330  328  50  0.34  1875  0.408  0.578  404  80  409  317  50  0.27  1250  0.324  0.393  72 
31  982  1003  35  0.04  750  0.069  0.070  402  81  686  683  35  0.36  750  0.617  0.620  72 
32  777  778  40  0.24  1750  0.360  0.365  396  82  734  733  35  0.29  750  0.497  0.503  70 
33  260  261  35  0.63  625  1.080  1.837  382  83  701  682  35  0.39  1875  0.669  0.669  69 
34  325  409  50  1.01  1250  1.212  1.542  382  84  727  728  50  0.22  1875  0.264  0.265  69 
35  397  386  50  0.85  850  1.020  1.026  369  85  241  219  35  0.64  375  1.097  1.135  68 
36  184  872  65  0.83  2500  0.766  0.768  335  86  454  455  50  0.37  1875  0.444  0.444  68 
37  728  729  50  0.5  1875  0.600  0.602  334  87  845  857  50  1.07  1875  1.284  1.284  66 
38  175  174  50  0.45  1875  0.540  0.687  262  88  605  606  50  0.14  1875  0.168  0.178  64 
39  686  687  35  0.39  1875  0.669  0.677  253  89  212  211  35  0.49  750  0.840  0.840  61 
40  322  321  65  0.8  2500  0.738  0.739  247  90  506  592  40  0.38  2625  0.570  0.579  61 
41  217  218  35  0.34  750  0.583  1.043  241  91  540  541  65  0.81  875  0.748  0.776  61 
42  262  275  35  0.19  375  0.326  0.334  237  92  612  611  50  0.54  2500  0.648  1.015  60 
43  655  654  35  0.26  750  0.446  0.471  227  93  338  337  50  0.53  1250  0.636  0.658  59 
44  411  412  40  0.1  1750  0.150  0.155  226  94  363  364  50  1.03  625  1.236  1.236  58 
45  771  772  35  0.28  625  0.480  0.494  221  95  221  219  35  0.27  375  0.463  0.488  56 
46  419  422  35  0.19  1250  0.326  0.348  220  96  751  750  50  0.17  1700  0.204  0.204  56 
47  790  791  35  0.63  375  1.080  2.181  209  97  776  779  35  0.32  750  0.549  0.549  56 
48  711  712  50  0.18  3400  0.216  0.217  200  98  454  452  50  0.75  1875  0.900  0.952  55 
49  428  427  35  0.25  1250  0.429  0.439  198  99  363  362  50  0.33  1250  0.396  0.415  54 
50  243  246  35  0.88  1250  1.509  1.549  194  100  445  490  50  0.33  1700  0.396  0.402  54 
5 Conclusions
In this study, we developed a heuristic methodology to find the most critical roads whose closures are devastating as if they act like Achillesheel, and bring the entire network to a halt. The Achillesheels is unfortunately in the genes of the road networks since they are proven to be of the scalefree networks that are the networks highly vulnerable to selected and targeted disruptions or attacks.
To this end, a set of roads which represent the travel demand the most are deemed to be critical are flagged. To do so, we borrowed the notion of sensor (loop detector) location problem which is proven to be of utmost difficult problems in terms of computational expenses. Such difficulties convinced us to resort to a heuristic methodology based on the concept of the maximum OD coverage which is already found as a favorable method for the SLP in the literature.
According to the OD coverage method, highly demanding roads (those that cover the travel demand the most) are found, for which we employed “link analysis”: method—a popular tool for practitioner in traffic impact studies. We applied the algorithm to the Gao’s test network and a real network of Winnipeg, Canada.
The main contribution of this study can be attributed to the way the OD coverage method is implemented in which the two most detrimental removal scenarios (i.e., flowbased and betweennessbased) are considered in one go. Moreover, in terms of the computational expenses, the proposed methodology provides highly efficient methods much owed to the adoption of the partial traffic assignment.
The results can be found of the highest importance to the traffic authorities in their quest to protect the road networks against targeted disruptions which would have cascading disruption across the system.
The subjects such as critical roads, robustness and resilience are seeing interest from different stakeholders such as authorities, practitioners and academia. Knoop et al. [33] have reviewed a variety of research and have assessed the quality of the outcomes. They found there is no consistency in the outcome. Such inconsistency and uncertainty have also reported by others [13]. Future studies can direct to first establish a consensus in definitions of these themes and their implications. The authors are currently studying on a global index to measure the robustness (or adversely fragility) of the network. Similar indices can be developed for other subjects. We are also working to find critical scenarios (rather than critical roads) which might consist of critical and noncritical roads. In other words, there can be some noncritical roads; if they become closed at the same time, the network becomes a gridlock Bagloee et al. [61].
Notes
Acknowledgements
The authors are indebted to Prof. Zhao and two anonymous reviewers whose remarks contributed to improving the quality and the clarity of the final version.
References
 1.Nagurney A, Qiang Q (2012) Fragile networks: identifying vulnerabilities and synergies in an uncertain age. Int Trans Oper Res 19(1–2):123–160MathSciNetCrossRefMATHGoogle Scholar
 2.Maltinti F, Melis D, Annunziata F (2011) Road network vulnerability: a review of the literature. In: Chong WKO, Hermreck C (eds) The international conference on sustainable design and construction (ICSDC). Integrating sustainability practices in the construction industry, March 23–25, Kansas City, MissouriGoogle Scholar
 3.Jenelius E, Petersen T, Mattsson LG (2006) Importance and exposure in road network vulnerability analysis. Transp Res Part A Policy Pract 40(7):537–560CrossRefGoogle Scholar
 4.Faturechi R, MillerHooks E (2014) Travel time resilience of roadway networks under disaster. Transp Res Part B Methodol 70:47–64CrossRefGoogle Scholar
 5.Bagloee SA, Tavana M, Ceder A, Bozic C, Asadi M (2013) A hybrid metaheuristic algorithm for solving reallife transportation network design problems. Int J Logist Syst Manag 16(1):41–66CrossRefGoogle Scholar
 6.Bagloee SA, Tavana M (2012) An efficient hybrid heuristic method for prioritising large transportation projects with interdependent activities. Int J Logist Syst Manag 11(1):114–142CrossRefGoogle Scholar
 7.Bagloee SA, Asadi M (2015) Prioritizing road extension projects with interdependent benefits under time constraint. Transp Res Part A Policy Pract 75:196–216CrossRefGoogle Scholar
 8.Bagloee SA, Ceder A, Tavana M, Bozic C (2013) A heuristic methodology to tackle the Braess Paradox detecting problem tailored for real road networks. Transp A Transp Sci 10(5):437–456Google Scholar
 9.Braess D, Nagurney A, Wakolbinger T (2005) On a paradox of traffic planning. Transp Sci 39(4):446–450CrossRefGoogle Scholar
 10.Braess D (1968) Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12(1):258–268MathSciNetMATHGoogle Scholar
 11.Taylor MA (2012) Network vulnerability in largescale transport networks. Transp Res Part A Policy Pract 46(5):743–745CrossRefGoogle Scholar
 12.Larsson T, Lundgren JT, Peterson A (2010) Allocation of link flow detectors for origindestination matrix estimation—a comparative study. ComputAided Civil Infrastruct Eng 25(2):116–131CrossRefGoogle Scholar
 13.Reggiani A, Nijkamp P, Lanzi D (2015) Transport resilience and vulnerability: the role of connectivity. Transp Res Part A Policy Pract 81:4–15CrossRefGoogle Scholar
 14.Wang Z, Chan AP, Yuan J, Xia B, Skitmore M, Li Q (2014) Recent advances in modeling the vulnerability of transportation networks. J Infrastruct Syst 21(2):2–9Google Scholar
 15.Bagloee SA, Asadi M, Richardson L (2011) Identifying traffic count posts for origindestination matrix adjustments: an approach to actual size networks. J Transp Manag 22(1):79–88Google Scholar
 16.Rosenkrantz DJ, Goel S, Ravi S, Gangolly J (2004) Structurebased resilience metrics for serviceoriented networks, pp 345–362Google Scholar
 17.Scott DM, Novak DC, AultmanHall L, Guo F (2006) Network robustness index: a new method for identifying critical links and evaluating the performance of transportation networks. J Transp Geogr 14(3):215–227CrossRefGoogle Scholar
 18.Leu G, Abbass H, Curtis N (2010) Resilience of ground transportation networks: a case study on Melbourne. In: 33rd Australasian transport research forum conference canberra, AustraliaGoogle Scholar
 19.Mattsson LG, Jenelius E (2015) Vulnerability and resilience of transport systems—a discussion of recent research. Transp Res Part A Policy Pract 81:16–34CrossRefGoogle Scholar
 20.Jenelius E, Mattsson LG (2015) Road network vulnerability analysis: conceptualization, implementation and application. Comput Environ Urban Syst 49:136–147CrossRefGoogle Scholar
 21.Kermanshah A, Karduni A, Peiravian F, Derrible S (2014) Impact analysis of extreme events on flows in spatial networks, pp 29–34Google Scholar
 22.de Oliveira EL, da Silva Portugal L, Junior WP (2016) Indicators of reliability and vulnerability: similarities and differences in ranking links of a complex road system. Transp Res Part A Policy Pract 88:195–208CrossRefGoogle Scholar
 23.Kermanshah A, Derrible S (2016) A geographical and multicriteria vulnerability assessment of transportation networks against extreme earthquakes. Reliab Eng Syst Saf 153:39–49CrossRefGoogle Scholar
 24.Thekdi SA, Joshi NN (2016) Riskbased vulnerability assessment for transportation infrastructure performance. Int J Crit Infrastruct 12(3):229–247CrossRefGoogle Scholar
 25.Callaway DS, Newman ME, Strogatz SH, Watts DJ (2000) Network robustness and fragility: percolation on random graphs. Phys Rev Lett 85(25):5468–5471CrossRefGoogle Scholar
 26.Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang DU (2006) Complex networks: structure and dynamics. Phys Rep 424(4):175–308MathSciNetCrossRefGoogle Scholar
 27.Newman M, Barabasi AL, Watts DJ (2006) The structure and dynamics of networks. Princeton University Press, PrincetonMATHGoogle Scholar
 28.Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167–256MathSciNetCrossRefMATHGoogle Scholar
 29.Tu Y, Yang C, Chen X (2012) Road network topology vulnerability analysis and application. Proc ICETransp 166(2):95–104Google Scholar
 30.Zhang H, Fata E, Sundaram S (2015) A notion of robustness in complex networks. IEEE Trans Control Netw Syst 2(3):310–320MathSciNetCrossRefGoogle Scholar
 31.Luathep P (2011) Stochastic transport network model and optimization for reliability and vulnerability analysis. Ph.D. dissertation, The Hong Kong Polytechnic UniversityGoogle Scholar
 32.ElRashidy RA, GrantMuller SM (2014) An assessment method for highway network vulnerability. J Transp Geogr 34:34–43CrossRefGoogle Scholar
 33.Knoop VL, Snelder M, van Zuylen HJ, Hoogendoorn SP (2012) Linklevel vulnerability indicators for realworld networks. Transp Res Part A Policy Pract 46(5):843–854CrossRefGoogle Scholar
 34.Albert R, Jeong H, Barabási AL (2000) Error and attack tolerance of complex networks. Nature 406(6794):378–382CrossRefGoogle Scholar
 35.Crucitti P, Latora V, Marchiori M, Rapisarda A (2004) Error and attack tolerance of complex networks. Phys A 340(1):388–394MathSciNetCrossRefMATHGoogle Scholar
 36.Wu J, Gao Z, Sun H (2007) Effects of the cascading failures on scalefree traffic networks. Phys A 378(2):505–511CrossRefGoogle Scholar
 37.Bianco L, Confessore G, Gentili M (2006) Combinatorial aspects of the sensor location problem. Ann Oper Res 144(1):201–234MathSciNetCrossRefMATHGoogle Scholar
 38.Bianco L, Confessore G, Reverberi P (2001) A network based model for traffic sensor location with implications on O/D matrix estimates. Transp Sci 35(1):50–60CrossRefMATHGoogle Scholar
 39.Chin F, Chrobak M, Yan L (2014) Algorithms for placing monitors in a flow network. Algorithmica 68(1):1–15MathSciNetCrossRefMATHGoogle Scholar
 40.Hu SR, Liou HT (2014) A generalized sensor location model for the estimation of network origin–destination matrices. Transp Res Part C Emerg Technol 40:93–110CrossRefGoogle Scholar
 41.Viti F, Rinaldi M, Corman F, Tampère CM (2014) Assessing partial observability in network sensor location problems. Transp Res Part B Methodol 70:65–89CrossRefGoogle Scholar
 42.Bianco L, Cerrone C, Cerulli R, Gentili M (2014) Locating sensors to observe network arc flows: exact and heuristic approaches. Comput Oper Res 46:12–22MathSciNetCrossRefMATHGoogle Scholar
 43.Castillo E, Grande Z, Calviño A, Szeto WY, Lo HK (2015) A stateoftheart review of the sensor location, flow observability, estimation, and prediction problems in traffic networks. J Sens. doi: 10.1155/2015/903563 Google Scholar
 44.Gentili M, Mirchandani P (2012) Locating sensors on traffic networks: models, challenges and research opportunities. Transp Res Part C Emerg Technol 24:227–255CrossRefGoogle Scholar
 45.Fu C, Zhu N, Ling S, Ma S, Huang Y (2016) Heterogeneous sensor location model for path reconstruction. Transp Res Part B Methodol 91:77–97CrossRefGoogle Scholar
 46.Lam W, Lo H (1990) Accuracy of OD estimates from traffic counts. Traffic Eng Control 31(6):358–367Google Scholar
 47.Yang H, Zhou J (1998) Optimal traffic counting locations for origin–destination matrix estimation. Transp Res Part B Methodol 32(2):109–126CrossRefGoogle Scholar
 48.Ehlert A, Bell MG, Grosso S (2006) The optimisation of traffic count locations in road networks. Transp Res Part B Methodol 40(6):460–479CrossRefGoogle Scholar
 49.Yang H, Yang C, Gan L (2006) Models and algorithms for the screen linebased trafficcounting location problems. Comput Oper Res 33(3):836–858CrossRefMATHGoogle Scholar
 50.Zhang J, Zhang X, Wu J (2007) Genetic simulated annealing algorithm for optimal deployment of flow monitors, pp 398–402Google Scholar
 51.Morrison DR, Martonosi SE (2015) Characteristics of optimal solutions to the sensor location problem. Ann Oper Res 226(1):463–478MathSciNetCrossRefMATHGoogle Scholar
 52.Lämmer S, Gehlsen B, Helbing D (2006) Scaling laws in the spatial structure of urban road networks. Phys A 363(1):89–95CrossRefGoogle Scholar
 53.Barabási AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512MathSciNetCrossRefMATHGoogle Scholar
 54.BarGera H, Boyce D, Nie Y (2012) Userequilibrium route flows and the condition of proportionality. Transp Res Part B Methodol 46(3):440–462CrossRefGoogle Scholar
 55.Sheffi Y (1985) Urban transportation networks: equilibrium analysis with mathematical programming methods. PrenticeHall, Englewood CliffsGoogle Scholar
 56.Patriksson P (1994) The traffic assignment problem: models and methods, VSP BV, The Netherlands. Facsimile reproduction published in 2014 by Dover Publications, Inc., Mineola, New York, NYGoogle Scholar
 57.Gao Z, Wu J, Sun H (2005) Solution algorithm for the bilevel discrete network design problem. Transp Res Part B Methodol 39(6):479–495CrossRefGoogle Scholar
 58.Boyce D, RalevicDekic B, BarGera H (2004) Convergence of traffic assignments: how much is enough? J Transp Eng 130(1):49–55CrossRefGoogle Scholar
 59.BarGera H (2016) Transportation network test problems, December 1, 2016. http://www.bgu.ac.il/~bargera/tntp/
 60.INRO (2009) EMME3 v 3.2. EMME3 User’s GuideGoogle Scholar
 61.Bagloee SA, Sarvi M, Wolshon B, Dixit V (2017) Identifying critical disruption scenarios and a global robustness index tailored to real life road networks. Transp Res Part E: Logist Transp Rev 98:60–81Google Scholar
Copyright information
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.