Scipediacontent: Scipediacontent moved page Draft Content 566136653 to Fang et al 2019b

2021-02-12T12:50:27Z

Scipediacontent moved page Draft Content 566136653 to Fang et al 2019b

Scipediacontent: 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..."

2021-02-12T12:50:23Z

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..."

New page

== 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 ==
<pdf>Media:Draft_Content_566136653-beopen229-4863-document.pdf</pdf>

== Original document ==

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

* [http://dx.doi.org/10.1155/2019/8709042 http://dx.doi.org/10.1155/2019/8709042] under the license http://creativecommons.org/licenses/by/4.0/

* [https://doi.org/10.1155/2019/8709042 https://doi.org/10.1155/2019/8709042] under the license http://creativecommons.org/licenses/by/4.0

* [http://downloads.hindawi.com/journals/mpe/2019/8709042.pdf http://downloads.hindawi.com/journals/mpe/2019/8709042.pdf],
: [http://downloads.hindawi.com/journals/mpe/2019/8709042.xml http://downloads.hindawi.com/journals/mpe/2019/8709042.xml],
: [http://dx.doi.org/10.1155/2019/8709042 http://dx.doi.org/10.1155/2019/8709042] under the license cc-by

* [http://dx.doi.org/10.1155/2019/8709042 http://dx.doi.org/10.1155/2019/8709042],
: [https://doaj.org/toc/1024-123X https://doaj.org/toc/1024-123X],
: [https://doaj.org/toc/1563-5147 https://doaj.org/toc/1563-5147] under the license http://creativecommons.org/licenses/by/4.0/

* [https://www.hindawi.com/journals/mpe/2019/8709042 https://www.hindawi.com/journals/mpe/2019/8709042],
: [http://downloads.hindawi.com/journals/mpe/2019/8709042.pdf http://downloads.hindawi.com/journals/mpe/2019/8709042.pdf],
: [https://academic.microsoft.com/#/detail/2982908169 https://academic.microsoft.com/#/detail/2982908169]

← Older revision	Revision as of 12:50, 12 February 2021
(No difference)

Fang et al 2019b - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 566136653 to Fang et al 2019b

Scipediacontent: 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..."