A Novel Shortest Path Query Algorithm Based on Optimized Adaptive Topology Structure
Urban rail transit is a fundamental component of public transportation, however, commonly station-based path search algorithms often overlook the impact of transfer times on search results, leading to decreased accuracy. To solve this problem, this paper proposes a novel shortest path query algorithm based on adaptive topology optimization called the Adaptive Topology Extension Road Network Structure (ATEN). This algorithm categorizes transfer stations into different types and treats travel time and transfer time equivalently as weights for edges in the topological graph. The proposed algorithm introduces virtual stations to differentiate between pedestrian paths and train paths, eliminating the need for additional operations on transfer stations. The algorithm controls the extent of expansion in the urban rail transit topology, overcoming query errors caused by mishandling of transfer stations in the existing algorithm. Finally, a series of simulation experiments were conducted on Beijing's urban rail transit network to validate both correctness and efficiency of the proposed adaptive topology optimization algorithm. The results demonstrate significant advantages compared to existing similar algorithms..
| Medienart: |
|
|---|
Preprint| Erscheinungsjahr: |
2024 |
|---|---|
| Erschienen: |
2024 |
| Enthalten in: |
arXiv.org - (2024) vom: 04. März Zur Gesamtaufnahme - year:2024 |
|---|
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Fang, Xiao [VerfasserIn] |
|---|
| Links: |
Volltext [kostenfrei] |
|---|
| Themen: |
000 |
|---|
| Förderinstitution / Projekttitel: |
|
|---|
| PPN (Katalog-ID): |
XCH042741114 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | XCH042741114 | ||
| 003 | DE-627 | ||
| 005 | 20240306114424.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 240306s2024 xx |||||o 00| ||eng c | ||
| 035 | |a (DE-627)XCH042741114 | ||
| 035 | |a (chemrXiv)2403.01826 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Fang, Xiao |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A Novel Shortest Path Query Algorithm Based on Optimized Adaptive Topology Structure |
| 264 | 1 | |c 2024 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Urban rail transit is a fundamental component of public transportation, however, commonly station-based path search algorithms often overlook the impact of transfer times on search results, leading to decreased accuracy. To solve this problem, this paper proposes a novel shortest path query algorithm based on adaptive topology optimization called the Adaptive Topology Extension Road Network Structure (ATEN). This algorithm categorizes transfer stations into different types and treats travel time and transfer time equivalently as weights for edges in the topological graph. The proposed algorithm introduces virtual stations to differentiate between pedestrian paths and train paths, eliminating the need for additional operations on transfer stations. The algorithm controls the extent of expansion in the urban rail transit topology, overcoming query errors caused by mishandling of transfer stations in the existing algorithm. Finally, a series of simulation experiments were conducted on Beijing's urban rail transit network to validate both correctness and efficiency of the proposed adaptive topology optimization algorithm. The results demonstrate significant advantages compared to existing similar algorithms. | ||
| 650 | 4 | |a Computer Science - Computational Engineering; Finance; and Science |7 (dpeaa)DE-84 | |
| 650 | 4 | |a 000 |7 (dpeaa)DE-84 | |
| 700 | 1 | |a Song, Xuyang |4 aut | |
| 700 | 1 | |a Ma, Jiyuan |4 aut | |
| 700 | 1 | |a Liu, Guanhua |4 aut | |
| 700 | 1 | |a Pang, Shurong |4 aut | |
| 700 | 1 | |a Zhao, Wenbo |4 aut | |
| 700 | 1 | |a Cao, Cong |4 aut | |
| 700 | 1 | |a Fan, Ling |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t arXiv.org |g (2024) vom: 04. März |
| 773 | 1 | 8 | |g year:2024 |g day:04 |g month:03 |
| 856 | 4 | 0 | |u https://arxiv.org/abs/2403.01826 |z kostenfrei |3 Volltext |
| 912 | |a GBV_XCH | ||
| 951 | |a AR | ||
| 952 | |j 2024 |b 04 |c 03 | ||