Bing Liu and Jimmy Tay. Integrating knowledge-based and algorithmic approaches for route finding. Forthcoming Report, 1995.  Home/Search   Document Not in Database   Summary   Related Articles

....1986] S2 [Dial et al. 1979; Gallo, and Pallottino, 1986] and A [Pearl, 1988] S12 [Helgason et al. 1993] S22 [Helgason et al. 1993] bi directional A [Pohl, 1971] For road networks, A is the most efficient algorithm. Interested reader, please see their performance comparisons in [Liu and Tay, 1995]. Although these algorithms are relatively efficient, applying them directly to route finding is not appropriate. They are wasteful in terms of computation as in real situations it is not necessary to search through the whole network in order to find the solution. They may produce solutions ....

....associated with its grid sub network. Linking each grid sub network to MRN in (2) of Step 1 or Step 2 is only linear to the number of major network nodes that surround the grid. The computation required is very small and negligible. Implementation details of this link up operation can be found in [Liu and Tay, 1995]. Step 4 is also negligible. So, the main computation comes from the shortest path algorithm (e.g. A ) Because the number of nodes and arcs have been substantially reduced, it will run much faster than with the complete network. Method 2. The algorithm for this method is almost the same as that ....

[Article contains additional citation context not shown here]

Bing Liu and Jimmy Tay. Integrating knowledge-based and algorithmic approaches for route finding. Forthcoming Report, 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC