随机道路网络中的 GPU 加速并行全对最短路径路由选择

IF 4.3 1区地球科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

International Journal of Geographical Information Science Pub Date : 2024-09-01 DOI:10.1080/13658816.2024.2394651

Wenwu Tang, Tianyang Chen, Marc P. Armstrong

引用次数: 0

摘要

随机道路网络中的全对最短路径路由通常比确定性网络中的路由更复杂，在计算上更具挑战性，因为旅行时间的不确定性...

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

GPU-accelerated parallel all-pair shortest path routing within stochastic road networks

All-pair shortest path routing within stochastic road networks is often more complicated and computationally challenging than routing in deterministic networks because uncertainties in travel time ...

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Geographical Information Science 地学-计算机：信息系统

CiteScore

11.00

自引率

7.00%

发文量

审稿时长

9 months

期刊介绍： International Journal of Geographical Information Science provides a forum for the exchange of original ideas, approaches, methods and experiences in the rapidly growing field of geographical information science (GIScience). It is intended to interest those who research fundamental and computational issues of geographic information, as well as issues related to the design, implementation and use of geographical information for monitoring, prediction and decision making. Published research covers innovations in GIScience and novel applications of GIScience in natural resources, social systems and the built environment, as well as relevant developments in computer science, cartography, surveying, geography and engineering in both developed and developing countries.