Abstract
Abstract
As the development of Automotive, people are doing research on self-driving and innovation of public transportation. The coming of 5G will made these come true soon in the future. And this paper is about an algorithm useful on transportation. Using Dijkstra algorithm to match two people who have the similar source and destination, then find the shortest path for them. For each person, the source and destination are two regions but not two points. This paper includes some methods to implement Dijkstra algorithm in detail and two examples to display the results. The algorithm is written in C language.
Subject
General Physics and Astronomy
Reference10 articles.
1. A track optimization method based on genetic simulation annealing algorithm [J];Yan;Sichuan Journal of Military Engineering,2013
2. Shortest path with dynamic weight implementation using Dijkstra’s algorithm[J];Tamatjita;ComTech Computer Mathematics and Engineering Applications,2016
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献