Speeding Up Shortest Path Search in Public Transport Networks

被引：0

作者：

Martinek, Vladislav ^{[1
]}

Zemlicka, Michal ^{[1
]}

机构：

[1] Charles Univ Prague, Fac Math & Phys, Prague 11800 1, Czech Republic

来源：

DATESO 2009 - DATABASES, TEXTS, SPECIFICATIONS, OBJECTS: PROCEEDINGS OF THE 9TH ANNUAL INTERNATIONAL WORKSHOP | 2009年 / 471卷

关键词：

shortest path search in public transport networks; network simplification;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that speed up the given calculation. The approach, when the calculation is not performed on the original network but on the simplified one, seems to be very promising. The path found in the simplified network can be easily mapped to a corresponding path in the original network. In the case of the Prague public transport the simplified network has several times less nodes and the computation is speeded up correspondingly.

引用

页码：1 / 12

页数：12

共 50 条

[41] Speeding up the convergence of backpropagation networks
Sureerattanan, Songyot
Phien, Huynh Ngoc
IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings, 1998, : 651 - 654
[42] Speeding up the convergence of backpropagation networks
Sureerattanan, S
Phien, HN
APCCAS '98 - IEEE ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS: MICROELECTRONICS AND INTEGRATING SYSTEMS, 1998, : 651 - 654
[43] Shortest Path Search Algorithm in Optimal Two-Dimensional Circulant Networks: Implementation for Networks-on-Chip
Monakhova, Emilia A.
Romanov, Aleksandr Yu
Lezhnev, Evgenii V.
IEEE ACCESS, 2020, 8 : 215010 - 215019
[44] Network Model of the Shortest Path Selection in Transport
Dramski, Mariusz
Maka, Marcin
Uchacz, Waldemar
TELEMATICS - SUPPORT FOR TRANSPORT, 2014, 471 : 369 - 375
[45] Cost Effective ModLeach-A* Search Algorithm for Shortest Path Routing in Wireless Sensor Networks
Nanda, Arabinda
Rath, Amiya Kumar
2016 SIXTH INTERNATIONAL SYMPOSIUM ON EMBEDDED COMPUTING AND SYSTEM DESIGN (ISED 2016), 2016, : 147 - 151
[46] Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies
Monakhov, Oleg G.
Monakhova, Emilia A.
Romanov, Aleksandr Yu.
Sukhov, Andrej M.
Lezhnev, Evgenii V.
IEEE ACCESS, 2021, 9 : 160836 - 160846
[47] SHORTEST-PATH ALGORITHEM BASED ROBUST OPTIMIZATION TO PUBLIC TRANSPORT HUB ALLOCATION PLANNING
Zhang Yan
Wang Shining
2011 3RD INTERNATIONAL CONFERENCE ON COMPUTER TECHNOLOGY AND DEVELOPMENT (ICCTD 2011), VOL 1, 2012, : 365 - 369
[48] Path selection algorithm for shortest path bridging in access networks
Nakayama, Yu
Oota, Noriyuki
IEICE COMMUNICATIONS EXPRESS, 2013, 2 (10): : 396 - 401
[49] Improving the Cache-Efficiency of Shortest Path Search
Edelkamp, Stefan
KI 2017: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2017, 10505 : 99 - 113
[50] The weighted shortest path search in mobile GIS services
Peng, Min
Xiong, Naixue
Xie, Gang
Yang, Laurence T.
ADVANCES IN GRID AND PERVASIVE COMPUTING, PROCEEDINGS, 2008, 5036 : 384 - +

← 1 2 3 4 5 →