Theoretical research often assumes all users arc 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 document...Theoretical research often assumes all users arc 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 inorder 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 1-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.展开更多
文摘Theoretical research often assumes all users arc 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 inorder 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 1-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.
