원문정보
보안공학연구지원센터(IJGDC)
International Journal of Grid and Distributed Computing
Vol.9 No.6
2016.06
pp.137-148
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Transport with minimum time cost and distance remains to be an important research area in intelligent transport systems. Shortest path algorithms are primary methods to address simplified problems, which could not be well applied in high-dimensional real situations. We realized the minimum cost and maximum flow result via classical iterative algorithm based on graph theory, adjacency matrix is well applied to express the relationship between transport nodes, a topological sorting transport map is adopted to verify these approaches.
목차
Abstract
1. Introduction
2. Preliminary Results
2.1. Rudimental Principles Related to Graph Theory
2.2. Problem Description
3. Optimization Modeling
3.1. Dijkstra and Warshall-Floyd Algorithm
3.2. Graph Expression with Adjacency Matrix and Incidence Matrix
3.3 Graph Algorithm with Minimum Cost and Maximum Flow
4. Results Test with Topological Sorting of Transport
5. Conclusions
6. Related Works
Acknowledgements
References
1. Introduction
2. Preliminary Results
2.1. Rudimental Principles Related to Graph Theory
2.2. Problem Description
3. Optimization Modeling
3.1. Dijkstra and Warshall-Floyd Algorithm
3.2. Graph Expression with Adjacency Matrix and Incidence Matrix
3.3 Graph Algorithm with Minimum Cost and Maximum Flow
4. Results Test with Topological Sorting of Transport
5. Conclusions
6. Related Works
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보