Isochrone Analysis
Isochrone analysis computes the area reachable from a location within a given travel time, drawing contour lines — isochrones — that enclose everywhere you can get to in, say, 15, 30, or 45 minutes. It rests on the single-source shortest-path problem solved by Dijkstra's 1959 algorithm: from an origin, the travel time to every node of a routable network is found, thresholded, and converted into a polygon of reachable space. Isochrones turn an abstract travel-time field into an intuitive map of reach, and underpin service-area planning, accessibility measurement, and location analysis.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
Sources
- Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271. DOI: 10.1007/BF01386390 ↗
How to cite this page
ScholarGate. (2026, June 22). Isochrone Analysis (Travel-Time Contour Computation). ScholarGate. https://scholargate.app/en/human-geography/isochrone-analysis
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Accessibility AnalysisHuman Geography↔ compare
- Catchment Area AnalysisHuman Geography↔ compare
- Network Distance AnalysisHuman Geography↔ compare
- Two-Step Floating Catchment AreaHuman Geography↔ compare