Chapter
Apr 26, 2012
The Relative Performance of Time-Dependent Shortest Paths Algorithms: A Network Expansion Perspective
Authors: Yu Nie, Xiaojian Nie, and H. M. ZhangAuthor Affiliations
Publication: Applications of Advanced Technologies in Transportation Engineering (2004)
Abstract
This paper studies three types of algorithms for computing all-to-one time-dependent shortest paths for all departure times on a discrete time dynamic network: the CLASSIC algorithms (direct extensions of static shortest path algorithms), the decreasing order of time (DOT) algorithm and the STEN algorithm based on an explicit network expansion. All algorithms are analyzed under the same type of compact space-time expansion networks, and implemented in a flexible and extendable framework using object-oriented programming (OOP) concepts. Two types of randomly generated networks similar to those found in real transportation systems are used for evaluating the relative performance of the studied algorithms. Our numerical results show a discrepancy between DOT's theoretical and practical computational efficiency, and STEN's computational tractability in applications involving large-size networks and demanding strict acyclicity.
Get full access to this article
View all available purchase options and get full access to this chapter.
Information & Authors
Information
Published In
Copyright
© 2004 American Society of Civil Engineers.
History
Published online: Apr 26, 2012
Permissions
Request permissions for this article.
Authors
Affiliations
Yu Nie
Department of Civil and Environmental Engineering, University of California, Davis, California 95616
Xiaojian Nie
Department of Civil and Environmental Engineering, University of California, Davis, California 95616
H. M. Zhang
CKS Professor, School of Transportation Engineering, Tongji University, Shanghai, China
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
View Options
Get Access
Access content
Please select your options to get access
Log in/Register
Log in via your institution (Shibboleth)
ASCE Members:
Please log in to see member pricing
Purchase
Save for later Item saved, go to cart Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.
Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
Get Access
Access content
Please select your options to get access
Log in/Register
Log in via your institution (Shibboleth)
ASCE Members:
Please log in to see member pricing
Purchase
Save for later Item saved, go to cart Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.
Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.