Matches in SemOpenAlex for { <https://semopenalex.org/work/W658611349> ?p ?o ?g. }
Showing items 1 to 73 of
73
with 100 items per page.
- W658611349 abstract "We study the problem of serving shortest path (s.p.) information for large-scale transportation graphs (hundreds of thousands to millions of nodes) in the context of intelligent transportation systems (ITSs) and geographic information systems (GISs). In such systems, a database must serve queries of a specific sort-either path-based (“What is the shortest path from s to t?”) or direction-based (“What are the next arcs along this path?”)—with low latency and high throughput. Previous approaches to this problem have generally utilized massive preprocessing to tabulate a substantial portion of the solution to the all-pairs s.p. problem. Their applicability to large-scale real transportation graphs (>100,000 nodes) is limited by the storage required for preprocessed data, and/or the time required for these initial computations. In addition, they are generally unable to deal with dynamically changing traffic conditions for graphs of this size (i.e., they are static). Proposed heuristic solutions either do not guarantee optimality, or are outperformed by these other methods. We first design a static algorithm that utilizes a hierarchical data structure that can efficiently answer both directional and complete path queries. To achieve this goal, we also present a general purpose partitioning technique for transportation graphs with provable complexity bounds that are optimized for the construction of the hierarchical data structures for such navigation systems. We tested this algorithm on subgraphs of the transportation system of central Los Angeles. The results show that it either outperforms the previous well-known algorithms or has competitive performance while offering improved scalability with respect to space requirements. Our second algorithm is radically different from the large-scale algorithms previously proposed and is designed to adapt to changing traffic patterns. Its storage requirements and preprocessing time are both significantly lower than these other techniques-requiring seconds, for example, rather than hours on the transportation graph of Los Angeles. Yet our solution is competitive in performance on queries. We describe an implementation of this algorithm with experimental results based on the transportation graph of L.A. County." @default.
- W658611349 created "2016-06-24" @default.
- W658611349 creator A5052372644 @default.
- W658611349 creator A5075936145 @default.
- W658611349 date "1998-01-01" @default.
- W658611349 modified "2023-09-25" @default.
- W658611349 title "Efficient algorithms for navigation on large transportation graphs" @default.
- W658611349 hasPublicationYear "1998" @default.
- W658611349 type Work @default.
- W658611349 sameAs 658611349 @default.
- W658611349 citedByCount "0" @default.
- W658611349 crossrefType "book" @default.
- W658611349 hasAuthorship W658611349A5052372644 @default.
- W658611349 hasAuthorship W658611349A5075936145 @default.
- W658611349 hasConcept C11413529 @default.
- W658611349 hasConcept C132525143 @default.
- W658611349 hasConcept C154945302 @default.
- W658611349 hasConcept C162319229 @default.
- W658611349 hasConcept C166957645 @default.
- W658611349 hasConcept C173801870 @default.
- W658611349 hasConcept C199360897 @default.
- W658611349 hasConcept C205649164 @default.
- W658611349 hasConcept C22590252 @default.
- W658611349 hasConcept C2777735758 @default.
- W658611349 hasConcept C2779343474 @default.
- W658611349 hasConcept C34736171 @default.
- W658611349 hasConcept C41008148 @default.
- W658611349 hasConcept C77088390 @default.
- W658611349 hasConcept C80444323 @default.
- W658611349 hasConcept C88548561 @default.
- W658611349 hasConceptScore W658611349C11413529 @default.
- W658611349 hasConceptScore W658611349C132525143 @default.
- W658611349 hasConceptScore W658611349C154945302 @default.
- W658611349 hasConceptScore W658611349C162319229 @default.
- W658611349 hasConceptScore W658611349C166957645 @default.
- W658611349 hasConceptScore W658611349C173801870 @default.
- W658611349 hasConceptScore W658611349C199360897 @default.
- W658611349 hasConceptScore W658611349C205649164 @default.
- W658611349 hasConceptScore W658611349C22590252 @default.
- W658611349 hasConceptScore W658611349C2777735758 @default.
- W658611349 hasConceptScore W658611349C2779343474 @default.
- W658611349 hasConceptScore W658611349C34736171 @default.
- W658611349 hasConceptScore W658611349C41008148 @default.
- W658611349 hasConceptScore W658611349C77088390 @default.
- W658611349 hasConceptScore W658611349C80444323 @default.
- W658611349 hasConceptScore W658611349C88548561 @default.
- W658611349 hasLocation W6586113491 @default.
- W658611349 hasOpenAccess W658611349 @default.
- W658611349 hasPrimaryLocation W6586113491 @default.
- W658611349 hasRelatedWork W1996674269 @default.
- W658611349 hasRelatedWork W2092854824 @default.
- W658611349 hasRelatedWork W2150437713 @default.
- W658611349 hasRelatedWork W2274230925 @default.
- W658611349 hasRelatedWork W2319431290 @default.
- W658611349 hasRelatedWork W2396607911 @default.
- W658611349 hasRelatedWork W2603259888 @default.
- W658611349 hasRelatedWork W2734794335 @default.
- W658611349 hasRelatedWork W2782743306 @default.
- W658611349 hasRelatedWork W2912492336 @default.
- W658611349 hasRelatedWork W2952940422 @default.
- W658611349 hasRelatedWork W3008629102 @default.
- W658611349 hasRelatedWork W3022670307 @default.
- W658611349 hasRelatedWork W3082472256 @default.
- W658611349 hasRelatedWork W3097810589 @default.
- W658611349 hasRelatedWork W3112099211 @default.
- W658611349 hasRelatedWork W3123524401 @default.
- W658611349 hasRelatedWork W3136984306 @default.
- W658611349 hasRelatedWork W3149028926 @default.
- W658611349 hasRelatedWork W3199787876 @default.
- W658611349 isParatext "false" @default.
- W658611349 isRetracted "false" @default.
- W658611349 magId "658611349" @default.
- W658611349 workType "book" @default.