Cargando…
Shortest Path Algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model
Accurate and fast path calculation is essential for applications such as vehicle navigation systems and transportation network routing. Although many shortest path algorithms for restricted search areas have been developed in the past ten years to speed up the efficiency of path query, the performan...
Autores principales: | Wei, Haitao, Zhang, Shusheng, He, Xiaohui |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7795470/ https://www.ncbi.nlm.nih.gov/pubmed/33396895 http://dx.doi.org/10.3390/s21010203 |
Ejemplares similares
-
Shortest Paths in Multiplex Networks
por: Ghariblou, Saeed, et al.
Publicado: (2017) -
Euclidean shortest paths: exact or approximate algorithms
por: Li, Fajie, et al.
Publicado: (2014) -
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
por: Zhang, Xiaoge, et al.
Publicado: (2014) -
Shortest path counting in probabilistic biological networks
por: Ren, Yuanfang, et al.
Publicado: (2018) -
Detecting the outbreak of influenza based on the shortest path of dynamic city network
por: Chen, Yingqi, et al.
Publicado: (2020)