Abstract
The paper present a new approach of calculating the shortest paths, the approach was named as SPM (the shortest paths’ matrix). Compared to the past approaches, SPM introduced distances into a matrix and could show activity distances directly in elements of the matrix and improved efficiency. The definition, operating rules of SPM and others related to SPM were described in this paper. At the end, the approach was applied to practical processes, the shortest paths were found out quickly. The approach provided a new resolution to the calculation of the shortest paths.
This work is partially supported by The National Natural Science Fund Grant #70771021 and Grant #60821063 to Prof. Dingwei Wang.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Sedgewick, R., Flajoler, P.: An Introduction to the Analysis of Algorithms. Addison-Wesley Professional, USA (2006)
Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Thomson, USA (2006)
Yu, D., Zhang, Q., Ma, S., et al.: Optimized Dijkstra Algorithm. J. Computer Engineering 30(22), 145–146 (2004)
Guha, S., Kettinger, W.J., Teng, J.T.C.: Business Process Reengineering Building a Comprehensive Methodology. J. Information System Management, 13–22 (1993)
Zhang, Z.-h., Wang, D.-w.: BPR-Based Business Operation Procedure in Electronic Brokering. J. Journal of Northeastern University (Natural Science) 26(11), 1029–1032 (2005)
Wang, L.: Systems engineering theory methods and applying, pp. 35–40. Higher Education Press, Beijing (2004)
Steward, D.V.: The design structure system: A method for managing the design of complex systems. J. IEEE Trans. Engineering Management 78(3), 71–74 (1981)
Wang, D., Tang, Z., Ip, W.H., et al.: A Human-Computer Interactive Approach based on Activity-Section Analysis for BPR. J. Production Planning and Control 11(8), 789–796 (2000)
Xu, L.-n., Zhang, H.-m., Xu, W.-s., et al.: Application of DSM-based Process Reengineering in Multidisciplinary Cooperative Design. In: The 9th International Conference on Computer Supported Cooperative Work in Design Proceedings, pp. 961–965 (2005)
Cho, S.-H., Eppinger, S.D.: A Simulation-Based Process Model for Managing Complex Design Projects. IEEE Trans. Engineering Management 52(3), 316–328 (2005)
Tian, J., Gui, L., Li, Z.-g.: A approach for transport problem combining the shortest path method. Highways & Automotive Applications 3(125), 57–58 (2008)
Weimin, Y., Weimin, W.: Data Structure. Tsinghua University Press, Beijing (2002)
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
Yuan, H., Wang, D. (2010). Calculating the Shortest Paths by Matrix Approach. In: Zhang, L., Lu, BL., Kwok, J. (eds) Advances in Neural Networks - ISNN 2010. ISNN 2010. Lecture Notes in Computer Science, vol 6063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13278-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-13278-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13277-3
Online ISBN: 978-3-642-13278-0
eBook Packages: Computer ScienceComputer Science (R0)