Fast implementation of city optimal path

DOI

10.2991/mmebc-16.2016.2How to use a DOI?

Keywords

Optimal path; Time complexity; Dijkstra algorithm

Abstract

This paper gives a detailed analysis of the existing city shortest path algorithm[1], aiming at the high time complexity and can not represent the real situation of the problem of the existing city shortest path selection algorithm, and bases on the idea of Dijkstra algorithm, puts forwarda fast algorithm of optimal path of the city. This algorithm can be considered to simulate the real situation may in the road grade, the degree of congestion, traffic light quantity and other factors, at the same time can be optimized in the time complexity of the algorithm, to achieve the shortest path fast search. The experimental results show that this method can simulate the real situation in as far as possible under the condition, reduces the time complexity of the algorithm, and get feasible result.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xiaoyong Xu
AU  - Jiquan Zhou
PY  - 2016/06
DA  - 2016/06
TI  - Fast implementation of city optimal path
BT  - Proceedings of the 2016 6th International Conference on Machinery, Materials, Environment, Biotechnology and Computer
PB  - Atlantis Press
SP  - 7
EP  - 12
SN  - 2352-5401
UR  - https://doi.org/10.2991/mmebc-16.2016.2
DO  - 10.2991/mmebc-16.2016.2
ID  - Xu2016/06
ER  -