𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding shortest paths on real road networks: the case for A*

✍ Scribed by Zeng, W.; Church, R. L.

Book ID
111864417
Publisher
Taylor and Francis Group
Year
2009
Tongue
English
Weight
298 KB
Volume
23
Category
Article
ISSN
1365-8824

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On finding shortest paths in nonnegative
On finding shortest paths in nonnegative networks
✍ A. Rosenthal 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 438 KB

A modification of Dantzig's algorithm for the all! pairs shortest paths problem is given. The new algorithm applies only to graphs with nonnegative arc lengths. For an IV-node compkte graph ir has a worst case running time of fN3 triple operations of the form D-: = min(D--D-~+D~$ and iv" log N other

A utility measure for finding multiobjec
A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
✍ Paola Modesti; Anna Sciomachen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 334 KB

In this paper we study the problem of ®nding Origin±Destination (O±D) shortest paths in urban multimodal transportation networks, aiming at minimizing the overall cost, time and users' discommodity associated with the required paths. We present an approach based on the classical shortest path proble

On the complexity of finding paths in a
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
✍ Arthur W. Chou; Ker-I Ko 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

## Abstract The computational complexity of finding a shortest path in a two‐dimensional domain is studied in the Turing machine‐based computational model and in the discrete complexity theory. This problem is studied with respect to two formulations of polynomial‐time computable two‐dimensional do