skip to main content
Idioma:
Primo Search
Clear Search Box
Search in: Busca Geral
Busca Avançada
Busca por Índices

On the spatial partitioning of urban transportation networks

Ji, Yuxuan ; Geroliminis, Nikolas

Transportation research. Part B: methodological, 2012-12, Vol.46 (10), p.1639-1656 [Periódico revisado por pares]

Kidlington: Elsevier Ltd

Texto completo disponível

Citações Citado por
  • Título:
    On the spatial partitioning of urban transportation networks
  • Autor: Ji, Yuxuan ; Geroliminis, Nikolas
  • Assuntos: Algorithms ; Applied sciences ; Buildings. Public works ; Clusters ; Density ; Exact sciences and technology ; Ground, air and sea transportation, marine construction ; Links ; Macroscopic fundamental diagram ; Networks ; Partitioning ; Road types (roads, freeways, express ways, etc.) ; Traffic flow ; Transportation infrastructure ; Transportation planning, management and economics ; Urban mobility ; Urban transportation ; Variance
  • É parte de: Transportation research. Part B: methodological, 2012-12, Vol.46 (10), p.1639-1656
  • Notas: ObjectType-Article-2
    SourceType-Scholarly Journals-1
    ObjectType-Feature-1
    content type line 23
  • Descrição: ► We partition transportation networks based on spatial features of congestion. ► A three-step partitioning mechanism for transportation networks is designed. ► The spatial compactness of the clusters is obtained after partitioning. ► Several homogeneity metrics to evaluate the partitioning results are specified. ► Scatter of partitioned MFDs decreases for heterogeneous density of networks. It has been recently shown that a macroscopic fundamental diagram (MFD) linking space-mean network flow, density and speed exists in the urban transportation networks under some conditions. An MFD is further well defined if the network is homogeneous with links of similar properties. This collective behavior concept can also be utilized to introduce simple control strategies to improve mobility in homogeneous city centers without the need for details in individual links. However many real urban transportation networks are heterogeneous with different levels of congestion. In order to study the existence of MFD and the feasibility of simple control strategies to improve network performance in heterogeneously congested networks, this paper focuses on the clustering of transportation networks based on the spatial features of congestion during a specific time period. Insights are provided on how to extend this framework in the dynamic case. The objectives of partitioning are to obtain (i) small variance of link densities within a cluster which increases the network flow for the same average density and (ii) spatial compactness of each cluster which makes feasible the application of perimeter control strategies. Therefore, a partitioning mechanism which consists of three consecutive algorithms, is designed to minimize the variance of link densities while maintaining the spatial compactness of the clusters. Firstly, an over segmenting of the network is provided by a sophisticated algorithm (Normalized Cut). Secondly, a merging algorithm is developed based on initial segmenting and a rough partitioning of the network is obtained. Finally, a boundary adjustment algorithm is designed to further improve the quality of partitioning by decreasing the variance of link densities while keeping the spatial compactness of the clusters. In addition, both density variance and shape smoothness metrics are introduced to identify the desired number of clusters and evaluate the partitioning results. These results show that both the objectives of small variance and spatial compactness can be achieved with this partitioning mechanism. A simulation in a real urban transportation network further demonstrates the superiority of the proposed method in effectiveness and robustness compared with other clustering algorithms.
  • Editor: Kidlington: Elsevier Ltd
  • Idioma: Inglês
Links
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.