Hybrid shortest path algorithm for vehicle navigation-Reference-Cited by-同舟云学术

Hybrid shortest path algorithm for vehicle navigation

Published:2008-12-12 Issue:2 Volume:49 Page:234-247
ISSN:0920-8542
Container-title:The Journal of Supercomputing
language:en
Short-container-title:J Supercomput

Author:

Cho Hsun-Jung,Lan Chien-Lun

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Information Systems,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s11227-008-0236-7.pdf

Reference21 articles.

1. Meyer U (2001) Single-source shortest-paths on arbitrary directed graphs in linear average-case time. In: Proceeding of 12th annual ACM-SIAM symposium on discrete algorithms, 2001, pp 797–806

2. Wagner D, Willhalm T (2003) Geometric speed-up techniques for finding shortest paths in large sparse graphs. Lect Notes Comput Sci 2832:776–787

3. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271. doi: 10.1007/BF01386390

4. Whiting PD, Hillier JA (1960) A method for finding the shortest route through a road network. Oper Res Q 11:37–40

5. Dail BR (1969) Algorithm 360:shortest path forest with topological ordering. Commun Assoc Comput Mach 12:632–633

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving the Shortest Path Problem with QAOA;SPIN;2023-01-31

2. A Hierarchical Algorithm for In-city Parking Allocation Based on Open Street Map and AnyLogic Software;Arabian Journal for Science and Engineering;2023-01-19

3. Route recommendation for evacuation networks using MMPP/M/1/N queueing models;Computer Communications;2022-03

4. Smartphone-based parking guidance algorithm and implementation;Journal of Intelligent Transportation Systems;2021-01-19

5. Bounding Box Approach to Network Pruning for Efficient Path Search through Large Networks;Journal of Computing in Civil Engineering;2017-09