Abstract

To meet the evolving demands of land use and transport interaction (LUTI) assessment within China’s national territory spatial planning (NTSP) system, this paper introduces the level of development (LoD) and the level of matching (LoM) evaluation models, based on the traffic facility and land use factors. The LoD model, founded on the modified node‐place model, provides a comprehensive assessment of the traffic facility and land use development scales. Conversely, the LoM model, grounded in data envelopment analysis methods, evaluates the relative relationship between transport services and the travel demand generated by land use. The integrated use of LoD and LoM can both reflect the development scale and matching status between traffic services and travel activities, which are crucial contents in the planning works, especially within the NTSP framework. The proposed models are tested in the city of Guangzhou, and the LoD values exhibit peaks in central urban zones, suburban towns, and areas adjacent to railway transit, with a decline observed in rural farmland and ecological regions. In contrast, the LoM distribution performs a distinct pattern, highlighting numerous underperforming areas with congestion or idle problems in urban centers, alongside well‐coordinated regions showcasing a balance between traffic facilities and land uses in rural regions. Furthermore, the LoM scores revealed frequent instances of facility crowding in urban regions and intensive occurrences of facility idleness in rural areas. By marking regions with low LoD scores, the LoD model finds suitable application in determining the urban development border, essential for restricting land development and preserving farmland and ecological areas. Meanwhile, LoM aids in improving urban renewal efforts by assessing and optimizing the balance between intensive land uses and limited traffic facilities. Validated against the existing metrics, the combined use of LoD and LoM efficiently captures the most details of the LUTI process at the lowest computational cost.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.