Network based definition of functional regions: A graph theory approach for spatial distribution of traffic flows
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60076658%3A12410%2F20%3A43902077" target="_blank" >RIV/60076658:12410/20:43902077 - isvavai.cz</a>
Alternative codes found
RIV/61989592:15310/20:73603203
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0966692320303288" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0966692320303288</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jtrangeo.2020.102855" target="_blank" >10.1016/j.jtrangeo.2020.102855</a>
Alternative languages
Result language
angličtina
Original language name
Network based definition of functional regions: A graph theory approach for spatial distribution of traffic flows
Original language description
Functional regions are autonomous (internally coherent and externally self-contained) spatial structures based on vector data, so-called spatial interactions. Typically, travel-to-work, travel-to-school flows and migrations are analysed by various methods of functional regional taxonomy in order to define functional regions. There is still another type of statistically recorded vector data which has, up to now, rarely been used for this purpose: traffic flows. However, these data differ distinctly from the above mentioned flows. In this paper we pursue two objectives: (i) to define functional transport regions based on a graph theoretic analysis of individual traffic flows, and (ii) to add knowledge to the issue of the self-containment of functional transport regions. The specific nature of transport data compared to the above-mentioned spatial interactions requires a specific methodological approach, which is presented in the paper. The existing graph theoretic procedures do not seem suitable for the definition of functional transport regions due to data specifics. Therefore our analysis is based on a rough analogy to the minimum cut method – we identify minimum flows in a graph representing a transport network. The territory of the Czech Republic is used as the example. Two regional systems are defined (based on 2000 and 2016 data) and compared in time. The paper achieves two main findings. First, the proposed methodological approach allows us to define autonomous functional transport regions, and the means to calculate their self-containment is discussed. Second, functional transport regions in the Czech Republic show unexpected stability over time compared to functional regions based on such spatial interactions as commuting flows.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
50703 - Transport planning and social aspects of transport (transport engineering to be 2.1)
Result continuities
Project
<a href="/en/project/GA20-21360S" target="_blank" >GA20-21360S: Spatial interactions and their conceptualisation: analysis of selectivity, uncertainty and hierarchy</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Transport Geography
ISSN
0966-6923
e-ISSN
—
Volume of the periodical
88
Issue of the periodical within the volume
říjen
Country of publishing house
GB - UNITED KINGDOM
Number of pages
11
Pages from-to
—
UT code for WoS article
000582208900041
EID of the result in the Scopus database
2-s2.0-85090295852