Earticle

초록

영어

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

키워드

저자

• Biyuan Yao [ College of Information Science and Technology, Hainan University,Haikou 570228, China ]
• Jianhua Yin [ College of Information Science and Technology, Hainan University,Haikou 570228, China ] Corresponding author
• Hui Zhou [ College of Information Science and Technology, Hainan University,Haikou 570228, China ]
• Wei Wu [ College of Information Science and Technology, Hainan University,Haikou 570228, China, Institute of Deep-sea Science and Engineering, Chinese Academy of Sciences, Sanya 572000, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605