In order to investigate the effect of the use of battery electric vehicles on traffic dynamics,the valid paths of electric battery vehicles are defined and a check-based method is proposed to obtain them.Then,assuming...In order to investigate the effect of the use of battery electric vehicles on traffic dynamics,the valid paths of electric battery vehicles are defined and a check-based method is proposed to obtain them.Then,assuming that travelers only focus on their past travel experience,a day-to-day traffic assignment model is established based on reinforcement learning and bounded rationality.In the proposed model,the Bush-Mosteller model,a reinforcement learning model,is modified to calculate path choice probability according to bounded rationality.The modified model updates the path choice probability only if the gap between expected travel time and perceived travel time is beyond the cognitive threshold.Numerical experiments validate the effectiveness of the model and show that traffic flows can converge to the equilibrium in any case of cognitive thresholds and penetration rates of battery electric vehicles.The cognitive threshold has a positive influence on the variation of traffic flows while it has a negative influence on the differences between traffic flows.The adaptation of battery electric vehicles leads to the poor performance of the traffic system.展开更多
In this paper,we propose an improved walk search strategy to solve the constrained shortest path problem.The proposed search strategy is a local search algorithm which explores a network by walker navigating through t...In this paper,we propose an improved walk search strategy to solve the constrained shortest path problem.The proposed search strategy is a local search algorithm which explores a network by walker navigating through the network.In order to analyze and evaluate the proposed search strategy,we present the results of three computational studies in which the proposed search algorithm is tested.Moreover,we compare the proposed algorithm with the ant colony algorithm and k shortest paths algorithm.The analysis and comparison results demonstrate that the proposed algorithm is an effective tool for solving the constrained shortest path problem.It can not only be used to solve the optimization problem on a larger network,but also is superior to the ant colony algorithm in terms of the solution time and optimal paths.展开更多
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.展开更多
The A＇Prune quality of service （QoS） routing algorithm was proposed to compute K-shortest paths satisfying multiple QoS constraints, The A＇Prune is considered to be one of the practical routing algorithms for inte...The A＇Prune quality of service （QoS） routing algorithm was proposed to compute K-shortest paths satisfying multiple QoS constraints, The A＇Prune is considered to be one of the practical routing algorithms for intelligent optical networks because of its flexibility in handling many practical constraints, This article gives detailed performance studies of the algorithm through extensive simulation experiments. We found that both the running time and the memory space requirements of the algorithm are large, especially when the network size increases, in this article, we also propose an approach to improving the performance of the A＇Prune algorithm. The improvements should make the A＇Prune algorithm more attractive for practical use in intelligent optical networks.展开更多
基金The National Natural Science Foundation of China(No.51478110)Postgraduate Research & Practice Innovation Program of Jiangsu Province(No.KYCX18_0139)
文摘In order to investigate the effect of the use of battery electric vehicles on traffic dynamics,the valid paths of electric battery vehicles are defined and a check-based method is proposed to obtain them.Then,assuming that travelers only focus on their past travel experience,a day-to-day traffic assignment model is established based on reinforcement learning and bounded rationality.In the proposed model,the Bush-Mosteller model,a reinforcement learning model,is modified to calculate path choice probability according to bounded rationality.The modified model updates the path choice probability only if the gap between expected travel time and perceived travel time is beyond the cognitive threshold.Numerical experiments validate the effectiveness of the model and show that traffic flows can converge to the equilibrium in any case of cognitive thresholds and penetration rates of battery electric vehicles.The cognitive threshold has a positive influence on the variation of traffic flows while it has a negative influence on the differences between traffic flows.The adaptation of battery electric vehicles leads to the poor performance of the traffic system.
基金supported by the National Natural Science Foundation of China(Grant Nos.60634010 and 60776829)the State Key Laboratory of Rail Traffic Control and Safety(Contract No.RCS2008ZZ001),Beijing Jiaotong University
文摘In this paper,we propose an improved walk search strategy to solve the constrained shortest path problem.The proposed search strategy is a local search algorithm which explores a network by walker navigating through the network.In order to analyze and evaluate the proposed search strategy,we present the results of three computational studies in which the proposed search algorithm is tested.Moreover,we compare the proposed algorithm with the ant colony algorithm and k shortest paths algorithm.The analysis and comparison results demonstrate that the proposed algorithm is an effective tool for solving the constrained shortest path problem.It can not only be used to solve the optimization problem on a larger network,but also is superior to the ant colony algorithm in terms of the solution time and optimal paths.
文摘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.
文摘The A＇Prune quality of service （QoS） routing algorithm was proposed to compute K-shortest paths satisfying multiple QoS constraints, The A＇Prune is considered to be one of the practical routing algorithms for intelligent optical networks because of its flexibility in handling many practical constraints, This article gives detailed performance studies of the algorithm through extensive simulation experiments. We found that both the running time and the memory space requirements of the algorithm are large, especially when the network size increases, in this article, we also propose an approach to improving the performance of the A＇Prune algorithm. The improvements should make the A＇Prune algorithm more attractive for practical use in intelligent optical networks.
