Worst Traffic Passing Virtual Frame Regulation: Analysis with Dynamic Programming

This paper studies a discrete-time queueing system in which the traffic regulation places an upper bound on the number of arrivals in each of the non-overlapping time windows (virtual frames) of a fixed length. The worst traffic passing through this traffic regulation is characterized. As a criterion for traffic comparison, this paper employs the weighted sum of queueing delays with the weighting factors decaying geometrically over the time horizon. This paper uses dynamic programming techniques and convexity argument to characterize the worst traffic.     

考虑行车状态的一维元胞自动机交通流模型

在Nagel Schrekenberg单车道元胞自动机交通流模型（简称NS模型）的基础上，考虑车辆之间的相对运动薛郁等提出了一种改进的单车道元胞自动机交通流模型（简称改进的NS模型）.通过两种情况列出了改进的NS模型存在不尽周严的地方，随之在新模型中引入了行车状态 变量和反馈规则，从而控制车辆出现倒车和刹车过急等现象.通过计算机对新模型进行模拟 ，发现减速概率和车流密度对车流状态的演化影响很大，当减速概率高（如道路条件差）时 ，即使车流密度低，车流也会出现局部堵塞状态；而当减速概率一定时，随着车流密度增加 ，车流的运动相与堵塞相发生了全局性的交替出现，此时类似于波的波峰和波谷的传播.与 改进的NS模型相比较，新模型模拟的车流量较高，说明新模型减少了车流的总体停滞状态. 关键词： 交通流 元胞自动机 行车状态 反馈规则     

State space collapse with application to heavy traffic limits for multiclass queueing networks

Heavy traffic limits for multiclass queueing networks are a topic of continuing interest. Presently, the class of networks for which these limits have been rigorously derived is restricted. An important ingredient in such work is the demonstration of state space collapse. Here, we demonstrate state space collapse for two families of networks, first-in first-out (FIFO) queueing networks of Kelly type and head-of-the-line proportional processor sharing (HLPPS) queueing networks. We then apply our techniques to more general networks. To demonstrate state space collapse for FIFO networks of Kelly type and HLPPS networks, we employ law of large number estimates to show a form of compactness for appropriately scaled solutions. The limits of these solutions are next shown to satisfy fluid model equations corresponding to the above queueing networks. Results from Bramson [4,5] on the asymptotic behavior of these limits then imply state space collapse. The desired heavy traffic limits for FIFO networks of Kelly type and HLPPS networks follow from this and the general criteria set forth in the companion paper Williams [41]. State space collapse and the ensuing heavy traffic limits also hold for more general queueing networks, provided the solutions of their fluid model equations converge. Partial results are given for such networks, which include the static priority disciplines. This revised version was published online in June 2006 with corrections to the Cover Date.     

由路段交通量推算OD矩阵的一种有效方法及其应用

针对现有OD矩阵估计方法的不足，本讨论了一种新的有效的估计方法，它包括一个路段流量的预处理过程，以消除路段观测流量的不相容，然后经过流量加载和卸载两个逆过程，进行反复迭代，最终得到再现路段交通量的OD矩阵，中例证了该方法的有效性。     

On queueing delays of dispersed messages

We study the message queueing delays in a node of a communication system, where a message consists of a block of consecutive packets. The message delay is defined as the time elapsing between the arrival epoch of the first packet of the message to the system until after the transmission of the last packet of that message is completed. We distinguish between two types of message generation processes. The message can be generated as abatch or it can bedispersed over time. In this paper we focus on the dispersed generation model. The main difficulty in the analysis is due to the correlation between the system states observed by different packets of the same message. This paper introduces a new technique to analyze the message delay in such systems for different arrival models and different number of sessions. For anM/M/1 system with variable size messages and for the bursty traffic model, we obtain an explicit expression for the Laplace-Stieltjes transform (LST) of the message delay. Derivations are also provided for anM/G/1 system, for multiple session systems and for fixed message sizes. We show that the correlation has a strong effect on the performance of the system, and that the commonly usedindependence assumption, i.e., the assumption that the delays of packets are independent from packet to packet, can lead to wrong conclusions.     

Variational Inequalities and Applications to a Continuum Model of Transportation Network with Capacity Constraints

A continuum model of transportation network is considered in presence of capacity constraints on the flow. The equilibrium conditions are expressed in terms of a Variational Inequality for which an existence theorem is provided.     

船舶进出宁波港分道通航方案

近年来，宁波港吞吐量猛增，并有继续上升趋势，而大型船舶进出港口仅用虾峙门的单向航道，与宁波港口发展不相适应。提出二套船舶进出口方案，与现有的虾峙门航道构成分道通航制，供港口主管部门进行航道规划参考。     

竞争环境下供应链的BOPS合作策略及其对交通拥堵改善的影响

针对由一个拥有线上直销渠道的制造商以及一个线下零售商组成的供应链,考虑消费者对不同渠道的偏好构建了供应链博弈模型,研究了竞争环境下制造商与零售商的最优BOPS合作策略,并分析了BOPS合作在改善交通拥堵方面的作用。研究表明,BOPS合作在缓解供应链双重边际效应的同时会加剧渠道之间的价格竞争,所以并不总是对供应链有利;仅当消费者线上渠道偏好程度比较低且线下麻烦成本比较大时,制造商和零售商才会都从BOPS合作中受益从而自愿达成合作,其他情形下制造商可根据供应链利润变化设计转移支付契约促成与线下零售商的BOPS合作并实现双赢;此外,一定条件下BOPS合作能够通过调整渠道需求结构,在保证供应链成员利润的同时对交通拥堵改善也带来正向作用。