期刊名称：International Journal of Grid and Distributed Computing
印刷版ISSN：2005-4262
出版年度：2016
卷号：9
期号：6
页码：137-148
DOI：10.14257/ijgdc.2016.9.6.14
出版社：SERSC
摘要：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.
