交通网络最短路权矩阵的迭代算法

介绍了求解交通网络最短路权矩阵的3种迭代算法,从迭代思路、时间复杂度、程序可读性等方面进行了比较,指出各算法的异同点以及联系,最后通过一个具体网络模拟了各算法的迭代过程.     

Reliable route guidance: A case study from Chicago

Reliable route guidance can be obtained by solving the reliable a priori shortest path problem, which finds paths that maximize the probability of arriving on time. The goal of this paper is to demonstrate the benefits and applicability of such route guidance using a case study. An adaptive discretization scheme is first proposed to improve the efficiency in computing convolution, a time-consuming step used in the reliable routing algorithm to obtain path travel time distributions. Methods to construct link travel time distributions from real data in the case study are then discussed. Particularly, the travel time distributions on arterial streets are estimated from linear regression models calibrated from expressway data. Numerical experiments demonstrate that optimal paths are substantially affected by the reliability requirement in rush hours, and that reliable route guidance could generate up to 5-15% of travel time savings. The study also verifies that existing algorithms can solve large-scale problems within a reasonable amount of time.     

A probabilistic framework for weather-based rerouting and delay estimations within an Airspace Planning model

In this paper, we develop a novel severe weather-modeling paradigm to be applied within the context of a large-scale Airspace Planning and collaborative decision-making model in order to reroute flights with respect to a specified probability threshold of encountering severe weather, subject to collision safety, airline equity, and sector workload considerations. This approach serves as an alternative to the current practice adopted by the Federal Aviation Administration (FAA) of adjusting flight routes in accordance with the guidelines specified in the National Playbook. Our innovative contributions in this paper include (a) the concept of “Probability-Nets” and the development of discretized representations of various weather phenomena that affect aviation operations; (b) the integration of readily accessible severe weather probabilities from existing weather forecast data provided by the National Weather Service; (c) the generation of flight plans that circumvent severe weather phenomena with specified probability threshold levels, and (d) a probabilistic delay assessment methodology for evaluating planned flight routes that might encounter potentially disruptive weather along its trajectory. Additionally, we conduct an economic benefit analysis using a k-means clustering mechanism in concert with our delay assessment methodology in order to evaluate delay costs and system disruptions associated with variations in probability-net refinement-based information. Computational results and insights are presented based on flight test cases derived from the Enhanced Traffic Management System data provided by the FAA and using weather scenarios derived from the Model Output Statistics forecast data provided by the National Weather Service.     

综合运输网络上多货类流量最短路分配

针对综合运输网络资源合理配置的需求,分析了综合运输网络上影响路径选择行为的用户偏好体系,并将其概括成客观类、主观类和调控类。在给出选择偏好在路径选择模型中的表达方法基础上,阐述了采用改进的最短路加载方法进行多货类运输流量分配的思路和执行流程,并面向可持续发展政策导向的运输网络规划,引入"诱导参数"对处于合理路径集中的联合运输路径进行优先选择。最后通过算例分析了不同"诱导参数"对双货类网络流量分布的影响,从政策调控的角度为综合运输网络宏观布局的评价模型提供理论参考。     

不同荷载作用下半刚性沥青路面力学响应规律

基于半刚性基层路面典型结构建立三维力学模型,综合考虑常载、常载+刹车、超载和超载+刹车4种组合荷载,采用双轮最不利矩形接触面形式,并运用特征路径分析方式,数值模拟了路表及深层内力学响应规律。结果表明:刹车对路表弯沉和路基顶面压应变影响较小,超载影响显著;刹车主要对面层弯拉应力影响较大,并使上面层出现较大拉应力,对基层基本无影响,超载使基层弯拉应力增大显著;超载和刹车对剪应力峰值增大明显,特别是刹车使剪应力增大极其显著;在不同荷载作用下,从路表沿深度方向力学响应峰值位置会发生变化,在进行沥青路面结构设计和力学分析时应取相应位置处的值作为力学控制指标。     

满足交通网络流量增长态势的扩能优化研究

在交通网络的实际应用中,流量的发展态势往往超出现存网络的最大流量承载能力,这就需要考虑如何提高网络的输送能力,即如何对交通网络进行扩能。本文基于发展态势的流量需求、扩能代价最低以及扩能拥堵程度高的线路条件,构造了最优的扩能算法。通过此算法,可以选择交通网络中最优的扩能路线。在交通运输领域,由于流量的发展态势需要扩能的问题普遍存在,本文的研究内容可以为交通网络的扩能决策、优化、设计等提供应用基础。     

交通运输网络能力限制路段分析及扩能优化研究

交通运输网络是交通运输系统的重要组成部分,确定交通运输网络中的能力限制路段,设计合理的路网扩能优化方案都是交通运输部门需要面临的问题。本文依据最大流理论制订了路网能力限制路段的确定方法,建立了以换算扩能费用最小为目标的扩能优化模型并设计了相应的求解算法。算例表明,本文研究的模型及算法是有效的,且扩能优化方案中的扩能路段与路网能力限制路段基本上是一致的。     

求网络中全部最短路的径路延伸算法

在分析已有最短路问题研究成果的基础上,提出了最小最短路网络的概念,给出了求网络上始点到所有顶点间全部最短路的径路延伸算法以及最小最短路网络、最小最短路树的算法.通过算例,验证了算法的可行性.算法简便,易于理解.     

随机交通网络约束最可靠路径问题

为了模拟仿真交通网络中,约束条件下考虑风险性车辆路径选择行为,建立随机交通网络环境下约束最可靠路径问题数学规划模型,并讨论了其对偶问题.采用梯度下降算法求解对偶问题,获得原问题最优值的上界和下界,通过迭代获得原问题的近似解.针对Sioux Falls network展开数值试验并对数值结果进行了对比分析.计算结果表明：在随机交通网络环境下,无约束和有约束条件下求解的最可靠路径是不同的;不同的资源约束条件下求解的最可靠路径也是不同的,资源约束条件对交通网络中最可靠路径的选择有很大的影响.     

Accommodating user preferences in ad hoc shared ride trip planning using GIS

Ad hoc shared ride trip planning (SRTP) utilizes mobile devices, geo-sensors and wireless networks to match on-the-fly individual travel demand with transport supply. It represents one of many alternatives to single occupancy vehicle use. This paper outlines a SRTP approach via a two-phase algorithm based on user preferences in a time-dependent routing. Whereas current algorithms use minimization of travel time as the only optimization criterion in trip planning, in the framework presented here, the user can specify multiple trip preferences including travel time, walking time, number of transfers between cars and trip length. Various scenarios are simulated in the city of Tehran (Iran) to demonstrate how preference settings affect the routes of ad hoc shared journeys.