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.展开更多
Compared with standard logit-based stochastic user equilibrium assignment model,the C-logit model describes route choice behavior in a more realistic way by considering the overlapping effect between routes.This paper...Compared with standard logit-based stochastic user equilibrium assignment model,the C-logit model describes route choice behavior in a more realistic way by considering the overlapping effect between routes.This paper investigates the inefficiency upper bounds of this model against the deterministic system optimum and the C-logit stochastic system optimum in terms of the total network travel time.It is found that the commonality factor of overlapping routes significantly affects the inefficiency bound,besides link congestion degree,total demand and the number of feasible routes.If the commonality factor is not considered,the efficiency loss resulting from selfishly stochastic travel behavior will be to large extent underestimated.展开更多
文摘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.
基金supported by the National Basic Research Program of China under Grant No.2012CB725401the National Natural Science Foundation of China under Grant Nos.71271001 and 71401083the Program for New Century Excellent Talents in University under Grant No.NCET-13-0025
文摘Compared with standard logit-based stochastic user equilibrium assignment model,the C-logit model describes route choice behavior in a more realistic way by considering the overlapping effect between routes.This paper investigates the inefficiency upper bounds of this model against the deterministic system optimum and the C-logit stochastic system optimum in terms of the total network travel time.It is found that the commonality factor of overlapping routes significantly affects the inefficiency bound,besides link congestion degree,total demand and the number of feasible routes.If the commonality factor is not considered,the efficiency loss resulting from selfishly stochastic travel behavior will be to large extent underestimated.
