Finding the \(K\) shortest paths in a schedule-based transit network

DOI10.1016/j.cor.2010.02.005zbMath1251.90073MaRDI QIDQ1761096

Rui Song, Wangtu Xu, Shiwei He, Sohail S. Chaudhry

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.02.005

zbMATH Keywords

schedule-based transit network; \(K\) shortest paths; time-window constraint; generalized cost

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B10: Deterministic network models in operations research

05C85: Graph algorithms (graph-theoretic aspects)

Uses Software

• TransCAD