Solving the K-shortest paths problem in timetable-based public transportation systems
Lists
Only you see this
Abstract
Finding the K-shortest paths in timetable-based public transportation systems is an important problem in practice. It has three typical variants: the K-earliest arrival problem (K-EAP), the K-short...
BibTeX
@article{wang2016solving,
author = {Shuai Wang and Yang Yang and Xiaolin Hu and Jianmin Li and Bingji Xu},
title = {{Solving the K-shortest paths problem in timetable-based public transportation systems}},
journal = {J. Intell. Transp. Syst.},
year = {2016},
doi = {10.1080/15472450.2015.1082911},
}Loading related content...