合作博弈视角下城市道路交通拥堵收费研究

城市道路交通设施作为准公用物品,其外部效应必然导致交通拥堵的发生,实施拥堵收费的目的则是使交通拥堵产生的外部成本内部化,确保城市道路资源得到高效配置,应用经济杠杆来调节交通需求,以缓解交通拥堵.本文应用合作博弈相关理论对城市道路拥堵网络问题进行了分析,从同一时刻各个路段的通勤者数目这一角度定义拥堵成本,重点证明了拥堵成本为凸函数的城市道路拥堵网络博弈存在非空的核,拥堵成本为凹函数的城市道路交通网络博弈虽不存在非空的核,但总是存在最优的树网络,最后,结合上述结论对城市道路拥堵收费进行讨论,从理论上对拥堵收费的合理性进行了说明,并提出了进一步研究的方向.     

城市地铁专用车厢模型建立及拥挤敏感性分析

处于城市化进程中的我国城市,交通拥堵问题日益严重.作为社会弱势群体的老幼孕人群,对公共交通的安全性与舒适性要求相对更高,但是这类人群中相当一部分需要在上下班高峰期与通勤人群一起出行.如果能够依据城市的具体情况设立专用车厢,把这一部分出行者引导到公共交通中,可以减少部分交通流,缓解交通拥堵.对建立专用车厢的可行性进行了分析,并建立了数学模型.     

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

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

无线多媒体网络中自适应拥塞控制算法的研究

提出了一种适用于采用无线接入多媒体流的拥塞控制算法,简称adaptive-MQWB(adaptivemediaQoSandwirelessbandwidth)。该算法依据当前带宽的动态变化率,在满足多媒体传输的最大时延的前提下,以最佳目标队长为实现目标,寻求最优的主动队列管理方案。仿真结果表明,与目前已有的MADR、tuned-RED算法相比,adaptive-MQWB算法在带宽动态变化的自适应性和多媒体传输时延的QoS保证方面都表现出更好的性能优势。     

An adaptive strategy based on linear prediction of queue length to minimize congestion in Barabási-Albert scale-free networks

In this paper, we propose an adaptive strategy based on the linear prediction of queue length to minimize congestion in Barabási-Albert (BA) scale-free networks. This strategy uses local knowledge of traffic conditions and allows nodes to be able to self-coordinate their accepting probability to the incoming packets. We show that the strategy can delay remarkably the onset of congestion and systems avoiding the congestion can benefit from hierarchical organization of accepting rates of nodes. Furthermore, with the increase of prediction orders, we achieve larger values for the critical load together with a smooth transition from free-flow to congestion.     

The information transmission in community networks

The community structure has been empirically found in many real networks. This paper proposes an efficient Double Shortest Path routing strategy trying to avoid the modules of traffic congestion, which means that we adopt the shortest routing strategy both in the inter-modules and in the intra-module. Simulations show that this routing algorithm is superior to the traditional shortest path routing protocol with appropriate selection of the tunable parameters. In addition, this algorithm can also be improved by integrating it with several alternative routing strategies.     

Dynamic dairy facility location and supply chain planning under traffic congestion and demand uncertainty: A case study of Tehran

In this paper, dynamic dairy facility location and supply chain planning are studied through minimizing the costs of facility location, traffic congestion and transportation of raw/processed milk and dairy products under demand uncertainty. The proposed model dynamically incorporates possible changes in transportation network, facility investment costs, monetary value of time and changes in production process. In addition, the time variation and the demand uncertainty for dairy products in each period of the planning horizon is taken into account to determine the optimal facility location and the optimal production volumes. Computational results are presented for the model on a number of test problems. Also, an empirical case study is conducted in order to investigate the dynamic effects of traffic congestion and demand uncertainty on facility location design and total system costs.     

卫星IP网络中传输控制协议的研究

传输控制协议(TCP)是TCP / IP协议栈的主要传输协议,它在网络中的传输效率是影响IP网络传输性能的关键因素之一。当网络中存在卫星链路时,卫星链路的一些固有特性会使TCP的传输性能受到一定影响。文中首先指出卫星信道的特点,对TCP协议在卫星网络中的传输性能进行了分析,重点介绍最近几年这方面的研究成果。     

一种改进的CSFQ算法的设计与仿真

针对CSFQ算法存在的对TCP流的抑制及缓存策略等问题,提出采用ARED作为缓存管理的CSFQ改进算法A-CSFQ,并在多瓶颈链路下对其性能进行仿真。仿真结果表明,改进算法在保持CSFQ其他优点的基础上,显著减弱了对TCP流的抑制作用,提高了其对TCP流的公平性。     

一种对用户公平的核心无状态队列管理算法

在对"流"公平的CSFQ(Core-Stateless Fair Queueing)算法基础上进行改进,将算法设计思想由对流速率的公平分配改为对表征用户需求的效用函数的公平分配,从而提出一种对用户公平的核心无状态队列管理算法(Core-Stateless User Fair Queueing,CSUFQ),该算法能近似实现边界及核心路由器上对用户需求的最大最小公平,仿真实验证明了其效果.