Processing time-dependent shortest path queries without pre-computed speed information on road networks-Reference-Cited by-同舟云学术

Processing time-dependent shortest path queries without pre-computed speed information on road networks

Published:2014-01 Issue: Volume:255 Page:135-154
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Kim Jinha,Han Wook-Shin,Oh Jinoh,Kim Sungchul,Yu Hwanjo

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference26 articles.

1. Network Flows: Theory, Algorithms, and Applications;Ahuja,1993

2. Linear Programming and Network OWS;Bazaraa,1990

3. On a routing problem;Bellman;Quarterly of Applied Mathematics,1958

4. Pattern Recognition and Machine Learning (Information Science and Statistics);Bishop,2006

5. Time-varying shortest path problems with constraints;Cai;Networks,1997

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A survey of route recommendations: Methods, applications, and opportunities;Information Fusion;2024-08

2. SRNN-RSA: a new method to solving time-dependent shortest path problems based on structural recurrent neural network and ripple spreading algorithm;Complex & Intelligent Systems;2024-03-05

3. A Time Impulse Neural Network Framework for Solving the Minimum Path Pair Problems of the Time-Varying Network;IEEE Transactions on Knowledge and Data Engineering;2023

4. A Novel Index Method for K Nearest Object Query over Time-Dependent Road Networks;Complexity;2019-02-24

5. Simplified Swarm Optimization for the Time Dependent Competitive Vehicle Routing Problem with Heterogeneous Fleet;2018 IEEE Congress on Evolutionary Computation (CEC);2018-07