Dynamic routing in open queueing networks: Brownian models,cut constraints and resource pooling

We present an introductory review of recent work on the control of open queueing networks. We assume that customers of different types arrive at a network and pass through the system via one of several possible routes; the set of routes available to a customer depends on its type. A route through the network is an ordered set of service stations: a customer queues for service at each station on its route and then leaves the system. The two methods of control we consider are the routing of customers through the network, and the sequencing of service at the stations, and our aim is to minimize the number of customers in the system. We concentrate especially on the insights which can be obtained from heavy traffic analysis, and in particular from Harrison's Brownian network models. Our main conclusion is that in many respects dynamic routingsimplifies the behaviour of networks, and that under good control policies it may well be possible to model the aggregate behaviour of a network quite straightforwardly.Supported by SERC grant GR/F 94194.     

关联规则向量化挖掘算法及其在车险精算中的应用

本文首先回顾了关联规则的基本概念和传统的Apriori算法，然后利用关联规则的数据库是布尔型数据库的特点，在计算关联规则的支持度和置信度的时候引进向量数乘和向量内积的概念，得到关联规则向量化挖掘算法ARVDA，避免全数据库逐条记录模式匹配和属性分层，提高算法的速度．最后，本文利用提升度量关联规则的重要性，采用单独追踪和对比分析方法，衡量车险精算中风险因子的有效性．结果表明把车辆使用性质作为车险定价的分级因素是比较合理的，对于非运营车辆需要合理的费用附加．     

A 4D-sequencing approach for air traffic management

The current air traffic system is forecasted to face strong challenges due to the continuous increase in air traffic demand. Hence, there is a need for new types of organization permitting a more efficient air traffic management, with both a high capacity and a high level of safety, and possibly with a reduced environmental impact. In this article, we study a holistic approach, consisting in designing across Europe a very organized air traffic system, as opposed to free flight, to reduce costs while maintaining safety.     

Existence and generic stability of solutions for multiclass multicriteria traffic equilibrium problems with capacity constraints of arcs

ABSTRACT

In this paper, we introduce the multiclass multicriteria traffic equilibrium problem with capacity constraints of arcs and its equilibrium principle. Using Fan–Browder's fixed points theorem and Fort's lemma to prove the existence and generic stability results of multiclass multicriteria traffic equilibrium flows with capacity constraints of arcs.     

基于出行目的链的出行生成—分布组合模型分析

目前,我国城市轨道交通客流预测大多采用交通产生、吸引、出行分布、出行方式划分四阶段模型,其中出行生成与分布是方式划分和交通分配的前提,是模型重要的组成部分.在对传统的四阶段模型的分析基础上,结合非集计模型的优点,论文提出了基于出行目的链的出行生成—分布组合模型.模型充分考虑了居民出行链、出行目的等对客流预测的影响,在完善我国轨道交通客流预测理论和方法,提高预测精度等方面具有一定的理论价值和实际意义.     

The Law of the Iterated Logarithm for Extreme Waiting Time in Multiphase Queueing Systems

The objective of this research in the queueing theory is the law of the iterated logarithm (LIL) under the conditions of heavy traffic in multiphase queueing systems (MQS). In this paper, the LIL is proved for the extreme values of some important probabilistic characteristics of the MQS, namely, maxima and minima of the summary waiting time of a customer, and maxima and minima of the waiting time of a customer.     

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

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

Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.     

An interpolation approximation for the GI/G/1 queue based on multipoint Padé approximation

The performance evaluation of many complex manufacturing, communication and computer systems has been made possible by modeling them as queueing systems. Many approximations used in queueing theory have been drawn from the behavior of queues in light and heavy traffic conditions. In this paper, we propose a new approximation technique, which combines the light and heavy traffic characteristics. This interpolation approximation is based on the theory of multipoint Padé approximation which is applied at two points: light and heavy traffic. We show how this can be applied for estimating the waiting time moments of the ^GI/G/1 queue. The light traffic derivatives of any order can be evaluated using the MacLaurin series analysis procedure. The heavy traffic limits of the ^GI/G/1 queue are well known in the literature. Our technique generalizes the previously developed interpolation approximations and can be used to approximate any order of the waiting time moments. Through numerical examples, we show that the moments of the steady state waiting time can be estimated with extremely high accuracy under all ranges of traffic intensities using low orders of the approximant. We also present a framework for the development of simple analytical approximation formulas. This revised version was published online in June 2006 with corrections to the Cover Date.     

Structure-reversibility and departure functions of queueing networks with batch movements and state dependent routing

We consider characterizations of departure functions in Markovian queueing networks with batch movements and state-dependent routing in discrete-time and in continuous-time. For this purpose, the notion of structure-reversibility is introduced, which means that the time-reversed dynamics of a queueing network corresponds with the same type of queueing network. The notion is useful to derive a traffic equation. We also introduce a multi-source model, which means that there are different types of outside sources, to capture a wider range of applications. Characterizations of the departure functions are obtained for any routing mechanism of customers satisfying a recurrent condition. These results give a unified view to queueing network models with linear traffic equations. Furthermore, they enable us to consider new examples as well as show limited usages of this kind of queueing networks. This revised version was published online in June 2006 with corrections to the Cover Date.