Solution to Shortest Path Problem Using a Connective Probe Machine

Jiuyun Sun, Huanhe Dong, Yuan Kong and Yong Fang ()

Mathematical Problems in Engineering, 2019, vol. 2019, 1-8

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.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2019/8709042.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2019/8709042.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:8709042

DOI: 10.1155/2019/8709042

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().