HydNet-Critical is a graph-analytics study of Hyderabad's road network that identifies the links whose loss hurts the city most, and quantifies by how much. The street network is constructed from OpenStreetMap with OSMnx as a directed, weighted drive graph for the GHMC area, with every construction and simplification choice — network filter, intersection consolidation tolerance, edge directionality, speed-to-travel-time conversion — documented, because each one changes the criticality answer.
Criticality is measured per link and aggregated per corridor using betweenness centrality (how many shortest travel-time paths use a link) and closeness centrality on the travel-time graph, producing a ranked list of Hyderabad's most critical links and corridors — expected to concentrate on Musi river crossings, radial arterials and the inner ring.
A scenario engine then removes edges to simulate disruptions: individual bridge closures across the Musi, closure of elevated-corridor segments such as the PVNR Expressway, surface-road diversions along metro-corridor stretches, and a combined monsoon-flood scenario that takes out a documented set of low-lying crossings at once. For every scenario the study measures accessibility deltas against the undisrupted baseline — travel-time inflation, detour-ratio distributions and disconnected origin–destination pairs — on the same origin–destination sample, so deltas are paired and comparable.
Where citable ground truth exists, the ranking is sanity-checked against it: corridor classifications and volume shares from the HMDA Comprehensive Transportation Study, and the flood-affected crossings documented after recent monsoon events. The deliverable is a reproducible, scripted pipeline and a dissertation-ready results chapter.
Hyderabad's road network carries rapid growth with limited redundancy: a handful of river crossings, radial arterials and elevated corridors connect zones that have no practical alternative route. During monsoon flooding, low-lying crossings of the Musi and city nalas close with little warning; metro and corridor works divert traffic for years at a stretch. Yet there is no public, reproducible ranking of which links are structurally critical to the city, and closure planning cannot cite measured accessibility consequences of losing a given bridge or corridor — decisions rest on intuition and complaint volumes. This study fills that gap: build the city's drive network from OpenStreetMap with fully documented construction choices, rank links and corridors by betweenness and closeness criticality on travel time, simulate bridge, elevated-corridor and metro-corridor closures as explicit edge-removal scenarios, and measure paired accessibility deltas against the baseline, validating the ranking against citable transport-study and flood-impact observations where they exist.
Synopsis
Abstract
This dissertation studies the structural resilience of Hyderabad's road network using open data. A directed drive-network graph of the metropolitan area is built from OpenStreetMap with OSMnx under documented filtering and simplification; betweenness and closeness criticality identify the links and corridors that carry the largest share of shortest travel-time paths; and an edge-removal scenario engine measures the accessibility consequences of bridge, elevated-corridor and metro-corridor disruptions, including a combined monsoon-flood scenario. Results are travel-time deltas, detour-ratio distributions and disconnected-pair counts per scenario, validated where possible against HMDA transport-study corridor evidence and documented flood impacts.
Introduction
Hyderabad concentrates population, employment and infrastructure on a road network that monsoons repeatedly stress: low-lying crossings of the Musi and the city's nalas flood and close, elevated corridors and metro construction divert traffic for years, and closures cascade because alternatives are few. Planners discuss critical links qualitatively; this study makes the question quantitative and reproducible on open data, so closure planning and mitigation investment can cite measured numbers.
Existing system and literature gap
Network-science methods — shortest paths, centrality measures, percolation-style edge removal — are mature, and OSM-based street-network studies exist for many world cities. Published Indian work, however, typically (a) does not document network construction and simplification choices, which materially change centrality answers; (b) reports global city-level metrics without the corridor-level aggregation a planner can act on; or (c) omits measured accessibility deltas per disruption scenario. No public, reproducible critical-link study for Hyderabad combines documented OSMnx construction, corridor-level criticality and scenario deltas with a stated validation attempt against transport-study evidence.
Proposed work
Pin a dated OSM snapshot (Geofabrik India extract) and build the drive graph with OSMnx, documenting filters, simplification and travel-time assignment.
Compute node and edge betweenness (with a declared exact-or-sampled policy) and closeness on the travel-time graph; roll link criticality up into named-corridor rankings.
Run a construction-sensitivity analysis showing how rankings shift under alternative filters, tolerances and speed assumptions.
Encode a scenario matrix — individual Musi bridge closures, a PVNR-type elevated-corridor closure, metro-corridor surface-road disruption, and a combined monsoon-flood set — as versioned edge-removal lists with sourcing notes.
Measure per-scenario accessibility deltas: mean and 95th-percentile travel-time change, detour-ratio distribution, disconnected origin–destination pairs and zone-level accessibility change.
Validate corridor rankings against HMDA Comprehensive Transportation Study corridor classifications and documented flood-affected crossings, reporting agreement and disagreement honestly.
Feasibility
Technical: a metropolitan drive graph simplifies to tens of thousands of nodes; betweenness with a sampled origin–destination set and standard NetworkX/OSMnx routines runs in hours on a laptop, and scenarios reuse precomputed path structures.
Data: OSM is free and complete for Hyderabad; the Geofabrik India extract gives a citable, versionable snapshot.
Economic: no licences; every library is open-source.
Operational (research): every figure and table regenerates from scripts and the pinned snapshot with a single command chain.
Objectives
01Construct Hyderabad's directed drive network from a pinned OpenStreetMap snapshot using OSMnx, documenting every filtering, simplification and travel-time assignment choice together with its rationale.
02Compute node and edge betweenness centrality and closeness centrality on the travel-time graph under a declared exact-or-sampled policy, and aggregate link criticality into named-corridor rankings.
03Run a sensitivity analysis on construction choices (network filter, intersection-consolidation tolerance, speed assumptions) and report how the criticality ranking shifts under each alternative.
04Build a scenario engine representing Musi bridge closures, a PVNR-type elevated-corridor closure and metro-corridor surface-road disruption as explicit, versioned edge-removal sets with documented sourcing.
05Measure accessibility deltas per scenario — mean and 95th-percentile travel-time change, detour-ratio distribution, disconnected origin–destination pairs and zone-level accessibility change — on a paired origin–destination sample.
06Validate the criticality ranking against citable observations (HMDA Comprehensive Transportation Study corridor classifications, documented monsoon flood-affected crossings), reporting agreement and disagreement honestly.
07Deliver a scripted, version-pinned pipeline in which every table, map and figure regenerates from the pinned OSM snapshot with a single command chain.
Scope
In scope
The GHMC-area drive network from one pinned OSM snapshot; travel times from OSMnx's speed/tag assumptions, stated as such.
Betweenness and closeness criticality (exact where feasible, sampled where not, with the policy and seed declared); corridor-level aggregation by name and spatial buffer.
Edge-removal disruption scenarios (single bridge, elevated corridor, metro-corridor surface roads, combined flood set) with paired accessibility deltas on the same graph.
Sensitivity analysis of construction choices; validation against citable HMDA and flood-impact observations.
Out of scope
Dynamic traffic assignment, congestion propagation and microsimulation; the graph uses static travel times.
Hydrodynamic flood modelling; flood scenarios use documented affected-crossing sets, not simulated flood extents.
Economic-loss, property-value and emergency-response optimisation analyses.
Multimodal (metro, bus, MMTS) network modelling beyond using corridor closures as scenarios.
Other cities — offered as future work.
Methodology
The study follows a quantitative simulation-and-sensitivity research design with a fixed analysis protocol: define the graph, freeze construction choices, compute criticality, then run scenarios — never re-tuning choices after seeing scenario results. An M.Tech-appropriate phase plan spans 24 weeks.
Phase
Weeks
Activities
Deliverable
Survey and protocol
1–4
Street-network resilience and centrality literature; OSMnx documentation study; write the analysis protocol
Survey chapter + frozen protocol
Network construction
5–8
Pin the OSM snapshot (Geofabrik extract); build the drive graph; document simplification; assign travel times; publish the construction report
Encode bridge, elevated-corridor, metro-corridor and flood edge-removal sets; run the scenario engine; compute accessibility deltas
Scenario results
Validation
19–20
Compare corridor rankings with HMDA CTS corridor evidence and documented flood-affected crossings
Validation chapter
Writing and defence
21–24
Dissertation, figures, slides, viva preparation
Dissertation + presentation
Graph construction (declared in advance). One Geofabrik India extract is pinned by download date; the drive subgraph is extracted with OSMnx (network_type = drive), intersections are consolidated at a stated tolerance, and travel time is computed from OSM speed tags using OSMnx's routines. Every choice is recorded next to the alternative rejected and why — because the sensitivity phase will quantify exactly how much these choices move the answer.
Criticality computation. Betweenness uses shortest travel-time paths. Where the exact computation is too slow for the full graph, a sampled origin–destination set with a declared size and seed approximates it, and an exact run on the core sub-area checks the approximation against ground truth. Corridor roll-up sums link criticality within named corridors matched by OSM way name and a spatial buffer.
Scenario engine and validation. Each scenario is a versioned list of OSM way IDs with its sourcing documented (published flood reports and news-documented closures for the flood set; corridor geometry for elevated and metro sets). The engine removes edges, recomputes travel-time metrics on the identical origin–destination sample, and diffs against the baseline, so every delta is a paired measurement. Validation runs only after the main results and can confirm or contradict the ranking — it can never tune it.
Study design
1 diagram · 8 tools · 1 min read
Python
OSMnx
NetworkX
GeoPandas
pandas/NumPy
Matplotlib
Folium
Jupyter Notebook
HydNet-Critical is a scripted pipeline whose artefacts — snapshot, graph, criticality tables, scenario definitions, deltas — are versioned files, so any dissertation number can be traced and regenerated.
flowchart TD
A["Geofabrik India OSM extract<br/>pinned by download date"] --> B["OSMnx graph construction<br/>drive filter, simplify, travel time"]
B --> C[("Versioned graph<br/>nodes, edges, travel_time")]
C --> D["Criticality module<br/>betweenness, closeness, corridor roll-up"]
C --> S["Construction sensitivity runs<br/>filters, tolerance, speed assumptions"]
S --> D
F["Scenario definitions<br/>bridge, elevated, metro, flood sets"] --> E["Scenario engine<br/>edge removal, same OD sample"]
C --> E
D --> E
E --> G["Accessibility deltas<br/>travel time, detour ratio, disconnections"]
H["HMDA CTS corridors and<br/>documented flood closures"] --> V["Validation and robustness checks"]
G --> V
D --> V
V --> R["Results chapter:<br/>tables, maps, scenario report"]
Three design decisions carry the study's credibility. First, construction transparency: the network-build report lists every filter, tolerance and speed assumption next to the alternative considered, because centrality answers are only as trustworthy as the graph they run on — and the sensitivity module quantifies that trust. Second, paired scenario evaluation: every scenario reuses the same origin–destination sample as the baseline, so accessibility deltas are paired measurements rather than two unrelated runs. Third, separated validation: the comparison against HMDA CTS corridor evidence and documented flood closures lives in its own module and its own chapter — it runs after the main results and can only confirm or contradict the ranking, never tune it.
The scenario engine is deliberately simple — remove edges, recompute, diff — which keeps the mathematics inspectable and the viva defensible: every delta in the dissertation is a shortest-path computation on a graph the examiner can see and reproduce.
Work packages
6 packages
Package 01
Snapshot and graph construction
Pins the Geofabrik India extract by download date, builds the directed drive graph with OSMnx, consolidates intersections at a declared tolerance, computes travel times from OSM speed tags, and writes a versioned graph file plus a construction report listing every choice and the alternative rejected.
Package 02
Criticality module
Computes node and edge betweenness centrality and closeness centrality on the travel-time graph under a declared exact-or-sampled policy with a fixed random seed, then aggregates link criticality into named-corridor rankings by OSM way-name matching and a spatial buffer, with per-corridor tables and maps.
Package 03
Construction sensitivity module
Rebuilds the graph under alternative choices — wider and narrower network filters, consolidation on and off, alternate speed assumptions — recomputes corridor rankings, and quantifies rank shifts so the dissertation can state how robust the headline ranking is to construction decisions.
Package 04
Scenario engine
Stores each disruption — individual Musi bridge closures, a PVNR-type elevated-corridor closure, metro-corridor surface-road removal, and the combined monsoon-flood set — as a versioned list of OSM way IDs with sourcing notes, removes them from a copy of the baseline graph, and reruns the identical origin–destination sample.
Package 05
Accessibility delta analysis
Computes per-scenario changes in mean and 95th-percentile trip travel time, detour-ratio distributions, disconnected origin–destination pairs and zone-level accessibility, producing paired-difference tables and before/after maps against the undisrupted baseline.
Package 06
Validation and reporting
Compares corridor criticality rankings with HMDA Comprehensive Transportation Study corridor classifications and documented flood-affected crossings, reports agreement and disagreement honestly, and regenerates every table, map and figure from pinned inputs in a single command chain.
Slides
14 slides · titles free · bullets, notes and the .pptx unlock
Slide 1
Critical-Link Identification and Flood-Disruption Resilience of the Hyderabad Road Network
Slide 2
Why Hyderabad's network resilience matters
Slide 3
Research questions
Slide 4
Gap in existing work
Slide 5
Data: OpenStreetMap, pinned and citable
Slide 6
Network construction choices
Slide 7
Criticality measures
Slide 8
Scenario matrix
Slide 9
Measuring accessibility deltas
Slide 10
Results: critical corridors
Slide 11
Results: scenario deltas
Slide 12
Validation and limitations
Slide 13
Conclusion & future scope
Slide 14
References & artefacts
Bullets, speaker notes and the .pptx · ₹2,000
The titles above are the real outline. The rest is what you present from.
Read each answer, close it, and say it in your own words. Your viva will ask. Now you'll know.
01Concept
What does betweenness centrality measure on a road graph, and why is it a reasonable proxy for criticality?
Betweenness counts the fraction of shortest travel-time paths between all origin–destination pairs that pass through a link or node. A link with high betweenness sits on many fastest routes, so losing it forces a large number of trips onto detours simultaneously — which is precisely what makes a link critical when it floods or closes. It is a structural proxy: it ignores congestion dynamics, which I state openly, and the scenario deltas then test how good that proxy is.
02Concept
Why weight the graph by travel time rather than distance?
Because disruption costs users minutes, not metres. A one-kilometre elevated expressway segment can carry faster paths than a five-kilometre parallel service route, so distance-based centrality would rank links by geometric convenience rather than by how the city actually moves. Travel time from OSM speed tags is still an assumption, not measured traffic, and I say so explicitly — but it is a far better proxy for the route choice the closure question is about.
03Concept
What is the difference between node and edge betweenness, and which do you report per corridor?
Node betweenness counts shortest paths passing through an intersection; edge betweenness counts paths using a road segment. For corridor rankings I report edge betweenness, because planners close or lose road segments, not junctions in isolation — a bridge is a set of edges. Node measures still matter: a junction with extreme node betweenness combined with low edge betweenness indicates a crossing whose failure mode is signal failure, not closure.
+13 more questions, with answers
Try the free ones out loud first. Your examiner will not accept “it's in the PPT”.