(Created page with " == Abstract == With the continuous urban scale expansion, traffic networks have become extremely complex. Finding an optimal route in the shortest time has become a difficul...")
 
m (Scipediacontent moved page Draft Content 566136653 to Fang et al 2019b)
 
(No difference)

Latest revision as of 14:50, 12 February 2021

Abstract

With the continuous urban scale expansion, traffic networks have become extremely complex. Finding an optimal route in the shortest time has become a difficult and important issue in traffic engineering study. In this study, a novel computing model, namely, probe machine, is used to solve this problem. Similar to previous studies, urban transport networks can be abstracted into maps, in which points representing places of origin, destinations, and other buildings constitute the data library and edges representing the road make up the probe library. The true solution can be obtained after one probe operation on the computing platform. And by comparing the solving process with Dijkstra’s and Floyd’s algorithms, the computing efficiency of the probe machine is clearly superior, although all three methods can solve the shortest path problem and obtain the same solution.

Document type: Article

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document

Original document

The different versions of the original document can be found in:

http://downloads.hindawi.com/journals/mpe/2019/8709042.xml,
http://dx.doi.org/10.1155/2019/8709042 under the license cc-by
https://doaj.org/toc/1024-123X,
https://doaj.org/toc/1563-5147 under the license http://creativecommons.org/licenses/by/4.0/
http://downloads.hindawi.com/journals/mpe/2019/8709042.pdf,
https://academic.microsoft.com/#/detail/2982908169
Back to Top

Document information

Published on 01/01/2019

Volume 2019, 2019
DOI: 10.1155/2019/8709042
Licence: Other

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?