This paper focuses on the vector traffic network equilibrium problem with demands uncertainty and capacity constraints of arcs, in which, the demands are not exactly known and assumed as a discrete set that contains f...This paper focuses on the vector traffic network equilibrium problem with demands uncertainty and capacity constraints of arcs, in which, the demands are not exactly known and assumed as a discrete set that contains finite scenarios. For different scenario, the demand may be changed, which seems much more reasonable in practical programming. By using the linear scalarization method,we introduce several definitions of parametric equilibrium flows and reveal their mutual relations. Meanwhile, the relationships between the scalar variational inequality as well as the(weak) vector equilibrium flows are explored, meanwhile, some necessary and sufficient conditions that ensure the(weak) vector equilibrium flows are also considered. Additionally, by means of nonlinear scalarization functionals, two kinds of equilibrium principles are derived. All of the derived conclusions contain the demands uncertainty and capacity constraints of arcs, thus the results proposed in this paper improved some existing works. Finally, some numerical examples are employed to show the merits of the improved conclusions.展开更多
在一个配电网和城市交通网耦合框架中,提出一种电动汽车充电定价方法。建立以社会总成本最小为目标的电动汽车充电服务费的双层优化模型,模型上层为在含风电的配电网中求解充电服务费(Charging Service Fees, CSF)的二阶锥问题;下层为...在一个配电网和城市交通网耦合框架中,提出一种电动汽车充电定价方法。建立以社会总成本最小为目标的电动汽车充电服务费的双层优化模型,模型上层为在含风电的配电网中求解充电服务费(Charging Service Fees, CSF)的二阶锥问题;下层为一个遵循用户均衡(User Equilibrium, UE)原则的交通分配问题。该模型考虑了风电输出和OD交通流的不确定性,建立基于深度强化学习的求解框架,对随机双层问题进行解耦和近似求解。以5节点系统和某城市交通-电力耦合网为例,验证了该模型的有效性。展开更多
采用遗传算法对动态交通网络平衡微分博弈模型进行求解,将动态混合行为交通网络平衡模型构造为一个开环信息结构下N个局中人非合作非零和博弈,并考虑了一个单OD对之间有两个平行弧的简单网络和两类局中人——用户平衡(UE)和古诺-纳升(C...采用遗传算法对动态交通网络平衡微分博弈模型进行求解,将动态混合行为交通网络平衡模型构造为一个开环信息结构下N个局中人非合作非零和博弈,并考虑了一个单OD对之间有两个平行弧的简单网络和两类局中人——用户平衡(UE)和古诺-纳升(C-N)——在拥挤现象中的相互作用,针对此简单网络阐明了遗传算法求解模型的具体步骤。遗传算法求解不必要求目标函数连续可微,大大提高了模型的适用性。通过算例对所设计的算法进行了验证,在算例中将Wie BW(1993)的研究中部分参数取值作了修改,使其更加合乎交通实际,并将计算结果与Wie B W(1993)采用最小值原理计算结果进行了对比分析,通过对比分析表明,其计算结果更符合交通实际。展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.61573096,61272530 and 61573106)the Natural Science Foundation of Jiangsu Province of China(Grant No.BK2012741)the “333 Engineering” Foundation of Jiangsu Province of China(Grant No.BRA2015286)
文摘This paper focuses on the vector traffic network equilibrium problem with demands uncertainty and capacity constraints of arcs, in which, the demands are not exactly known and assumed as a discrete set that contains finite scenarios. For different scenario, the demand may be changed, which seems much more reasonable in practical programming. By using the linear scalarization method,we introduce several definitions of parametric equilibrium flows and reveal their mutual relations. Meanwhile, the relationships between the scalar variational inequality as well as the(weak) vector equilibrium flows are explored, meanwhile, some necessary and sufficient conditions that ensure the(weak) vector equilibrium flows are also considered. Additionally, by means of nonlinear scalarization functionals, two kinds of equilibrium principles are derived. All of the derived conclusions contain the demands uncertainty and capacity constraints of arcs, thus the results proposed in this paper improved some existing works. Finally, some numerical examples are employed to show the merits of the improved conclusions.
文摘采用遗传算法对动态交通网络平衡微分博弈模型进行求解,将动态混合行为交通网络平衡模型构造为一个开环信息结构下N个局中人非合作非零和博弈,并考虑了一个单OD对之间有两个平行弧的简单网络和两类局中人——用户平衡(UE)和古诺-纳升(C-N)——在拥挤现象中的相互作用,针对此简单网络阐明了遗传算法求解模型的具体步骤。遗传算法求解不必要求目标函数连续可微,大大提高了模型的适用性。通过算例对所设计的算法进行了验证,在算例中将Wie BW(1993)的研究中部分参数取值作了修改,使其更加合乎交通实际,并将计算结果与Wie B W(1993)采用最小值原理计算结果进行了对比分析,通过对比分析表明,其计算结果更符合交通实际。
