城市老旧居住小区交通环境评价指标与评价方法

定量的评判城市老旧居住小区整体交通环境质量并进而科学有效的提出老旧小区交通环境更新与改善措施,对城市老旧居住小区交通环境进行了调查,明确了老旧居住小区存在的突出交通问题,并提出了城市老旧居住小区交通环境评价的指标体系,包括行人跨路出行指数、无人行道路段长度占比、停车泊位供需比、路内非法停车占比、平均停车步行距离、泊位数量户数比、人均步行空间、无障碍通道、盲道设置比例、非机动车泊位供需比、地面停放车辆数小区面积比、外部穿行交通周转量小区面积比等。并给出了具体指标的计算方法与获得办法。以长沙市四个典型老旧居住小区为例,对评价方法进行了论证,并得到城市老旧居住小区存在的一般问题,包括人车混杂、人车交织现象严重,停车泊位短缺、车辆乱停乱放,交通设施、特别是弱势群体交通设施缺乏。给出的评价指标、评价方法与结论可为城市老旧小区改造更新,特别是其中很重要的交通环境更新提供决策依据。     

基于深度学习LSTM对交通流状态的预测

当今道路交通状态对城市管理和人们出行愈加重要,影响着人类生活的方方面面.以深圳交通为研究对象,由基础车辆数据和道路坐标构建了路网系统,从车辆速度和密度两个方面导出了交通流状态评价指数TSI.利用深度学习长短期记忆神经网络(LSTM)对车辆速度和密度两个指标进行预测,并通过对比极限学习机(ELM),时间序列(ARMA)和BP神经网络,进行仿真实验,结果表明相对于传统预测模型,所采用的LSTM网络具有更优的预测精确度和对远期预测的稳定性.最后利用预测结果计算出更能直观反映出道路交通拥堵情况的TSI指数,为人们提供了准确的交通状态预测.     

道路维修施工路段交通分流信控优化模型

针对道路维修施工期间常采用的部分路面封闭施工且利用辅路进行分流的情形,探讨了交通分流信控优化模型。借助交通流波动理论,分析了施工路段及其前后车流拥挤排队及疏散特征和规律,分析了对车流进行控制需满足的约束,并分析了车流的延误计算公式。以总的车辆行驶时间最小化目标,原路径及分流路径的绿时分配及信号周期为优化参数,考虑交通分流控制的各种约束,建立了道路施工路段交通分流信控优化模型。分析了该模型属于非凸问题,因此提出了一种近似求解最优解的办法。通过一个示例对模型和求解算法进行了验证,并对一些规律性结果进行了分析。     

基于SPCP解析的平均移动距离和城市交通模式

SPCP是一项关于以评估城市内部道路交通网络各段拥挤度,来反映相应道路在该城市道路网中所占重要程度的研究．在通过对于包括东京在内的日本一些城市的应用,其实用性已得到了广泛验证．本论文从理论上揭示了SPCP所近似反映的一种城市交通模式,从而为其为何能够在现实城市中被应用提供了理论性依据．此外在本文中,基于被展示的城市交通模型和SPCP,我们还推导计算出了一项经常用于衡量城市道路交通有效性的尺度-城市内道路交通移动所需平均距离．     

城市公共交通线路的优化设计

本文以成都市的公共交通为背景,在给定的道路网、车站分布及行驶的车辆数等条件下,以减少乘客使用公共交通工具所花时间为目标,提出了城市公共交通线路的优化设计问题.本文参考[1]中的基本思路,把优化设计分为两个步骤,首先建立符合营运要求的初始线路网,然后以总交通时间作为判别准则进行线路的调优改进,并结合实际情况及计算过程中发现的问题,在总交通时间的算法及初始线路网的建立方面作了重大改进.文中所用数学工具主要是网络最优化.     

基于改进遗传算法的城市道路级配模型

为缓解交通拥堵的问题,构建满足供需平衡的城市道路等级配置模型.从出行链的特征出发,对道路等级进行分层,结合交通功能进行分类,将城市道路等级划分为三层四类道路.在交通供需平衡、道路总里程、道路用地面积的约束下,以出行总时耗最小为优化目标构建模型,并通过改进的遗传算法求解得各等级道路的级配比.以南京市的城市道路为例进行应用,得到快速路、干路、支路、巷道四类道路的理想级配比为1:4.8:6:7.2.结果表明,该方法对我国城市道路的等级配置有较好的理论借鉴意义.     

基于基尼系数的停车换乘拥挤收费定价模型

许多大城市提倡停车换乘的组合出行方式,目的是减少出行车辆,缓解交通拥挤状况.应用双层规划模型对停车换乘拥挤收费进行研究.下层模型采用弹性需求SUE模型,上层模型考虑了交通公平因素.以各出行方式占用的道路资源为公平指标,应用基尼系数对传统上层模型进行改造,构建一个用户盈余尽可能大而基尼系数尽可能小的上层模型,并利用基尼系数控制参数,实现在不同公平要求下的拥挤收费设计.算例表明,基于基尼系数的停车换乘拥挤收费设计,能改善道路的拥挤状况,且兼顾了用户盈余与公平.     

交通灯数学模型

主要讨论在假定车流均匀的前提下如何安排路口的交通灯时间才能使路口的交通达到最大限度的畅通.这里交通最大限度通畅的定义是一个交通周期内积存车辆的最大可能长度达到最小.文章首先以最大限度通畅为目标,道路条件、行人通过马路等条件为约束,建立优化模型解决孤立丁字路口的交通灯安排问题,这个模型也适用于孤立十字路口的分析.随后文章建立了多个路口相连时路口交通灯的安排模型.最后,文章讨论了上述几个模型的稳定性以及改进方向.     

随机激励下四自由度车辆-道路耦合系统动力分析

采用四自由度车辆模型,以 Gauss平稳随机过程模拟路面的不平整度,编制程序得到不同路面等级下的不平整度序列;并将车辆和道路看作一个相互作用的整体系统,建立了车辆 道路耦合系统的动力平衡方程.在对车辆施加随机激励时,为了简化分析过程,避开以往研究中使用随机振动理论求解动轮胎力的复杂性,将得到的路面不平整度序列,直接以向量的形式输入到所建立的动力平衡方程中.基于增量形式的Newmark-β法开发了一个MATLAB程序对该方程进行求解.并对所提出的理论模型进行了试验验证,证明了模型的可靠性.随后,通过一个实例,分析了车速变化、路面等级变化对车辆动荷载系数和车体垂向加速度的影响.最后,对不同路基刚度对车辆振动特性的影响规律进行了探讨.     

半车车辆-道路耦合动力分析模型的研究与应用

在不平整路面上行驶的车辆会产生道路与车辆的耦合振动.为简化分析,先将车辆和道路视为两个子系统,然后再耦合为一个整体系统.车辆采用1/2车辆4自由度模型,道路采用弹性多层体系有限元模型,通过轮胎与路面的位移相容条件,建立车辆-道路整体耦合动力分析模型,推导出了系统的动力平衡方程组,并探讨了方程组的解耦方法,提出了反映车辆运行品质和道路设计参数的理论计算指标,为车-路耦合动力分析的深入研究,以及系统研究道路结构设计参数与车辆运行品质的相互关系提供理论基础和求解依据.此外,通过解耦和编程分析,还对沥青路面和水泥混凝土路面两种典型路面结构的运行品质指标进行了分析和评判,以期为不同路面结构设计和分析提供参考.     

The Road Traffic Analysis Based on an Urban Traffic Model of the Circular Working Field

Under a relatively realistic model,this paper theoretically analyzes the road traffic status inside anurban working field,including its radial roads and circular ones.Concretely,the radial and the circular averagetraveling distances of a car commuter in a tiny ring with wide dx are first derived,and then the necessary roadarea,road area rate distributions,the proportion between the radial and the circular roads to be needed are alsocalculated.The results presented here and the properties shown through the numerical analysis are consideredto be significant at the very beginning stage of designing an urban city.     

基于SD-GM理论的城市交通拥堵收费模型研究

随着中国城市化建设步伐的不断加快,交通拥堵在不断地加剧。同时,因机动车污染物的排放,每年将产生大量的NO_x,从而又会引起严重的大气污染(如“雾霾”污染)。针对这些问题,本文从环境和社会的角度出发,采用系统动力学与灰色系统相结合的方法(SD-GM),构建了城市交通拥堵收费模型,并对模型中主要变量进行动态仿真和决策分析,以此来寻找缓解交通拥堵和减少机动车尾气排放的可行策略。通过现实性测试和敏感性测试,得到拥堵收费的范围不超过100元/天*辆。通过进一步的仿真和结果分析可得到以下结论:(1)在区间[25,40] 内,随着拥堵收费的提高,NO_x存量,机动车出行吸引度和交通拥堵程度都呈下降趋势,而车均道路面积呈上升趋势。(2)但并非拥堵收费越高越好, 超过40 元/天*辆,会产生相反的效果。最后,通过比较分析,得到NO_x存量,机动车出行量,机动车出行吸引度和交通拥堵程度分别下降了约33.76%,39.64%,43.26%,82.25%,而车均道路面积提高了大约65.68%,进而验证了模型的有效性和实用性。     

The traffic problem: Modeling of the overtaking

The classical microscopic single line follow‐the‐leader model of a road traffic may collapse in finite time due to a car collision. In order to avoid the collision, the natural action of a driver would be to overtake the slower car. We propose a simple model of overtaking assuming a circular road. The model is a dynamical system with discontinuous right‐hand side (the Filippov system). As a case study, we assumed that the system consists of N =3 identical cars. We studied a particular periodic solution (oscillatory pattern). We explored the possibility to use the standard software (AUTO97) to continue the pattern with respect to a parameter. Copyright © 2009 John Wiley & Sons, Ltd.     

基于网络等级特征与VMS的交叉巢式Logit模型

基于等级特征与可变信息板(VMS)研究了交叉巢式Logit(CNL)模型及网络交通流分配。综合幂函数与指数函数表示方法给出新的信息效用衰减因子,结合道路等级特征表示VMS对车流的影响系数及CNL模型的分配系数;给出等级结构道路网络的随机用户均衡条件下的交叉巢式Logit路径选择模型及其等价数学规划,并设计网络流分配算法。通过实例网络的计算与分析,得到一些有意义的结论:等级结构越显著的路网总出行时间费用越低且其分散参数(θ)弹性绝对值越大;对具有较强随机性的实际路网,若增加一定的确定性则节省更多网络总出行时间;道路网络中设置了VMS时总出行时间受分散参数的影响更小。     

Car path tracking in traffic flow networks with bounded buffers at junctions

This article deals with the modeling for an individual car path through a road network, where the dynamics is driven by a coupled system of ordinary and partial differential equations. The network is characterized by bounded buffers at junctions that allow for the interpretation of roundabouts or on-ramps while the traffic dynamics is based on first-order macroscopic equations of Lighthill-Whitham-Richards (LWR) type. Trajectories for single drivers are then influenced by the surrounding traffic and can be tracked by appropriate numerical algorithms. The computational experiments show how the modeling framework can be used as navigation device.     

An efficient algorithm for computing traffic equilibria using TRANSYT model

Computing traffic equilibria with signal settings using TRANSYT model for an area traffic control road system is considered in this paper. Following Wardrop’s first principle, this problem can be formulated as a variational inequality problem. In this paper, we propose a novel algorithm to efficiently solve this equilibrium traffic assignment with global convergence. Numerical calculations are conducted on a grid-size road network. As it shows, the proposed method achieved greater savings in computational overheads than did those conventional methods for solving traffic equilibria when signal settings are particularly taken into account.     

Optimal Design of Two Road Networks Based on their Properties

In this paper,we discuss some fundamental properties of two idealized typical networks,namely,grid type and radial-circular type.The discussion is based on SPCP (Shortest Path Counting Problem),whichreflects the traffic density of a road segment.Furthermore,we compare their effectiveness based on the obtainedresults of the above two road networks,and suggest some proposals on the design of car lanes by consideringthe direction of a road segment in relation to these road networks.     

Mean and variance of waiting time and their optimization for alternating traffic control systems

We analyze alternating traffic crossing a narrow one-lane bridge on a two-lane road. Once a car begins to cross the bridge in one direction, arriving cars from the other direction must wait, forming a queue, until all the arrivals in the first direction finish crossing the bridge. Such a situation can often be observed when road-maintenance work is being carried out. Cars are assumed to arrive at the queues according to independent Poisson processes and to cross the bridge in a constant time. In addition, once cars join the queue, each car needs a constant starting delay, before starting to cross the bridge. We model the situation where a signal controls the traffic so that the signal gives a priority to one direction as long as a new car from the same direction arrives in a fixed time. For this model, we get a closed form for the first two moments of the waiting time of cars arriving at the bridge, and then numerically obtain Pareto optimal solutions of holding times to minimize the mean waiting time and its standard deviation. To the memory of our best friend, Yo Ishizuka     

Fast paths in large-scale dynamic road networks

Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by traffic information service providers who wish to offer a realistic fast path computation to GPS terminal enabled vehicles. The heuristic solution method we propose is based on a highway hierarchy-based shortest path algorithm for static large-scale networks; we maintain a static highway hierarchy and perform each query on the dynamically evaluated network, using a simple algorithm to propagate available dynamic traffic information over a larger part of the road network. We provide computational results that show the efficacy of our approach.     

Agent-based modelling and simulation of urban evacuation: relative effectiveness of simultaneous and staged evacuation strategies

This study investigates the effectiveness of simultaneous and staged evacuation strategies using agent-based simulation. In the simultaneous strategy, all residents are informed to evacuate simultaneously, whereas in the staged evacuation strategy, residents in different zones are organized to evacuate in an order based on different sequences of the zones within the affected area. This study uses an agent-based technique to model traffic flows at the level of individual vehicles and investigates the collective behaviours of evacuating vehicles. We conducted simulations using a microscopic simulation system called Paramics on three types of road network structures under different population densities. The three types of road network structures include a grid road structure, a ring road structure, and a real road structure from the City of San Marcos, Texas. Default rules in Paramics were used for trip generation, destination choice, and route choice. Simulation results indicate that (1) there is no evacuation strategy that can be considered as the best strategy across different road network structures, and the performance of the strategies depends on both road network structure and population density; (2) if the population density in the affected area is high and the underlying road network structure is a grid structure, then a staged evacuation strategy that alternates non-adjacent zones in the affected area is effective in reducing the overall evacuation time.