A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation
Theoretical research often assumes all users are homogeneous in their route choice decision and will always pick the route with the shortest travel cost, which is not necessarily the case in reality. This paper documents the research effort in developing a Constrained Time-Dependent K Shortest Paths Algorithm in order to find K Shortest Paths between two given locations. The goal of this research is to provide sound route options to travelers in order to assist their route choice decision process, during which the overlap and travel time deviation issues between the K paths will be considered. The proposed algorithm balancing overlap and travel time deviation is developed in this research. A numerical analysis is conducted on the Tucson I-10 network, the outcome of the case study shows that our proposed algorithm is able to find different shortest paths with a reasonable degree of similarity and close travel time, which indicates that the result of the proposed algorithm is satisfactory.
A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation
Theoretical research often assumes all users are homogeneous in their route choice decision and will always pick the route with the shortest travel cost, which is not necessarily the case in reality. This paper documents the research effort in developing a Constrained Time-Dependent K Shortest Paths Algorithm in order to find K Shortest Paths between two given locations. The goal of this research is to provide sound route options to travelers in order to assist their route choice decision process, during which the overlap and travel time deviation issues between the K paths will be considered. The proposed algorithm balancing overlap and travel time deviation is developed in this research. A numerical analysis is conducted on the Tucson I-10 network, the outcome of the case study shows that our proposed algorithm is able to find different shortest paths with a reasonable degree of similarity and close travel time, which indicates that the result of the proposed algorithm is satisfactory.
A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation
Xianbiao Hu, PhD (author) / Yi-Chang Chiu (author)
2015
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Shortest Paths in Stochastic Time-Dependent Networks with Link Travel Time Correlation
| British Library Online Contents | 2013
Shortest paths in randomly time varying networks
| IEEE | 2001
Shortest Paths in Randomly Time Varying Networks
| British Library Conference Proceedings | 2001
A Dynamic Shortest Path Algorithm Using Multi-Step Ahead Link Travel Time Prediction
| Taylor & Francis Verlag | 2004