Abstract
This paper describes the parallel implementation of a traffic network model. A two-queue parallel shortest path algorithm is employed using recursive spectral bisection decomposition approach where each processor runs the same program but acts on a different subset of road network. The objective is to reduce the execution time of shortest path computing in dynamic traffic assignment. The model is parallelized and tested by 1, 2, 4, 8, 16 and 32 processors. The performances of the parallel model are discussed, and we think that two-queue parallel shortest path algorithm and recursevive spectral bisection approach are useful in solving shortest path problem of traffic network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chabini, I., Ganugapati, S.: Parallel algorithms for dynamic shortest path problems. International Transactions in Operational Research 9(3), 279–302 (2002)
Tremblay, N., Florian, M.: Temporal shortest paths: parallel computing implementations. Parallel Comput. 27, 1569–1609 (2001)
Simon, H.D.: Partitioning of unstructured problems for parallel processing. In: Proc. Conference on Parallel Methods on Large Scale Structural Analysis and Physics Applications. Pergammon Press, Oxford (1991)
Herberg, U.: Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2. In: 8th Annual Communication Networks and Services Research Conference (2010)
O’Cearbhaill, E.A., O’Mahony, M.: Parallel implementation of a transportation network model. Journal of Parallel and Distributed Computing 65, 1–14 (2005)
Fiedler, M.: Eigenvectors of acyclic matrices. Czechoslovak Math. J. 25(100), 607–618 (1975)
Fiedler, M.: A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J. 25(100), 619–633 (1975)
Parlett, B.N.: The Symmetric Eigenvalue Problem. Prentice Hall, New Jersey (1980)
Peng, Q.: The Shortest Path Parallel Algorithm on Single Source Weighted Multi-level Graph. In: Second International Workshop on Computer Science and Engineering (2009)
Altın, A.: Intra-domain traffic engineering with shortest path routing protocols. 4OR: A Quarterly Journal of Operations Research (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, L., Yang, Z., Jia, H., Wang, B., Chen, G. (2010). Test and Implement of a Parallel Shortest Path Calculation System for Traffic Network. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds) Information Computing and Applications. ICICA 2010. Communications in Computer and Information Science, vol 105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16336-4_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-16336-4_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16335-7
Online ISBN: 978-3-642-16336-4
eBook Packages: Computer ScienceComputer Science (R0)