3 December 2015 Shortest path algorithm for transit network considering walking between bus stops
Author Affiliations +
Proceedings Volume 9794, Sixth International Conference on Electronics and Information Engineering; 979416 (2015) https://doi.org/10.1117/12.2201035
Event: Sixth International Conference on Electronics and Information Engineering, 2015, Dalian, China
Abstract
Considering the travel time and transfer frequency, transit passengers will choose to walk between two bus stops within an acceptable distance, which was rarely discussed by previous research on transit shortest path problem. This paper proposes a practical shortest path algorithm taking walking behavior into consideration. The algorithm can describe passengers’ behavior when they select travel routes. The feasibility and efficiency of this algorithm has also been preliminarily tested through an example by comparing with the existing shortest path algorithms.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Nan Zhang, Nan Zhang, Hao Wang, Hao Wang, Sida Luo, Sida Luo, Min Fu, Min Fu, Yuechun Ge, Yuechun Ge, } "Shortest path algorithm for transit network considering walking between bus stops", Proc. SPIE 9794, Sixth International Conference on Electronics and Information Engineering, 979416 (3 December 2015); doi: 10.1117/12.2201035; https://doi.org/10.1117/12.2201035
PROCEEDINGS
8 PAGES


SHARE
Back to Top