Solving the K-shortest paths problem in timetable-based public transportation systems-Reference-Cited by-同舟云学术

Solving the K-shortest paths problem in timetable-based public transportation systems

Published:2015-09-23 Issue:5 Volume:20 Page:413-427
ISSN:1547-2450
Container-title:Journal of Intelligent Transportation Systems
language:en
Short-container-title:Journal of Intelligent Transportation Systems

Author:

Wang Shuai¹,Yang Yang²,Hu Xiaolin¹,Li Jianmin¹,Xu Bingji²

Affiliation:

1. State Key Laboratory of Intelligent Technology and Systems, Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Computer Science and Technology, Tsinghua University, Beijing, China

2. School of Information Technology, China University of Geosciences, Beijing, China

Publisher

Informa UK Limited

Subject

Applied Mathematics,Computer Science Applications,Aerospace Engineering,Automotive Engineering,Information Systems,Software,Control and Systems Engineering

Link

https://www.tandfonline.com/doi/pdf/10.1080/15472450.2015.1082911

Reference24 articles.

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

1. Finding single-source shortest paths from unweighted directed graphs combining rough sets theory and marking strategy;Journal of Applied Mathematics and Computing;2024-08-03

2. Offline Key Station and Path Impedance Based Subway Route Recommendation Method;Hans Journal of Data Mining;2022

3. A COMPUTATION METHOD ON TIME-DEPENDENT ACCESSIBILITY OF URBAN RAIL TRANSIT NETWORKS FOR THE LAST SERVICE;Transport;2020-02-26

4. A Smart Path Recommendation Method for Metro Systems With Passenger Preferences;IEEE Access;2020

5. Generating Travel Plan Sets in a High-Speed Railway Network With Complex Timetables and Transfers;IEEE Access;2020