Shortest path algorithm for transit network considering walking between bus stops

Nan Zhang; Hao Wang; Sida Luo; Min Fu; Yuechun Ge

doi:10.1117/12.2201035

3 December 2015 Shortest path algorithm for transit network considering walking between bus stops

Nan Zhang, Hao Wang, Sida Luo, Min Fu, Yuechun Ge

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.

Citation Download Citation

Nan Zhang, Hao Wang, Sida Luo, Min Fu, and 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); https://doi.org/10.1117/12.2201035

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available