Querying shortest paths on time dependent road networks
For real-world time dependent road networks (TDRNs), answering shortest path-based route
queries and plans in real-time is highly desirable by many industrial applications …
queries and plans in real-time is highly desirable by many industrial applications …
Diversified top-k route planning in road network
Route planning is ubiquitous and has a profound impact on our daily life. However, the
existing path algorithms tend to produce similar paths between similar OD (Origin …
existing path algorithms tend to produce similar paths between similar OD (Origin …
Fast query decomposition for batch shortest path processing in road networks
Shortest path query is a fundamental operation in various location-based services (LBS) and
most of them process queries on the server-side. As the business expands, scalability …
most of them process queries on the server-side. As the business expands, scalability …
Efficient 2-hop labeling maintenance in dynamic small-world networks
Shortest path computation is a fundamental operation in small-world networks and index-
based methods, especially 2-hop labeling, are commonly applied which have achieved high …
based methods, especially 2-hop labeling, are commonly applied which have achieved high …
An experimental evaluation and guideline for path finding in weighted dynamic network
Shortest path computation is a building block of various network applications. Since real-life
networks evolve as time passes, the Dynamic Shortest Path (DSP) problem has drawn lots …
networks evolve as time passes, the Dynamic Shortest Path (DSP) problem has drawn lots …
FHL-cube: multi-constraint shortest path querying with flexible combination of constraints
Multi-Constraint Shortest Path (MCSP) generalizes the classic shortest path from single to
multiple criteria such that more personalized needs can be satisfied. However, MCSP query …
multiple criteria such that more personalized needs can be satisfied. However, MCSP query …
Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory
For thousands of years, people have been innovating new technologies to make their travel
faster, the latest of which is GPS technology that is used by millions of drivers every day. The …
faster, the latest of which is GPS technology that is used by millions of drivers every day. The …
Time-dependent hop labeling on road network
Route scheduling on time-dependent road network is slow due to its problem complexity of
Ω (T (| V| log| V|+| E|)), where T is the size of the result's time-dependent function,| V| is the …
Ω (T (| V| log| V|+| E|)), where T is the size of the result's time-dependent function,| V| is the …
Efficient kNN query for moving objects on time-dependent road networks
In this paper, we study the Time-Dependent k Nearest Neighbor (TD-k NN) query on moving
objects that aims to return k objects arriving at the query location with the least traveling cost …
objects that aims to return k objects arriving at the query location with the least traveling cost …
Efficient constrained shortest path query answering with forest hop labeling
The Constrained Shortest Path (CSP) problem aims to find the shortest path between two
nodes in a road network subject to a given constraint on another attribute. It is typically …
nodes in a road network subject to a given constraint on another attribute. It is typically …