LSESU Data Science Datathon 2026
Rex, Ling Ya, Chang, Vignesh, Sid
Choose the best place to implement a new tube station.
Addressing deprivation and transit poverty in underserved communities across Greater London.
Population density, bus crowding, employment hubs — where do people actually need to travel?
Network capacity and infrastructure constraints — can the existing grid handle a new node?
How do we mathematically solve for all three?
A 6-stage pipeline from raw spatial data to a statistically validated recommendation
We computed a weighted "Need Score" combining 6 normalised indicators:
Output: Top 10 candidates exported as CSV with Need Scores, coordinates, and catchment stats.
We reconstructed the London Underground as a mathematical graph using NetworkX — a Python library for creating, manipulating, and studying complex networks.
Each station = node; each connection = weighted edge. This lets us compute shortest paths, global efficiency, and centrality across the network.
$\sigma(s,t)$ = shortest paths between s,t; $\sigma(s,t|v)$ = those through v. High $C_B$ = bottleneck.
Baseline Global Efficiency and shortest-path matrices established.
We programmatically inserted each top-10 candidate into the mathematical graph to simulate the impact.
We match high-need LSOA requirements with the existing network — finding the intersection of demand and topology.
Adding a new line segment actually increases overall travel time, as trains stop at every station along the route.
This led us to evaluate an interchange — connecting to existing lines rather than extending them.
Multi-Criteria Decision Analysis — all outputs scaled to a 0–1 index, weights allocated into 3 thematic tiers:
LSOA: Brent 035C
Maximises socio-economic ROI while acting as a pressure release valve for North-West London rail flows — without the travel-time penalty of extending a line.
We ran 10,000 Monte Carlo simulations perturbing all MCDA weights by ±30% to ensure our results are structurally sound.