基于道路设计与交通规划的道路选线优化模型

结合道路设计理论与交通规划理论,以地理信息系统为平台,开发道路选线优化模型。该模型是一个费用指向的优化问题,最小化费用目标函数中包括道路建设费用、土方工程费、道路交通诱发的环境污染的不经济费用,OD交通在路网上总走行时间的时间费用等。优化模型首先随机生成新建道路的空间位置候选方案集,并自动设计新建道路的平曲线和竖曲线,计算新建道路的各项工程费用。然后,对变化的路网进行自动拓扑,通过交通量分配得到OD交通在新路网上的走行时间和交通流特征,计算OD交通的环境负荷。最后,在遗传算法中判断候选方案的优劣,直到得到一个最佳的新建道路的空间位置方案为止。     

一类动态交通分配中的输出流模型及其数值解法

已知路段输入流,基于Greenshields提出的速度-密度关系模型以及Jayakrishnan et.al提出的改进的Greenshields 速度-密度关系模型所描述的路段交通流特征,分别给出了关于路段输出流的常微分方程模型.针对无法得到该模型的解析解,利用龙格-库塔-芬尔格算法给出初始条件下的数值解.在已知输出流的条件下,每个时刻的路段交通流的行程时间也相应给出.仿真结果表明,针对两类不同速度-密度关系所建立的输出流模型,所得到每个时刻的输出流基本相似,但路段行程时间存在明显差异.与交通流调查数据比较,基于改进的Greenshields速度-密度关系的输出流模型的行程时间更接近真实情况.     

随机交通分配中有效路径的定向树搜索算法

交通路网中有效路径的确定方法是进行各类随机交通流量分配的关键技术.文章将交通路网中节点位置的确定性与交通出行中路径选取的有向性相结合,模拟树的生长,提出了一种有效路径的定向树搜索算法.通过将该方法应用于随机用户均衡分配模型,说明了该方法的有效性.     

Application of genetic algorithms for joint optimization of signal setting parameters and dynamic traffic assignment for the real network data

This paper presents the joint optimization of signal setting parameters and dynamic user equilibrium (DUE) traffic assignment for the congested urban road network. The simulation-based approach is employed to obtain the DUE condition for the case of multiple-origin multiple-destination traffic flows. The dynamic traffic assignment simulation program (DTASP), developed in C language is used to assign the traffic dynamically on the road network, whereas method of successive averages (MSA) is modified and used to arrive at the DUE condition. The artificial intelligence technique of genetic algorithms (GAs) is applied to obtain the optimal signal setting parameters and path flow distribution factor for DUE condition. The methodology developed in such a way that joint optimization of signal setting parameters with DUE is obtained. The proposed method is applied to the real network data of Fort Area of Mumbai city comprising of 17 nodes and 56 unidirectional links with 72 Origin–Destination pairs, where all the 17 nodes are signalized intersections. The traffic flow condition for the optimized signal setting parameters is considerably improved compared to the existing signal settings. The results prove that the GA is an effective technique to solve the joint optimization problem for the real network data.     

Multimodal,multiclass stochastic dynamic traffic assignment for evaluating information provision strategies

A multimodal, multiclass stochastic dynamic traffic assignment model was developed to evaluate pre‐trip and enroute travel information provision strategies. Three different information strategies were examined: user optimum [UO], system optimum [SO] and mixed optimum [MO]. These information provision strategies were analyzed based on the levels of traffic congestion and market penetration rate for the information equipment. Only two modes, bus and car, were used for evaluating and calculating the modal split ratio. Several scenarios were analyzed using day‐to‐day and within day dynamic models. From the results analyzed, it was found that when a traffic manager provides information for drivers using the UO strategy and drivers follow the provided information absolutely, the total travel time may increases over the case with no information. Such worsening occurs when drivers switch their routes and face traffic congestion on the alternative route. This phenomenon is the 'Braess Paradox'.     

智能移动系统中大规模分布式车辆路径规划问题研究

本文针对智能交通和主动交通管理提出了一种适用于大规模交通分配和路径规划的分布式计算方法。讨论了通过信息传递接口(MPI)在多中央处理器(CPU)上并行计算实现的一系列研究需求和实现挑战;将基于时空事件的车辆路径规划模型应用于大规模的城市路网仿真;将原始车辆路径规划模型分解为一系列计算效率较高的子问题,大幅减少了仿真耗时和通信开销。通过将子问题分发到单独的分布式CPU上,使CPU可以同时执行其任务,并保证较好的负载平衡。重点分析了将所提出的方法应用于北京路网大规模路径规划,以及该方法在不同CPU核数下的计算效率。结果表明:所提出的并行计算方法可以显著减少计算耗时,并在512个计算节点上实现200倍以上的加速比。     

滑坡监测无线传感器网络基于事件的信道分配方案

在高速铁路沿线的山体斜坡上部署无线传感器网络,用于监测山体斜坡变化情况。综合考虑传感器节点能量有限性和对采集信息的实时性需求,提出一个基于事件的信道分配方案用于滑坡监测信息的传输。以是否有列车经过山体斜坡区域作为事件,当无列车经过时,为节点分配活跃周期和睡眠周期,采用TDMA的方式唤醒节点并分配一个可用信道进行数据传输,从而在保证数据传输的前提下节省节点能量,延长网络寿命;当有列车即将经过时,节点完全进入活跃周期,采用多个信道并行传输的方式传输数据,减少传输过程中由于信息碰撞造成的信息丢失和重传,从而降低传输时延,提高信息传输的实时性。最后,通过仿真实验分析系统性能,证明所提方案的有效性。     

DEADBEAT COVARIANCE CONTROLLER DESIGN FOR SAMPLED-DATA SYSTEMS

ＭＰＬＥＤ－ＤＡＴＡ ＳＹＳＴＥＭＳTX＠霍沛军＠王子栋ＩｎｔｒｏｄｕｃｔｉｏｎＳａｍｐｌｅｄ－ｄａｔａｆｅｅｄｂａｃｋｃｏｎｔｒｏｌｈａｓｒｅｃｅｉｖｅｄｍｕｃｈａｔｅｎｔｉｏｎｉｎｔｈｅａｒｅａｏｆｃｏｎｔｒｏｌｓｙｓｔｅｍｄｅ－ｓｉｇｎｂｅｃａｕｓｅｏ...     

A generic class of first order node models for dynamic macroscopic simulation of traffic flows

Node models for macroscopic simulation have attracted relatively little attention in the literature. Nevertheless, in dynamic network loading (DNL) models for congested road networks, node models are as important as the extensively studied link models. This paper provides an overview of macroscopic node models found in the literature, explaining both their contributions and shortcomings. A formulation defining a generic class of first order macroscopic node models is presented, satisfying a list of requirements necessary to produce node models with realistic, consistent results. Defining a specific node model instance of this class requires the specification of a supply constraint interaction rule and (optionally) node supply constraints. Following this theoretical discussion, specific macroscopic node model instances for unsignalized and signalized intersections are proposed. These models apply an oriented capacity proportional distribution of the available supply over the incoming links of a node. A computationally efficient algorithm to solve the node models exactly is included.     

Schedule-based transit assignment model with vehicle capacity and seat availability

In this paper, we propose a new schedule-based equilibrium transit assignment model that differentiates the discomfort level experienced by sitting and standing passengers. The notion of seat allocation has not been considered explicitly and analytically in previous schedule-based frameworks. The model assumes that passengers use strategies when traveling from their origin to their destination. When loading a vehicle, standing on-board passengers continuing to the next station have priority to get available seats and waiting passengers are loaded on a First-Come-First-Serve (FCFS) principle. The stimulus of a standing passenger to sit increases with his/her remaining journey length and time already spent on-board. When a vehicle is full, passengers unable to board must wait for the next vehicle to arrive. The equilibrium conditions can be stated as a variational inequality involving a vector-valued function of expected strategy costs. To find a solution, we adopt the method of successive averages (MSA) that generates strategies during each iteration by solving a dynamic program. Numerical results are also reported to show the effects of our model on the travel strategies and departure time choices of passengers.