MétaCan
Menu
Back to cohort
Record W4413169098 · doi:10.1155/atr/3589423

Identifying Strong Connectivity in Urban Road Networks Considering Traffic Constraints: An Analysis of Road Networks With Different Patterns

2025· article· en· W4413169098 on OpenAlexvenueno aff
Ruru Xing, Z N Yang, Tao Yang, Fei Wang

Bibliographic record

VenueJournal of Advanced Transportation · 2025
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsnot available
FundersYoung Scientists FundNatural Science Foundation for Young Scientists of Shanxi ProvinceNational Natural Science Foundation of China
KeywordsTransport engineeringComputer scienceRoad trafficTraffic analysisEngineeringComputer network

Abstract

fetched live from OpenAlex

Road network connectivity is an important indicator for measuring the operational efficiency and reliability of urban road networks, and it plays an important role in supporting traffic planning and management decisions. The implementation of traffic management measures, such as traffic bans and temporary traffic flow changes, will restrict access to some sections and lanes, reduce the passable paths in the road network, and thus affect the overall connectivity performance of the road network. Existing road network research results mostly evaluate the topological connectivity of the network at the physical level, and it is difficult to accurately portray the actual road network connectivity under traffic management conditions. To quantitatively evaluate the road network connectivity performance after the implementation of traffic management tools, this paper proposes a road network connectivity evaluation method based on strongly connected effective paths. Firstly, the node steering coefficients are used to describe the no‐traffic constraints of turning lanes, and the connectivity evaluation indexes are constructed based on the number of strongly connected effective paths and the shortest paths of strongly connected paths. Secondly, combining the Floyd‐Warshall algorithm and the depth‐first search algorithm, we constructed a strong connectivity effective path search algorithm to adapt to the refined traffic management situation, and identified the key road sections that have the greatest impact on the connectivity of the road network by considering the maximum acceptable level of the path and the road access constraints. Finally, Sioux‐Falls network and nine urban road networks with different layout patterns are selected for the case study and compared with traditional road network connectivity indicators. The case studies show that: (1) the connectivity of the square grid road network structure is superior, while the connectivity of the free‐form road network is the lowest; (2) road access management measures reduce the overall road network connectivity, and the banning of traffic in critical sections has the most significant effect on connectivity. Accurately assessing the changes in road network connectivity performance under different traffic management measures provides a scientific basis for the development of road control strategies, which can effectively improve urban traffic fluency and residents’ travel efficiency.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.011
Threshold uncertainty score0.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0030.003
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.011
GPT teacher head0.275
Teacher spread0.264 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Advanced TransportationSame topicComplex Network Analysis TechniquesFrench-language works237,207