A data-driven and optimal bus scheduling model with time-dependent traffic and demand

Y Wang, D Zhang, L Hu, Y Yang… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Urban bus companies have collected a tremendous amount of travel data from passengers
in the past years. In spite of great value for bus schedule optimization, these data have not …

[HTML][HTML] Spatial Data Intelligence and City Metaverse: a Review

X Meng, Y Li, K Liu, Y Liu, B Yang, X Song, G Liao… - Fundamental …, 2023 - Elsevier
Abstract Spatial Data Intelligence (SDI) encompasses acquiring, storing, analyzing, mining,
and visualizing spatial data to gain insights into the physical world and uncover valuable …

Spatial data quality in the Internet of Things: Management, exploitation, and prospects

H Li, H Lu, CS Jensen, B Tang… - ACM Computing Surveys …, 2022 - dl.acm.org
With the continued deployment of the Internet of Things (IoT), increasing volumes of devices
are being deployed that emit massive spatially referenced data. Due in part to the dynamic …

Continuous trajectory similarity search for online outlier detection

D Zhang, Z Chang, S Wu, Y Yuan… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
In this paper, we study a new variant of trajectory similarity search from the context of
continuous query processing. Given a moving object from to, following a reference route, we …

Quegel: A general-purpose query-centric framework for querying big graphs

D Yan, J Cheng, MT Özsu, F Yang, Y Lu, J Lui… - arXiv preprint arXiv …, 2016 - arxiv.org
Pioneered by Google's Pregel, many distributed systems have been developed for large-
scale graph analytics. These systems expose the user-friendly" think like a vertex" …

Distributed shortest path query processing on dynamic road networks

D Zhang, D Yang, Y Wang, KL Tan, J Cao, HT Shen - The VLDB Journal, 2017 - Springer
Shortest path query processing on dynamic road networks is a fundamental component for
real-time navigation systems. In the face of an enormous volume of customer demand from …

Distributed processing of k shortest path queries over dynamic road networks

Z Yu, X Yu, N Koudas, Y Liu, Y Li, Y Chen… - Proceedings of the 2020 …, 2020 - dl.acm.org
The problem of identifying the k-shortest paths (KSPs for short) in a dynamic road network is
essential to many location-based services. Road networks are dynamic in the sense that the …

T-PORP: a trusted parallel route planning model on dynamic road networks

B Li, T Dai, W Chen, X Song, Y Zang… - IEEE Transactions …, 2022 - ieeexplore.ieee.org
Route planning over dynamic road networks is an increasingly fundamental problem of
modern transportation systems for human society, especially in the field of Intelligent Supply …

A Distributed Solution for Efficient K Shortest Paths Computation Over Dynamic Road Networks

Z Yu, X Yu, N Koudas, Y Chen… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
The problem of identifying the k-shortest paths (KSPs for short) in a dynamic road network is
essential to many location-based services. Road networks are dynamic in the sense that the …

A novel vector-based dynamic path planning method in urban road network

Z Cai, X Cui, X Su, Q Mi, L Guo, Z Ding - IEEE Access, 2019 - ieeexplore.ieee.org
The optimal path planning is one of the hot spots in the research of intelligence
transportation and geographic information systems. There are many productions and …