This paper proposes a new method for service restoration of distribution network with the support of transportable power sources(TPSs)and repair crews(RCs).Firstly,a coupling model of distribution networks and vehicle...This paper proposes a new method for service restoration of distribution network with the support of transportable power sources(TPSs)and repair crews(RCs).Firstly,a coupling model of distribution networks and vehicle routing of TPSs and RCs is proposed,where the TPSs serve as emergency power supply sources,and the RCs are used to repair the faulted lines.Considering the uncertainty of traffic congestion,the probability distribution of the travel time spent on each road is derived based on the Nesterov user equilibrium model,and a two-stage stochastic program is formulated to determine the optimal routings of TPSs and RCs.To efficiently solve the proposed stochastic mixed-integer linear program(MILP),a two-phase scenario reduction method is then developed to scale down the problem size,and an adaptive progressive hedging algorithm is used for an efficient solution.The effectiveness of the proposed methods and algorithms has been illustrated in a modified IEEE 33-bus system.展开更多
A “Random Shortest Path”traffic assignment model and its algorithm arepresented by simulating the trip-makers’route-choice characters,and the dynamic meth-od is introduced in the assignment model.It is a ideal mult...A “Random Shortest Path”traffic assignment model and its algorithm arepresented by simulating the trip-makers’route-choice characters,and the dynamic meth-od is introduced in the assignment model.It is a ideal multiple path assignment modelwhich can be carried out by the dynamic method and static method,can better reflect boththe shortest path factor and the random factor in the route-choice,and is of reasonableassignment volumes.Besides,both dynamic and static softwares particularly suited to thetraffic assignment of large and medium-sized transportation networks arc developed.展开更多
在一个配电网和城市交通网耦合框架中,提出一种电动汽车充电定价方法。建立以社会总成本最小为目标的电动汽车充电服务费的双层优化模型,模型上层为在含风电的配电网中求解充电服务费(Charging Service Fees, CSF)的二阶锥问题;下层为...在一个配电网和城市交通网耦合框架中,提出一种电动汽车充电定价方法。建立以社会总成本最小为目标的电动汽车充电服务费的双层优化模型,模型上层为在含风电的配电网中求解充电服务费(Charging Service Fees, CSF)的二阶锥问题;下层为一个遵循用户均衡(User Equilibrium, UE)原则的交通分配问题。该模型考虑了风电输出和OD交通流的不确定性,建立基于深度强化学习的求解框架,对随机双层问题进行解耦和近似求解。以5节点系统和某城市交通-电力耦合网为例,验证了该模型的有效性。展开更多
基金supported by National Natural Science Foundation of China(No.72171026).
文摘This paper proposes a new method for service restoration of distribution network with the support of transportable power sources(TPSs)and repair crews(RCs).Firstly,a coupling model of distribution networks and vehicle routing of TPSs and RCs is proposed,where the TPSs serve as emergency power supply sources,and the RCs are used to repair the faulted lines.Considering the uncertainty of traffic congestion,the probability distribution of the travel time spent on each road is derived based on the Nesterov user equilibrium model,and a two-stage stochastic program is formulated to determine the optimal routings of TPSs and RCs.To efficiently solve the proposed stochastic mixed-integer linear program(MILP),a two-phase scenario reduction method is then developed to scale down the problem size,and an adaptive progressive hedging algorithm is used for an efficient solution.The effectiveness of the proposed methods and algorithms has been illustrated in a modified IEEE 33-bus system.
基金The Project Supported by National Natural Science Foundation of China
文摘A “Random Shortest Path”traffic assignment model and its algorithm arepresented by simulating the trip-makers’route-choice characters,and the dynamic meth-od is introduced in the assignment model.It is a ideal multiple path assignment modelwhich can be carried out by the dynamic method and static method,can better reflect boththe shortest path factor and the random factor in the route-choice,and is of reasonableassignment volumes.Besides,both dynamic and static softwares particularly suited to thetraffic assignment of large and medium-sized transportation networks arc developed.
