Share Email Print

Proceedings Paper

Shortest path algorithm for transit network considering walking between bus stops
Author(s): Nan Zhang; Hao Wang; Sida Luo; Min Fu; Yuechun Ge
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 3 December 2015
PDF: 8 pages
Proc. SPIE 9794, Sixth International Conference on Electronics and Information Engineering, 979416 (3 December 2015); doi: 10.1117/12.2201035
Show Author Affiliations
Nan Zhang, Southeast Univ. (China)
Hao Wang, Southeast Univ. (China)
Jiangsu Province Collaborative Innovation Ctr. (China)
Sida Luo, Southeast Univ. (China)
Min Fu, Southeast Univ. (China)
Yuechun Ge, Southeast Univ. (China)

Published in SPIE Proceedings Vol. 9794:
Sixth International Conference on Electronics and Information Engineering
Qiang Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top