A survey of route recommendations: Methods, applications, and opportunities
Nowadays, with advanced information technologies deployed citywide, large data volumes
and powerful computational resources are intelligentizing modern city development. As an …
and powerful computational resources are intelligentizing modern city development. As an …
A time impulse neural network framework for solving the minimum path pair problems of the time-varying network
W Huang, Y Wang, L Zhu - IEEE transactions on knowledge …, 2022 - ieeexplore.ieee.org
The minimum path pair (MPP) query problem is to find the optimal meeting point of two
minimum paths for two users in a network, where each user's minimum path has its own …
minimum paths for two users in a network, where each user's minimum path has its own …
A time-delay neural network for solving time-dependent shortest path problem
W Huang, C Yan, J Wang, W Wang - Neural Networks, 2017 - Elsevier
This paper concerns the time-dependent shortest path problem, which is difficult to come up
with global optimal solution by means of classical shortest path approaches such as Dijkstra …
with global optimal solution by means of classical shortest path approaches such as Dijkstra …
A novel model for the time dependent competitive vehicle routing problem: Modified random topology particle swarm optimization
This paper presents a novel model for a time dependent vehicle routing problem when there
is a competition between distribution companies for obtaining more sales. In a real-world …
is a competition between distribution companies for obtaining more sales. In a real-world …
Optimal time-dependent sequenced route queries in road networks
CF Costa, MA Nascimento, JAF Macêdo… - Proceedings of the 23rd …, 2015 - dl.acm.org
In this paper we present an algorithm for optimal processing of time-dependent sequenced
route queries in road networks, ie, given a road network where the travel time over an edge …
route queries in road networks, ie, given a road network where the travel time over an edge …
[PDF][PDF] Simulation of real-time path planning for large-scale transportation network using parallel computation
J Liu, X Kang, C Dong, F Zhang - Intelligent Automation & Soft …, 2019 - cdn.techscience.cn
To guarantee both the efficiency and accuracy of the transportation system, the real-time
status should be analyzed to provide a reasonable plan for the near future. This paper …
status should be analyzed to provide a reasonable plan for the near future. This paper …
[HTML][HTML] SRNN-RSA: a new method to solving time-dependent shortest path problems based on structural recurrent neural network and ripple spreading algorithm
S Yu, Y Song - Complex & Intelligent Systems, 2024 - Springer
Influenced by external factors, the speed of vehicles in the traffic network is changing all the
time, which makes the traditional static shortest route unable to meet the real logistics …
time, which makes the traditional static shortest route unable to meet the real logistics …
A Novel Index Method for K Nearest Object Query over Time‐Dependent Road Networks
K nearest neighbor (kNN) search is an important problem in location-based services (LBS)
and has been well studied on static road networks. However, in real world, road networks …
and has been well studied on static road networks. However, in real world, road networks …
基于时间的关键字路网路径规划.
卢航， 李艳红， 黄金亮 - Journal of South-Central Minzu …, 2024 - search.ebscohost.com
摘要为了便于道路网距离的计算, 对象文本信息和时间信息的组织和快速获取, 改进G-Tree,
在索引结构上增加时间戳和倒排序列相关信息, 称包含时间戳和倒排序列相关信息的G-Tree …
在索引结构上增加时间戳和倒排序列相关信息, 称包含时间戳和倒排序列相关信息的G-Tree …
Efficient processing of continuous min–max distance bounded query with updates in road networks
YK Huang, LF Lin - Information Sciences, 2014 - Elsevier
In the last decade, the research community focuses on the design of various methods in
support of spatio-temporal queries in road networks. In this paper, we present a novel and …
support of spatio-temporal queries in road networks. In this paper, we present a novel and …