基于博弈论混合策略下的路径选择模型

为了缓解交通拥挤的状况,预测出行者路径选择行为是一项值得研究的工作.在混合策略下,根据出行者之间的博弈关系,定义了混合策略下的得益函数,并引入求解混合策略纳什均衡的一种新方法,即极值法,对出行者的路径选择博弈模型进行了求解,有效弥补了传统划线法的不足,最终得到每个出行者的最优选择,实现了博弈各方的平衡.通过算例,有效地说明了混合策略下出行者最可能做出的路径选择.     

基于时间价值及基尼系数的拥挤收费设计

城市道路交通拥挤日益严重,交通拥挤收费是解决城市道路交通拥挤的手段之一,双层规划模型是研究交通拥挤收费问题的一个有力工具.然而,对时间价值不同的出行者收取拥挤费用将产生社会不公平问题.基尼系数是衡量资源分配是否公平的一个重要指标.以出行费用为公平指标,利用基尼系数改进传统双层模型的上层模型,加入基尼系数函数,构造一个管理者收益尽量大而基尼系数尽量小的目标函数.同时加入控制基尼系数的参数,通过选择适当的参数,可满足不同公平性的要求.算例表明,基于时间价值及基尼系数的拥挤收费设计,达到缓解交通拥挤的目的,且兼顾了管理者收益与交通公平.     

基于可靠性的随机拥挤收费模型

提出了一种需求不确定环境下的基于可靠性的拥挤收费模型.在需求不确定的环境下,出行时间的变动使得无论是出行者还是网络决策者都面临着风险.出行者需要提高出行的可靠性以避免迟到,决策者需要在缓解拥堵的同时提高网络整体的可靠性.以基于路段的平均超额出行时间作为出行者的路径选择准则,以平均超额系统总阻抗最小作为决策者拥挤收费的目标,建立了具有均衡约束的数学规划模型.提出了模型能分析出行者的路径选择行为和决策者的决策过程中的可靠性,同时充分考虑迟到等不可靠因素的影响,全面刻画不确定环境下路径出行时间和系统总阻抗的分布特征.数值算例表明,忽略不确定性的影响可能会得到对于网络整体性能过于乐观的评价,得到脱离实际的收费方案.网络的不确定性越高,对于网络性能和收费方案的影响就越大,从而考虑网络可靠性和出行者路径选择的可靠性的必要性就越大.此外,以平均超额系统总阻抗作为拥挤收费的目标可以进一步改善网络的可靠性.     

基于出行者属性差异的拥挤收费政策分析

运用经典瓶颈模型,引入出行者属性差异,分析了实行拥挤收费政策前后不同出行方式的出行分布,给出了收费政策影响下出行者行为策略的选择.进一步,分析了基于政府拥挤收费政策下,小汽车和公交车共用同一路线时,道路使用成本、政府调控目标及费率的关系.研究结果表明,政府可以通过设置恰当的收费费率,调节不同出行方式间的出行分布,缓解交通拥挤,优化交通管理现状.属性差异系数的引入使模型更符合实际,改进了已有研究.     

收费机制下一类随机需求混合交通均衡分配的非合作代价

运用算法博弈论探讨一类随机需求混合交通均衡分配在收费机制下的非合作代价.首先,构建了收费机制下随机需求UE-CN混合交通均衡分配的变分不等式模型.其次,运用解析推导法分别得到单项式出行成本函数下是否将收费作为系统总成本一部分时,该类混合交通均衡分配的非合作代价上界表达式.在此基础上,探讨了出行需求服从对数正态分布时的非合作代价上界表达式.并以数值算例验证所得结论.     

收费机制下利己-利他混合交通均衡分配的效率损失

运用解析推导方法对收费机制下利己-利他混合交通均衡分配问题的效率损失进行研究.首先,构建了收费机制下利己-利他混合交通均衡分配问题的等价变分不等式模型;然后,通过解析推导方法得到了收费不作为系统总出行时间成本一部分时的效率损失上界;最后,给出了路段出行时间成本函数为多项式函数时的上界表达式.研究结果表明,效率损失上界与路段出行时间成本函数类、利他系数以及出行需求划分系数相关,结论以现有文献有关结论为特例.     

出行量预测不确定下基于灵敏度分析的拥挤收费定价模型

拥挤收费是改善城市交通的有效手段.对拥挤收费定价的研究方法之一,就是针对固定的出行量进行收费设计.由于出行量预测不确定的因素,应针对长期出行量预测不确定的情况,利用灵敏度分析的方法,对拥挤收费定价的问题进行研究.首先研究了出行者出行的广义费用,然后考虑出行者的出行决策及出行量预测不确定的因素,给出一个拥挤收费定价模型,为交通管理者提供理论依据.     

基于基尼系数的交通拥挤收费定价模型

双层规划模型是研究交通拥挤收费问题的一个有力工具,基尼系数是衡量资源分配是否公平的一个重要指标.利用基尼系数对传统双层规划模型的上层模型进行改造,在上层模型中加入基尼系数函数,构造一个网络收益尽可能大而基尼系数尽可能小的目标函数.同时在上层目标函数中,加入控制基尼系数的参数,通过选择适当的参数,可满足不同公平性要求的拥挤收费设计.算例表明,考虑基尼系数的拥挤收费设计,达到了缓解交通拥挤的目的,且交通公平得到改善.     

拥挤收费策略设计及其效率损失分析

在静态交通量分配中,针对边际收费策略会引起系统总费用过大的问题,本文设计了最小收费策略收取拥挤道路使用费.同边际收费策略相比较,该收费策略不会增加系统的效率损失;当路阻函数不是常函数时,最小收费策略所收费用严格小于边际收费策略所收费用;最小收费策略能使得交通状况达到系统最优且收费总额度最小.     

非对称弹性需求网络容量限制交通分配有效算法

在非对称交通网络中,针对路段容量限制下弹性需求用户均衡分配模型计算困难,提出了一种路段容量限制弹性需求用户均衡交通分配问题的有效算法.该算法在迭代时,排队延误因子、误差因子与交通需求通过自适应调节来逼近真实路段车辆行驶时间和出行者交通需求,促使各路段交通流量逐步满足限制条件,最终达到弹性需求广义用户均衡.方法克服了容量限制弹性需求用户均衡分配计算量大及随机分配法要求枚举所有路径的困难.随后证明了算法的收敛性,并对一个小型路网进行了数值试验.     

不同行为风格下路段行人与机动车行为博弈分析

针对路段过街行人与机动车的博弈决策行为,考虑不同交通行为风格下行人的过街特征和驾驶人的驾驶行为习惯等影响因素,开展路段行人交通行为风格调查,掌握不同交通行为风格下路段行人的过街特征,构建非合作动态人车博弈模型.通过分析不同策略下行人与驾驶人的收益,求解纳什均衡,得到不同策略下行人与驾驶人的最优策略.为解决路段行人与机动车冲突提供新的思路.     

Modeling demand management strategies for evacuations

Evacuations are massive operations that create heavy travel demand on road networks some of which are experiencing major congestions even with regular traffic demand. Congestion in traffic networks during evacuations, can be eased either by supply or demand management actions. This study focuses on modeling demand management strategies of optimal departure time, optimal destination choice and optimal zone evacuation scheduling (also known as staggered evacuation) under a given fixed evacuation time assumption. The analytical models are developed for a system optimal dynamic traffic assignment problem, so that their characteristics can be studied to produce insights to be used for large-scale solution algorithms. While the first two strategies were represented in a linear programming (LP) model, evacuation zone scheduling problem inevitable included integers and resulted in a mixed integer LP (MILP) one. The dual of the LP produced an optimal assignment principle, and the nature of the MILP formulations revealed clues about more efficient heuristics. The discussed properties of the models are also supported via numerical results from a hypothetical network example.     

Using fuzzy integral for evaluating subjectively perceived travel costs in a traffic assignment model

A good traffic assignment model can be a powerful tool to describe the characteristics of traffic behavior in a road network. The traffic assignment results often play an important role in transportation planning, e.g., an optimal and economical network design. Many traditional traffic assignment models rely heavily on the travel cost function established by Wardrop’s principles; however, the Wardrop’s travel cost function has been proven to be weak for explaining the uncertainty and interactivity of traffic among links. This study tries to construct a traffic assignment model that is different from Wardrop’s in many aspects. First, it considers the cross-effect among the links. Second, a fuzzy travel cost function is established based on the possibility concept instead of precise calculation of traffic volumes. Third, the techniques of fuzzy measure and fuzzy integral are applied to calculate the subjectively perceived travel costs during traffic assignment. Furthermore, in order to validate our model, a detailed network with 22 nodes and 36 links is used to illustrate it. Study results show that our model explains more interactivity and uncertainty of traffic among links when compared with the traditional model of Wardrop’s.     

A GIS-based decision support system for planning urban transportation policies

A decision support system (DSS) integrated in a geographical information system (GIS) for the analysis and evaluation of different transport policies is presented. The objective of the tool is to assist transport administrators enhance the efficiency of the transportation supply while improving environmental and energy indicators. The DDS works on three levels. The first performs the transport network analysis, the second assesses the energy consumption and pollutant emissions and the third evaluates the several policies selected. Road traffic is simulated using a deterministic, multi-modal traffic assignment model with capacity constraints. The model allows the estimation of traffic flow patterns within each link of the road network starting from the knowledge of the network characteristics and traffic demand. Energy consumption and pollutant emission calculations are based on the methodology developed by the CORINAIR working group. The evaluation of each policy scenario is based on a number of traffic, environmental and energy indicators. A multi-criteria analysis, where decision is based upon judging over appropriate weighted criteria, is adopted. Models are integrated in a GIS environment, which serves as the repository of the data as well as the user interface of the tool. The use of the tool is demonstrated through characteristic case studies on the Greater Athens Area in Greece. Two policy measures, one concerning the extension of the region where half of the private cars are prohibited from entering to the Municipality of Athens and the other the reduction of parking places in the same region by 50% are evaluated.     

超速驾驶行为的进化博弈分析

针对交通管理中经常要面对的超速驾驶行为,建立了驾驶员群体之间以及驾驶员群体与交管部门之间的博弈模型及其复制动态方程,并对动态方程做了分析与讨论,得出了博弈模型中各博弈方的进化稳定策略,提出了一些控制和减少超速行为的合理建议.     

计及多重阻塞的电动汽车移动储能特性建模

为实现城市交通电力耦合系统在城市道路、充电设施、输电线路阻塞环境下的优化运行,提出了计及多重阻塞的动态交通电力流联合优化方法。首先,基于时空网络模型,提出了计及电动汽车移动、静止、充电、排队模式的队列时空网络模型,构建了适用于电动汽车的车辆调度模型,进而形成动态交通分配模型,以减少交通出行损失。其次,通过优化发电机组、储能等的出力和备用计划,计及城市电网安全、备用约束,构建了安全约束动态经济调度模型,以降低碳排放及发电成本。随后,形成多目标动态优化模型,并将其转换为混合整数凸二次规划问题。最后,在耦合IEEE-30、Sioux Falls系统中验证了所提模型的有效性。     

基于面板数据的公路交通事故实证研究

本文采用面板数据的固定效应回归模型,对交通事故死亡率与迅猛增长的交通需求和相对滞后的公路及相关的基础设施之间的矛盾之间的关系进行定量分析,研究结果很好地印证了我国交通安全的现实状况.     

A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium

Suppose that a road network model is given, together with some given demand for travel by (say) car and that the demand for travel varies with time of day but not from day to day. Suppose that this demand is given in the form of specified total outflow rates from each origin headed towards each destination, for each origin-destination pair and for each time of day, and that some initial time-dependent routeinflow rates, meeting the given demand, are given. Finally, suppose that within-day time is represented by a continuous variable. This paper specifies a natural smooth day-to-day route-swapping procedure wherein drivers swap toward less expensive routes as day succeeds day, and shows that under reasonable conditions there is an equilibrium state of this dynamical system. If such a collection of route-inflows has arisen today, say, then there is no incentive for any route-inflow to change tomorrow, in the sense that at each moment of today each of today's route-inflows isalready on a route which today yielded the smallest travel cost. Such a set of no-incentive-to-change route-inflows is called adynamic equilibrium, or adynamic user-equilibrium, and may be regarded as a solution of the dynamic equilibrium traffic assignment problem. Thus, the paper introduces a smooth day-to-day dynamic assignment model and, using this model, shows that there is a dynamic user-equilibrium in a continuous time setting. The paper briefly considers the day-to-day stability of the route-swapping process, also in a continuous setting. Finally, the paper gives a simple dynamical example illustrating the stability of the route-swapping process in a simple two-route network when there is deterministic queueing at bottlenecks.     

考虑城市住房分布的二维连续型动态交通分配模型及其污染物排放估计

将城市交通路网抽象为二维连续的平面,提出一个考虑城市住房分布的二维连续型动态交通分配模型,并估计了城市交通污染物排放水平.该模型中,住房分布影响交通需求,出行者根据用户最优准则选择出发时间和路径,可以用于模拟城市交通运行的动态演化过程,得到密度、速度和流量等物理量.采用基于车辆速度和加速度的微观污染物排放模型VT-micro估计城市交通CO2动态排放水平.基于三角网格,采用有限体积法、投影算法和相继平均法进行数值求解,给出一个数值算例验证了模型和算法的有效性.     

Location-allocation models for traffic police patrol vehicles on an interurban network

This research investigates the traffic police routine patrol vehicle (RPV) assignment problem on an interurban road network through a series of integer linear programs. The traffic police RPV’s main task, like other emergency services, is to handle calls-for-service. Emergency services allocation models are generally based on the shortest path algorithm however, the traffic police RPV also handles other roles, namely patrolling to create a presence that acts as a deterrence, and issuing tickets to offenders. The RPVs need to be located dynamically on both hazardous sections and on roads with heavy traffic in order to increase their presence and conspicuousness, in an attempt to prevent or reduce traffic offences, road accidents and traffic congestion. Due to the importance of the traffic patrol vehicle’s location with regard to their additional roles, allocation of the RPVs adheres to an exogenous, legal, time-to-arrival constraint. We develop location-allocation models and apply them to a case study of the road network in northern Israel. The results of the four models are compared to each other and in relation to the current chosen locations. The multiple formulations provide alternatives that jointly account for road safety and policing objectives which aid decision-makers in the selection of their preferred RPV assignments. The results of the models present a location-allocation configuration per RPV per shift with full call-for-service coverage whilst maximizing police presence and conspicuousness as a proxy for road safety.