A fast algorithm for finding K shortest paths using generalized spur path reuse technique-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A fast algorithm for finding K shortest paths using generalized spur path reuse technique

Published:2020-10-29 Issue:1 Volume:25 Page:516-533
ISSN:1361-1682
Container-title:Transactions in GIS
language:en
Short-container-title:Transactions in GIS

Author:

Chen Bi Yu¹²³^ORCID,Chen Xiao‐Wei¹²³,Chen Hui‐Ping¹²³,Lam William H. K.³

Affiliation:

1. State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing Wuhan University Wuhan China

2. Collaborative Innovation Center of Geospatial Technology Wuhan China

3. Department of Civil and Environmental Engineering The Hong Kong Polytechnic University Kowloon Hong Kong

Funder

National Natural Science Foundation of China

Publisher

Wiley

Subject

General Earth and Planetary Sciences

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/tgis.12699

Reference28 articles.

1. Solving the -shortest path problem with time windows in a time varying network

2. On a routing problem

3. Efficient algorithm for finding k shortest paths based on re-optimization technique

4. Finding Reliable Shortest Paths in Road Networks Under Uncertainty

5. Finding the k reliable shortest paths under travel time uncertainty

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithm for finding subcritical paths on network diagrams;Russian Technological Journal;2023-02-03

2. Vulnerability Analysis of Urban Rail Transit Network considering Cascading Failure Evolution;Journal of Advanced Transportation;2022-04-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP