Path Optimization Algorithms Based on Graph Theory
Path Optimization Algorithms Based on Graph Theory
复制标题
DOI：
10.14257/ijgdc.2016.9.6.14
复制
发表时间：
2016-06
影响因子：
--
通讯作者：
Biyuan Yao;Jianhua Yin;Hui Zhou;Wei Wu
中科院分区：
文献类型：
--
作者：
Biyuan Yao;Jianhua Yin;Hui Zhou;Wei Wu
以最短的时间成本和最短的距离进行交通运输一直是智能交通系统的重要研究方向。最短路径算法是解决简化问题的主要方法，但不能很好地应用于高维实际情况。通过基于图论的经典迭代算法实现了代价最小和流量最大的结果，利用邻接矩阵很好地表达了传输节点之间的关系，并采用拓扑排序传输图对这些方法进行了验证。
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.