NONLOCAL CROWD DYNAMICS MODELS FOR SEVERAL POPULATIONS

This paper develops the basic analytical theory related to some recently introduced crowd dynamics models.Where well posedness was known only locally in time,it is here extended to all of R+.The result...     

固定需求下基于概率型随机平衡的交通网络设计模型及算法

在考虑网络中用户的路径选择行为满足概率型随机平衡的条件下，给出了交通网络设计的双层规划模型，同时设计了基于差分的启发式求解算法．     

An extension of Tanner's results on uncontrolled intersections

A delay formula is developed for the problem, analyzed by Tanner in 1962, where two streams of traffic have conflicting demands at an intersection. The situation is such that the major stream has absolute priority and the minor stream vehicles can only enter the intersection when sufficiently large gaps appear in the major stream. This paper extends Tanner's work by considering a generalised stochastic structure on the arrival streams. The paper also links Tanner's work to other papers of this author where the utilitarian value of this generalised model has been established in a wide range of traffic problems.     

On the Analysis of the Virtual Waiting Time in Open Queueing Networks

The model of an open queueing network in heavy traffic has been developed. These models are mathematical models of computer networks in heavy traffic. A limit theorem has been presented for the virtual waiting time of a customer in heavy traffic in open queueing networks. Finally, we present an application of the theorem—a reliability model from computer network practice.     

Scheduling networks of queues: Heavy traffic analysis of a simple open network

We consider a queueing network with two single-server stations and two types of customers. Customers of type A require service only at station 1 and customers of type B require service first at station 1 and then at station 2. Each server has a different general service time distribution, and each customer type has a different general interarrival time distribution. The problem is to find a dynamic sequencing policy at station 1 that minimizes the long-run average expected number of customers in the system.The scheduling problem is approximated by a dynamic control problem involving Brownian motion. A reformulation of this control problem is solved, and the solution is interpreted in terms of the queueing system in order to obtain an effective sequencing policy. Also, a pathwise lower bound (for any sequencing policy) is obtained for the total number of customers in the network. We show via simulation that the relative difference between the performance of the proposed policy and the pathwise lower bound becomes small as the load on the network is increased toward the heavy traffic limit.     

Routing and wavelength assignment algorithms for multiclass WDM optical networks

In this paper dynamic routing and wavelength assignment strategies have been proposed for multiclass WDM optical networks. Multiclass optical networks provide multiple classes of services to the subscriber according to the requirement, which in turn increase operational profitability. Each class of service could be characterized by parameters like number of wavelengths, expected call holding time and average arrival rate of request. The proposed strategies have been analyzed and compared with existing strategies on the basis of blocking probabilities for multiclass traffic scenarios. Simulation results on different network topologies demonstrate that the performance of proposed strategies “Fixed shortest/alternate shortest path routing with wavelength reservation (FSASWR)” and “Fixed alternate shortest path routing with least priority wavelength assignment (FASPL)” are much better as compared to existing strategies. Proposed strategies minimize blocking probability of the multiclass network using limited number of wavelengths.     

The time-dependent Ginzburg-Landau equation for the two-velocity difference model

A thermodynamic theory is formulated to describe the phase transition and critical phenomenon in traffic flow.Based on the two-velocity difference model,the time-dependent Ginzburg-Landau (TDGL) equation under certain condition is derived to describe the traffic flow near the critical point through the nonlinear analytical method.The corresponding two solutions,the uniform and the kink solutions,are given.The coexisting curve,spinodal line and critical point are obtained by the first and second derivatives of the thermodynamic potential.The modified Korteweg de Vries (mKdV) equation around the critical point is derived by using the reductive perturbation method and its kink-antikink solution is also obtained.The relation between the TDGL equation and the mKdV equation is shown.The simulation result is consistent with the nonlinear analytical result.     

混合交通流时间序列的去趋势波动分析

应用去趋势波动分析法研究交通流时间序列的复杂性,探讨了混合交通流时间序列演变行为的标度指数.根据标度指数的变化特征,进而揭示交通流时间序列所具有的长程相关性和短程相关性.通过分析发现,存在一密度ρ,当ρ₁<ρ<ρ₂时,交通流时间序列具有长程相关性;而当ρ<ρ₁或ρ>ρ₂时,交通流时间序列具有短程相关性,即密度的变化影响着标度指数的变化.另外分析了在不同慢车比率条件下时间序列的标度指数,发现慢车比率的变化 关键词： 混合交通流 去趋势波动分析 时间序列 长程相关     

考虑意外事件对交通流影响的元胞自动机交通流模型

在NaSh模型的基础上,考虑交通事故和养护路段等意外事件对高速公路交通流的影响,建立了有意外事件影响的在车道管制下的高速公路交通流元胞自动机模型,并进行数值模拟. 研究发现:意外事件对高速公路交通流有明显影响,并且意外事件对交通流的影响在某一密度值范围内尤其明显,且意外事件堵塞点在第一车道比在第二车道对交通流的影响小;同时,在该密度值范围内,意外事件堵塞时间和堵塞路段长度越长,对交通流的影响就越大. 关键词： 元胞自动机 交通流 意外事件     

基于社团结构的负载传输优化策略研究

研究表明网络社团结构特征对负载传输有影响,明显社团结构特征会降低网络的承载能力.由于最短路由策略在选择路由时有一定的随机性,本文提出了一种基于社团结构的负载传输策略,减少最短路由经过的社团数量,从而降低社团边缘节点的介数.实验结果显示,该策略在保证最短路由小世界特性的同时,提升了网络的承载能力,社团划分得越准确传输优化策略效果越显著. 关键词： 优化路由策略 社团结构 复杂网络 负载传输