In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on ...In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on arcs. Using an example, we illustrate the application of the algorithm and show that Beckmann’s formula is a sufficient condition only, not a necessary condition, for traffic equilibrium with capacity constraints of arcs.展开更多
Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes w...Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes were proposed.The methods of step-size searching and bush construction are proved to be practical.The modified OUE algorithm procedure was also optimized to take the advantage of multi-thread process.Convergence performances were compared with those of other algorithms by different sizes of urban transportation networks.The result shows this modified OUE algorithm is more efficient and consumes less time to achieve the reasonable relative gap in practical applications.展开更多
Improving transportation system is essential for all people in each city since transport plays a very important role.Using mathematical programming approach transport problem is an effective way to improve transportat...Improving transportation system is essential for all people in each city since transport plays a very important role.Using mathematical programming approach transport problem is an effective way to improve transportation system.In this paper,the traffic equilibrium problem(TEP)with a general nonadditive route cost function is studied.We formulate the route cost function for each route as a disutility function,which can evaluate route cost function flexibly and analyze the route toll conveniently.Furthermore,we present the TEP with a nonlinear complementary problem(NCP)formulation.The monotonicity and the existence with the NCP formulation are also given under relative assumptions.展开更多
在这份报纸，我们使用变化方法为多班，有一般使用费的多标准交通平衡和时间的价值的一个分离集合学习用户平衡的效率损失。由介绍三重要参数 ters k 1， k 2， k 3，当使用费被考虑并且没看作系统费用的部分时，我们为这个问题导出混...在这份报纸，我们使用变化方法为多班，有一般使用费的多标准交通平衡和时间的价值的一个分离集合学习用户平衡的效率损失。由介绍三重要参数 ters k 1， k 2， k 3，当使用费被考虑并且没看作系统费用的部分时，我们为这个问题导出混乱的价格的几界限，与基于费用的标准。展开更多
传统电动汽车充电负荷建模通常采用对电动汽车个体进行抽样模拟的方式,未能从分析机理的角度描述电动汽车群体相互作用形成的宏观运行状态。为此,提出一种基于半动态交通均衡模型和组合荷电状态(combined states of the charge,CSOC)概...传统电动汽车充电负荷建模通常采用对电动汽车个体进行抽样模拟的方式,未能从分析机理的角度描述电动汽车群体相互作用形成的宏观运行状态。为此,提出一种基于半动态交通均衡模型和组合荷电状态(combined states of the charge,CSOC)概率计算的电动汽车充电负荷概率分布计算方法。首先,分析电动汽车的交通特性和充电特性,并提出一种可行路径集构建方法;然后,引入交通均衡理论进行电动汽车空间分布建模,建立考虑随机效用的半动态交通均衡模型,实现宏观交通流均衡分配。进一步地,从理论层面分析电动汽车群的荷电状态变化,建立基于CSOC的充电负荷概率分布计算模型。最后,分别在13节点路网和实际大路网中验证所提方法的有效性,并分析了电动汽车渗透率和路网结构对充电负荷概率分布的影响。展开更多
In this article, we consider the multiclass network equilibrium problems. A so called strongly valid toll can support any multiclass user equilibrium flow pattern as a system minimum when the system objective function...In this article, we consider the multiclass network equilibrium problems. A so called strongly valid toll can support any multiclass user equilibrium flow pattern as a system minimum when the system objective function is measured by total emission. Using Hoffman lemma and exact penalization method, we provide the existence of strongly valid tolls for multiclass network equilibrium problems.展开更多
An optimization model and its solution algorithm for alternate traffic restriction(ATR) schemes were introduced in terms of both the restriction districts and the proportion of restricted automobiles. A bi-level progr...An optimization model and its solution algorithm for alternate traffic restriction(ATR) schemes were introduced in terms of both the restriction districts and the proportion of restricted automobiles. A bi-level programming model was proposed to model the ATR scheme optimization problem by aiming at consumer surplus maximization and overload flow minimization at the upper-level model. At the lower-level model, elastic demand, mode choice and multi-class user equilibrium assignment were synthetically optimized. A genetic algorithm involving prolonging codes was constructed, demonstrating high computing efficiency in that it dynamically includes newly-appearing overload links in the codes so as to reduce the subsequent searching range. Moreover,practical processing approaches were suggested, which may improve the operability of the model-based solutions.展开更多
Considering such a fact that travellers dynamically adjust their routes and the resultant link traffic flows in a network evolve over time, this paper proposes a dynamical evolutionary model of the traffic assignment ...Considering such a fact that travellers dynamically adjust their routes and the resultant link traffic flows in a network evolve over time, this paper proposes a dynamical evolutionary model of the traffic assignment problem with endogenous origin-destination （OD） demands. The model＇s stability is analysed and the resultant user equilibrium （UE） state is shown to be stable under certain conditions. Numerical results in a grid network indicate that the model can generate convergent flow patterns and finally terminates at the UE state. Impacts by the parameters associated with OD demand function and link cost function are also investigated.展开更多
Considering characteristics of Chinese urban mixed traffic,the author develops a combinatorial model involving the mixed deterministic traffic volume distribution and user's equilibrium (UE) assignment on the basi...Considering characteristics of Chinese urban mixed traffic,the author develops a combinatorial model involving the mixed deterministic traffic volume distribution and user's equilibrium (UE) assignment on the basis of symmetrical link travel time function (or deterrence).Its uniqueness and equivalance to the Wardropian principle of UE are also proved.Finally,we give the algorithm of model.展开更多
文摘In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on arcs. Using an example, we illustrate the application of the algorithm and show that Beckmann’s formula is a sufficient condition only, not a necessary condition, for traffic equilibrium with capacity constraints of arcs.
基金Projects(70631002,70701027) supported by the National Natural Science Foundation of ChinaProject(NCET-08-0406) supported by the Program for New Century Excellent Talents in Chinese University
文摘Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes were proposed.The methods of step-size searching and bush construction are proved to be practical.The modified OUE algorithm procedure was also optimized to take the advantage of multi-thread process.Convergence performances were compared with those of other algorithms by different sizes of urban transportation networks.The result shows this modified OUE algorithm is more efficient and consumes less time to achieve the reasonable relative gap in practical applications.
基金supported by the National Natural Science Foundation of China(Grant Nos.71071014,70771005,70631001)the Fundamental Research Funds for Central Universities of China(Grant No. 2009JBM044)
文摘Improving transportation system is essential for all people in each city since transport plays a very important role.Using mathematical programming approach transport problem is an effective way to improve transportation system.In this paper,the traffic equilibrium problem(TEP)with a general nonadditive route cost function is studied.We formulate the route cost function for each route as a disutility function,which can evaluate route cost function flexibly and analyze the route toll conveniently.Furthermore,we present the TEP with a nonlinear complementary problem(NCP)formulation.The monotonicity and the existence with the NCP formulation are also given under relative assumptions.
文摘传统电动汽车充电负荷建模通常采用对电动汽车个体进行抽样模拟的方式,未能从分析机理的角度描述电动汽车群体相互作用形成的宏观运行状态。为此,提出一种基于半动态交通均衡模型和组合荷电状态(combined states of the charge,CSOC)概率计算的电动汽车充电负荷概率分布计算方法。首先,分析电动汽车的交通特性和充电特性,并提出一种可行路径集构建方法;然后,引入交通均衡理论进行电动汽车空间分布建模,建立考虑随机效用的半动态交通均衡模型,实现宏观交通流均衡分配。进一步地,从理论层面分析电动汽车群的荷电状态变化,建立基于CSOC的充电负荷概率分布计算模型。最后,分别在13节点路网和实际大路网中验证所提方法的有效性,并分析了电动汽车渗透率和路网结构对充电负荷概率分布的影响。
基金supported by the National Natural Science Foundation of China NSFC:71071035
文摘In this article, we consider the multiclass network equilibrium problems. A so called strongly valid toll can support any multiclass user equilibrium flow pattern as a system minimum when the system objective function is measured by total emission. Using Hoffman lemma and exact penalization method, we provide the existence of strongly valid tolls for multiclass network equilibrium problems.
基金Projects(71171200,51108465,71101155)supported by the National Natural Science Foundation of China
文摘An optimization model and its solution algorithm for alternate traffic restriction(ATR) schemes were introduced in terms of both the restriction districts and the proportion of restricted automobiles. A bi-level programming model was proposed to model the ATR scheme optimization problem by aiming at consumer surplus maximization and overload flow minimization at the upper-level model. At the lower-level model, elastic demand, mode choice and multi-class user equilibrium assignment were synthetically optimized. A genetic algorithm involving prolonging codes was constructed, demonstrating high computing efficiency in that it dynamically includes newly-appearing overload links in the codes so as to reduce the subsequent searching range. Moreover,practical processing approaches were suggested, which may improve the operability of the model-based solutions.
基金supported by the National Basic Research Program of China (Grant No 2006CB705503)the National Natural Science Foundation of China (Grant No 70521001)
文摘Considering such a fact that travellers dynamically adjust their routes and the resultant link traffic flows in a network evolve over time, this paper proposes a dynamical evolutionary model of the traffic assignment problem with endogenous origin-destination （OD） demands. The model＇s stability is analysed and the resultant user equilibrium （UE） state is shown to be stable under certain conditions. Numerical results in a grid network indicate that the model can generate convergent flow patterns and finally terminates at the UE state. Impacts by the parameters associated with OD demand function and link cost function are also investigated.
文摘Considering characteristics of Chinese urban mixed traffic,the author develops a combinatorial model involving the mixed deterministic traffic volume distribution and user's equilibrium (UE) assignment on the basis of symmetrical link travel time function (or deterrence).Its uniqueness and equivalance to the Wardropian principle of UE are also proved.Finally,we give the algorithm of model.
