交通灯数学模型

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

基于裂纹尖端二阶弹性解的断裂过程区尺度

基于Westergaard应力函数裂纹尖端二阶弹性解,推导了裂纹尖端微裂区的轮廓线和特征尺寸的解析表达式;采用幂函数模型描述的拉应变软化模型,确定了在最大拉应力强度理论和最大拉应变强度理论下断裂过程区（FPZ）临界值的解析表达式;将基于Westergaard应力函数一阶弹性解及二阶弹性解、Muskhelishvili应力函数和Duan-Nakagawa模型确定的FPZ临界值进行了比较．结果表明裂纹尖端微裂区和FPZ临界值随着Poisson比的减小而增加并逐渐趋近于应用最大拉应力强度理论确定的结果;二阶弹性解确定的裂纹尖端微裂区和FPZ临界值大于一阶弹性解的值;FPZ临界值随着拉应变软化指数的增加而增加;二阶弹性解确定的FPZ临界值的精度远高于一阶弹性解确定的值.     

交通流瓶颈效应的运动学描述.

采用一个推广的LWR模型研究交通瓶颈效应.通过求解流通量间断的Riemann问题,得到关于模型解结构的解析结果,由此导出了描述在瓶颈上游车流的排队现象及其队列长度和高度(密度)的一个典型解,并能够构造模型方程的一种δ-映射算法.更有意义的是,表明了通过采用三角形基本图,这一运动学模型能够描述时走时停波.通过数值模拟,验证丁数值结果与解析结果的一致性,从而支撑了文章的理论结果.     

基于M/M/1/K模型的车道占用对道路通行能力影响的分析与预测

依据一段实时路况监控视频,采用T型交叉平面口模型对事故所处横断面的实际通行能力进行建模.运用排队论的M/M/1/K模型对交通事故所影响路段的车辆排队长度与事故横断面实际通行能力、事故持续时间、路段上游车流量之间的关系进行建模,利用MATLAB软件与微元法思想进一步拟合与改进,并用模型预测出新交通条件下车辆排队至上游路口的时间,说明模型的有效性.     

竞争扩散时滞模型的稳定性和Hopf分歧

本文研究一类含扩散的竞争时滞模型的定常解的稳定性以及Ｈｏｐｆ分坡解的存在性,进而给出分歧周期解的稳定性和分歧方向。     

描述地球物理流动的磁流体型发展方程定常解的Lr指数稳定性

本文证明了R^n(n=2,3)中有界区域上描述地球物理流动的磁流体型发展方程的定常解的存在唯一性，在外力满足适当的条件下，证明了任何非定常的L^r(r≥2）有界解当t→∞时按指数次幂趋于定常解。     

基于实际路网情境的配送车辆调度优化

在实际路网情境下结合车道数、车道宽度、路口信号灯设置等路网物理特性,构建了考虑综合交通阻抗的多车型车辆调度模型,提出了两阶段求解策略:第1阶段设计了改进A-star精确解算法用于计算客户时间距离矩阵;第2阶段针对实际路网的特征设计了混合模拟退火算法求解调度方案。以大连市某配送中心运营实例进行路网情境仿真试验,结果表明:改进A-star算法较改进Dijkstra算法具有更短的路径搜索时间;混合模拟退火算法求解结果较实际调度方案优化了13.1% 的综合成本;路网增流、区域拥堵和路段禁行三类路网情境均能对配送方案的车辆配置、路径选择、客户服务次序、作业时间和违约费用等5方面内容产生干扰,调度计划的制定需要详细考虑这些因素的变化。     

具有无界分段常矩阵的n阶微分方程解空间的分解

分段定常系统在微分方程稳定性理论及应用中,特别是在现代科学技术实践中,是一种常见的数学模型。如时变线性微分方程的冻结系统往往就是分段定常系统([1][2])。在文[3]中研究了三阶无界分段定常系统。本文将讨论n阶分段定常系统解的上、下指数并以上下指数为特征将其解空间分解为若干子空间的直接和。所得结论对其稳定性研究和定性研究都提供了重要依据。     

黎曼曲面到S2的非均匀Landau-Lifshitz方程组

本文主要考虑从黎曼曲面到S2的非均匀Landau-Lifshitz方程组的解的存在性.证明了对于适当初始值,方程是存在唯一的,除有限个点外处处正则的整体解,并且该解在每一奇点处爆破成一个光滑的调和映射.还讨论了方程组在IR22上定常解的不存在性.     

时滞微分方程定常解稳定性改变的几何判别法

针对一类系数含时滞的时滞微分方程,讨论了时滞对微分方程定常解稳定性的影响,建立了定常解稳定性发生改变的几何判别法.     

A hybrid approach for optimal design of signalized road network

For a signalized road network with expansions of link capacity, the maximum possible increase in travel demands is considered while total delays for travelers are minimized. Using the concept of reserve capacity of signal-controlled junctions, the problem of finding the maximum possible increase in travel demand and determining optimal link capacity expansions can be formulated as optimization programs. In this paper, we present a new solution approach for simultaneously solving the maximum increase in travel demands and minimizing total delays of travelers. A projected Quasi-Newton method is proposed to effectively solve this problem to the KKT points. Numerical computations and comparisons are made on real data signal-controlled networks where obtained results outperform traditional methods.     

A heuristic method for the capacitated arc routing problem with refill points and multiple loads

We describe a solution procedure for a capacitated arc routing problem with refill points and multiple loads. This problem stems from the road network marking in Quebec, Canada. Two different types of vehicles are used: the first type (called servicing vehicle—SV) with a finite capacity to service the arcs and the other (called refilling vehicle—RV) to refill the SV vehicle.The RV can deliver multiple loads, which means that it meets the SV several times before returning to the depot. The problem consists of simultaneously determining the vehicle routes that minimize the total cost of the two vehicles.We present an integer formulation and a route first-cluster second heuristic procedure. Computational results are provided.     

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.     

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

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

On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm

The Multi-Compartment Vehicle Routing Problem involves clients with a demand for different products and vehicles with several compartments to co-transport these commodities. We present a local search procedure that explores well-known moves (2-opt, cross, exchange, relocate), and exploits the mechanisms of neighbour lists and marking to speed up the searches. We combine the procedure with the Guided Local Search meta-heuristic to improve solution quality. Extensive computational results are reported to uncover when co-distribution by vehicles with multiple compartments is better than separate distribution with un-partitioned trucks. Sensitivities in key problem parameters including, client density and location of the depot, vehicle capacity, client demand and number of commodities are investigated.     

Optimization models for assessing the peak capacity utilization of intelligent transportation systems

With limited economic and physical resources, it is not feasible to continually expand transportation infrastructure to adequately support the rapid growth in its usage. This is especially true for traffic coordination systems where the expansion of road infrastructure has not been able to keep pace with the increasing number of vehicles, thereby resulting in congestion and delays. Hence, in addition to striving for the construction of new roads, it is imperative to develop new intelligent transportation management and coordination systems. The effectiveness of a new technique can be evaluated by comparing it with the optimal capacity utilization. If this comparison indicates that substantial improvements are possible, then the cost of developing and deploying an intelligent traffic system can be justified. Moreover, developing an optimization model can also help in capacity planning. For instance, at a given level of demand, if the optimal solution worsens significantly, this implies that no amount of intelligent strategies can handle this demand, and expanding the infrastructure would be the only alternative. In this paper, we demonstrate these concepts through a case study of scheduling vehicles on a grid of intersecting roads. We develop two optimization models namely, the mixed integer programming model and the space-time network flow model, and show that the latter model is substantially more effective. Moreover, we prove that the problem is strongly NP-hard and develop two polynomial-time heuristics. The heuristic solutions are then compared with the optimal capacity utilization obtained using the space-time network model. We also present important managerial implications.     

Traffic flow modelling with junctions

Motivated by the modelling of a roundabout, we are led to study the traffic on a road with points of entry and exit. In this note, we would like to describe the modellisation of a junction and solve the Riemann problem for such a model. More precisely, between each point of discontinuity we use a multi-class extension of the LWR model to describe the evolution of the density of the vehicles, the ‘multi-class’ approach being used in order to distinguish the vehicles after their origin and destination. Then, we treat the points of entry and exit thanks to special boundary conditions that give bounds on the flows of the different types of vehicles. In the case of the one-T road we obtain a result of existence and uniqueness. This first step allows us to obtain a similar result for the n-T road. We describe these results and also some properties of the obtained solutions, in order to see how long this model is valid.     

A hybrid optimization algorithm for area traffic control problem

For an area traffic control road network subject to equilibrium flows, the maximum possible increase in travel demands is considered while total delays for travellers are minimized with respect to the common cycle time, the starts and durations of green times and the offsets. Using the concept of reserve capacity of signal-controlled junctions, the problem of finding the maximum increase in traffic demands can be formulated as a mathematical program with equilibrium constraints. In this paper, we present a hybrid optimization algorithm to simultaneously solve the maximum increase in travel demands and minimizing total delays of travellers. Numerical computations are made for the values of performance index and the reserve capacity achieved at various sets of initial signal settings on a variety of signal-controlled networks. Encouraging results are obtained when compared with other alternatives.     

环形路网上带有服务时长的在线TSP问题

为了提高快递揽件的时效性,需要对快递车辆进行有效调度。针对环形路网上服务时长以及需求无法预知的揽件问题,本文提出了以服务总时间尽可能短为目标的环形路网上带有服务时长的在线旅行商问题。用在线算法分析了此问题竞争比的下界,设计了两个在线算法并分析了各自的竞争比,结果表明服务时长可以改善在线车的性能。最后通过简单算例对两个算法进行说明,本文研究结论可以为环形路网上的快递车辆实时调度提供指导。     

A general model of road traffic accidents

A general model that relates road traffic accidents to the number of vehicles involved, and the number of primary causes of such accidents, is presented. The model considers traffic accidents as failures of a road traffic network system to meet social and economic constraints, and therefore as a measure of the unreliability of such a system. The equations apply to accidents in the real time domain as well as to mean values per unit of vehicle exposure time or vehicle distance. They also apply to single vehicles and drivers, groups of drivers and fleets of vehicles, and the entire vehicle and driving population. They can be used for sections of a network or for a whole network.The equations used have a large number of terms, hence bias errors are common in road accident investigations.