基于流体逼近的路段交通流动态加载研究

路段交通流动态加载是动态交通网络分配模型中的重要组成部分,在路段交通流动态加载中,离散形式或者连续形式的点排队模型被广泛使用.本文在以往研究的基础上,提出基于流体逼近的连续型点排队模型,克服了原有点排队模型中排队负值的情况.通过分析可以发现,原有点排队模型实质上属于具有单一服务台和无限容量的排队模型,基于流体逼近的思想重新定义了原有点排队模型.其中3 个主要部分是流量守恒模型,车辆流出模型和时间相关的服务台模型,这3 个模型全部都是连续的.由于连续点排队对计算需求较高,本文将连续的排队模型离散化,模拟了3 种不同场景下车辆驶出、路段排队情况.本文模型克服了原有点排队中的负排队现象,并且排队过程满足先进先出的原则,模型具有良好的模拟效果.     

Implementing first-in–first-out in the cell transmission model for networks

In traffic assignment models with time-varying flows (dynamic network loading or dynamic traffic assignment), overtaking behaviour is normally not included in the model and, in that case, it is important that the model at least approximates first-in–first-out (FIFO), to prevent deviations from FIFO that are arbitrary or unrealistic or not physically possible. For the cell transmission model (CTM) it has recently been shown that the usual recommended method for preserving FIFO will ensure FIFO for each cell taken separately but does not fully ensure FIFO in the transition between cells and hence does not fully ensure FIFO for sequences of cells or for links or for routes. As a result, deviations from FIFO can easily occur and cumulate along the links or routes. In view of that, we define and analyse three different levels of satisfaction or approximation of FIFO, together with corresponding methods for achieving them. Two of these are existing methods and one is new. We develop, analyse and compare the three methods and the extent to which each of them adheres to FIFO for sequences of cells and links or routes. Also, for two of the methods we present a more detailed algorithm for applying them within the CTM. The paper is concerned with how to implement FIFO in the CTM and not with testing for FIFO or measuring deviations from FIFO.     

A New Congestion Prevention Policy for the Router

Introduction When too many packets are present in therouter, the performance of the router will degradeand the network will have congestion. Congestioncan be cause by several factors. If all of the suddenstreams of packets begin arriving on three or fourinput lines and all packet need the router to dealwith, a queue will build up. Slow processors canalso cause congestion. If the router’s CPU is slowat performing the bookkeeping tasks required ofthem, queues can build up even though there is…     

Some features of non-linear travel time models for dynamic traffic assignment

Abstract

This paper investigates some features of non-linear travel time models for dynamic traffic assignment (DTA) that adopt traffic on the link as the sole determinant for the calculation of travel time and have explicit relationships between travel time and traffic on the link. Analytical proofs and numerical examples are provided to show first-in-first-out (FIFO) violation and the behaviour of decreasing outflow with increasing traffic in non-linear travel time models. It is analytically shown that any non-linear travel time model could violate FIFO in some circumstances, especially when inflow drops sharply, and some convex non-linear travel time models could show behaviour with outflow decreasing as traffic increases. It is also shown that the linear travel time model does not show these behaviours. A non-linear travel time model in general form was used for analytical proofs and several existing non-linear travel time models were adopted for numerical examples. Considering the features addressed in this study, non-linear travel time models seem to have limitations for use in DTA in practical terms and care should be taken when they are used for modelling time-varying transportation networks.     

多业务环境下切换优先算法的改进

切换是移动通信中充分利用有限频谱的一项关键技术。本文提出了在数据业务和话音业务环境下,基于混合信道分配(HCA)方案上的双先进先出(FIFO)排队算法:系统分别为切换语音呼叫和初始语音呼叫与数据呼叫分配了大小为Nh和No的排队空间,两队列均遵从FIFO法则;同时,为切换语音呼叫预留了可根据当前业务量调整数目的Cr个信道。通过与单FIFO排队算法和基于HCA的单FIFO排队算法的比较,可以看到本算法改善了系统的性能,更能适应高业务量小区的需要。     

Dynamic user equilibrium in public transport networks with passenger congestion and hyperpaths

This paper presents a dynamic user equilibrium for bus networks where recurrent overcrowding results in queues at stops. The route-choice model embedded in the dynamic assignment explicitly considers common lines and strategies with alternative routes. As such, the shortest hyperpath problem is extended to a dynamic scenario with capacity constraints where the diversion probabilities depend on the time at which the stop is reached and on the expected congestion level at that time. In order to reproduce congestion for all the lines sharing a stop, the Bottleneck Queue Model with time-varying exit capacity, introduced in Meschini et al. (2007), is extended. The above is applied to separate queues for each line in order to satisfy the First-In-First-Out principle within every attractive set, while allowing overtaking among passengers with different attractive sets but queuing single file. The application of the proposed model to a small example network clearly reproduces the formation and dispersion of passenger queues due to capacity constraints and thus motivates the implementation of the methodology on a real-size network case as the next step for future research.     

Discretised link travel time models based on cumulative flows: Formulations and properties

In the research area of dynamic traffic assignment, link travel times can be derived from link cumulative inflow and outflow curves which are generated by dynamic network loading. In this paper, the profiles of cumulative flows are piecewise linearized. Both the step function (SF) and linear interpolation (LI) are used to approximate cumulative flows over time. New formulations of the SF-type and LI-type link travel time models are developed. We prove that these two types of link travel time models ensure first-in-first-out (FIFO) and continuity of travel times with respect to flows, and have other desirable properties. Since the LI-type link travel time model does not satisfy the causality property, a modified LI-type (MLI-type) link travel time model is proposed in this paper. We prove that the MLI-type link travel time model ensures causality, strong FIFO and travel time continuity, and that the MLI-type link travel time function is strictly monotone under the condition that the travel time of each vehicle on a link is greater than the free flow travel time on that link. Numerical examples are set up to illustrate the properties and accuracy of the three models.     

时变单车路径问题建模及算法设计

讨论了一类时变单车配送路径优化问题。综合考虑车辆行驶速度随时间、路段不同而变化的特点,及车辆为多条路线上的客户提供服务时对车辆路径优化的影响,建立了以配送完成时间最早为优化目标的时变单车配送路径优化模型。在行驶时间满足FIFO规则下,设计了基于Inver-over操作的PSO启发式算法及满足贪婪配送策略下的动态规划精确求解算法,并讨论了增加贪婪补货策略的单车配送路径问题解与原问题解的关系。最后分别用两种算法对算例进行求解,并通过对求解优化结果及计算时间的对比分析验证了IOPSO算法的有效性。     

A dynamic route choice model for public transport networks with boarding queues

Abstract

The concepts of optimal strategy and hyperpath were born within the framework of static frequency-based public transport assignment, where it is assumed that travel times and frequencies do not change over time and no overcrowding occurs. However, the formation of queues at public transport stops can prevent passengers from boarding the first vehicle approaching and can thus lead to additional delays in their trip. Assuming that passengers know from previous experience that for certain stops/lines they will have to wait for the arrival of the 2nd, 3rd, …, k-th vehicle, they may alter their route choices, thus resulting in a different assignment of flows across the network. The aim of this paper is to investigate route choice behaviour changes as a result of the formation and dispersion of queues at stops within the framework of optimal travel strategies. A new model is developed, based on modifications of existing algorithms.