RESEARCH ON THE ALGORITHM OF TRAFFIC DISTRIBUTION IN LARGE-SCALE ROAD NETWORK BASED ON OPTIMIZATION OF TRAFFIC FLOW DISTRIBUTION

The paper proposes a traffic flow allocation algorithm to solve the problem of low speed and efficiency of traditional traffic allocation algorithms under multi-path capacity constraints of large-scale road networks. The algorithm speeds up the allocation process by merging traffic requests from the same endpoints and allocating the merged traffic requests. Meanwhile, the algorithm updates the flow resistance by partitioning the correspondence matrix into k sub-matricesand performing k al-location iterations, which dynamically corrects the effect of flow changes on the flow resistance and ensures accurate results. Example analysis shows that the improved method is effective in complex road networks.

Authors

Publication Details

Journal
World of transport and technological machines
Published
2025-01-01
DOI
https://doi.org/10.33979/2073-7432-2025-1-1(88)-3-12
Primary Topic
Simulation and Modeling Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

RESEARCH ON THE ALGORITHM OF TRAFFIC DISTRIBUTION IN LARGE-SCALE ROAD NETWORK BASED ON OPTIMIZATION OF TRAFFIC FLOW DISTRIBUTION

Han Mengyi, Zyryanov Vladimir Vasilevich, Topilin Ivan Vladimirovich
World of transport and technological machines
Simulation and Modeling Applications
article

RESEARCH ON THE ALGORITHM OF TRAFFIC DISTRIBUTION IN LARGE-SCALE ROAD NETWORK BASED ON OPTIMIZATION OF TRAFFIC FLOW DISTRIBUTION

Han Mengyi, Zyryanov Vladimir Vasilevich, Topilin Ivan Vladimirovich
article en

Abstract

The paper proposes a traffic flow allocation algorithm to solve the problem of low speed and efficiency of traditional traffic allocation algorithms under multi-path capacity constraints of large-scale road networks. The algorithm speeds up the allocation process by merging traffic requests from the same endpoints and allocating the merged traffic requests. Meanwhile, the algorithm updates the flow resistance by partitioning the correspondence matrix into k sub-matricesand performing k al-location iterations, which dynamically corrects the effect of flow changes on the flow resistance and ensures accurate results. Example analysis shows that the improved method is effective in complex road networks.

World of transport and technological machinesVol. 88(1-1)
Openalex Percentile: Top 92%
Simulation and Modeling Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.