GTUP (1)
收藏DataCite Commons2026-04-21 更新2026-05-04 收录
下载链接:
https://data.mendeley.com/datasets/dprvtz5c4p
下载链接
链接失效反馈官方服务:
资源简介:
This dataset accompanies the paper "Graph-Theoretic Urban Planning (GTUP): A Multi-Layer Framework for Cities as Complex Networks," which analyses two morphologically contrasting U.S. cities — Fairfax, Virginia (suburban, cul-de-sac-dominated) and Alexandria, Virginia (historic grid with suburban fringe) — as multi-layer coupled networks integrating transport, land-use/points-of-interest, and green infrastructure. All artefacts are derived from the OpenStreetMap snapshot recorded in the accompanying manifest and are projected to EPSG:32618 (UTM Zone 18N).
The archive contains: (i) cleaned simple-undirected WALK and DRIVE street networks for both cities as ESRI shapefiles, with OSM node identifiers, vertex degrees, odd/even parity flags, and metric edge lengths; (ii) Minimum Spanning Trees of each network computed with Kruskal's algorithm; (iii) Chinese Postman matched-edge routes — the shortest-path polylines representing edges that a Eulerian closed walk must traverse twice, obtained by exact min-weight perfect matching on odd-degree vertices with k-nearest-neighbour sparsification verification (k = 30 vs 60, Δ agreement < 10⁻⁴%); (iv) the supplementary HAS* optimal TSP tour over 113 Fairfax POIs, solved via Google OR-tools Guided Local Search; (v) POI features classified into four Moreno-category layers (commerce, education, healthcare, recreation) and green-infrastructure polygons; (vi) node-level CSV tables including betweenness centrality, per-category 15-minute accessibility distances, and supra-adjacency rank comparisons; (vii) per-cell JSON outputs recording every metric with its formula, algorithm, and computation time; (viii) all manuscript figures as PNG; and (ix) a complete reproducibility manifest listing pinned library versions, random seeds, parameter values, and run timestamps.
提供机构:
Mendeley Data
创建时间:
2026-04-21



