By Topic

A dynamic shortest path algorithm based on real-time traffic information in the urban public transit network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zihui Zang ; School of Economics and Commerce, South China University of Technology, Guangzhou, China ; Wenxue Cai

In this paper, a new improved dynamic algorithm is proposed to find the optimal path in transit network, which uses the shortest travel time as primary object and least transfer times as second object. And the impacts of the real-time traffic information to the roads' smooth, the passenger's transfer times and changing price of public transportation line to the travel time are also taken into consideration in the new dynamic algorithm. A simple numerical example is given to show the new algorithm's efficiency.

Published in:

Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on  (Volume:2 )

Date of Conference:

12-15 Oct. 2008