基于个体出行链的区域城际铁路规划方法研究

基于"基础设施即服务"的理念研究区域城际铁路规划问题,精准考虑带时间窗的个体出行特征和运输服务供给,构建时空网络联系基础设施、服务供给和出行需求3个维度.在所有路段存在的前提下,考虑城际铁路、城市轨道交通和城市道路等基础设施及其运输服务供给,为每类出行者生成满足其出行时间窗的备选出行链集合,以所有出行者广义费用和总投资...     

考虑空车调配协调的货物列车开行方案优化研究

为实现空车调配与货物列车开行方案协调优化,结合基本运行图架构与车流径路,构建货运时空服务拓展网络。考虑配空与装卸取送、集编发等环节的时间接续要求,节点与区段不对流空车要求,以重车流全程运送与空车配送等广义总费用最少为目标,建立整数规划弧路模型。针对既有算法设计局限性,结合重车或空车配空的时间接续要求,提出将不同的 k 短路重车流方案与空车配空方案相关联的改进可行解构造方法,设计混合差分进化求解算法。实例研究表明,考虑空车调配进行重车、空车流组织协调优化,能够减少空车走行费用,及时满足装车需求,有效保证作业车流配合中转车流集结编组及时挂线,提高方案可实施性。     

货车轨迹数据在公路货运系统中应用研究综述

随着轨迹数据可获取性及精度的持续提高,货车轨迹数据被广泛应用于公路货运系统的 规划与管理中,同时,人工智能和大数据分析技术的快速发展也为公路货运系统研究带来新的机 遇与挑战。本文全面梳理并总结了公路货运轨迹数据应用领域的相关研究,从基于轨迹数据的 货运出行信息辨识、货运系统关键特征预测、货运轨迹数据进一步应用3个方面回顾现有文献的 研究目标、主要内容和研究方法。通过文献分析发现：货运出行信息辨识研究聚焦于货运停留 点、车辆和货物、活动出行模式等热点主题,但现有辨识方法多移植于旅客出行研究,需要更多地 考虑货运出行的独特特征。在货运系统关键特征预测方面,研究者主要针对货运行程时间、空间 位置、出行需求等主题展开研究,并证明了基于轨迹数据预测货运特征的可行性,但预测时空范 围较为局限,需要根据具体的货运任务、货车司机特征和货运政策进行深入研究。此外,轨迹数 据也被应用于货运出行路径选择行为、货运停车休息行为、行驶安全、货运排放和能耗分析、货运 政策评估等研究。最后,在总结现有研究不足的基础上,本文认为未来研究应重点将货运轨迹数 据与其他多源数据相结合,从3个关键技术进行突破：一是针对货运实践个体,重点探索高效货车 驾驶员的出行特征和出行模式,并在货运系统中进行推广应用;二是针对交通运输新技术和新形 势,重点开发和优化自动驾驶技术和重大应急事件影响下的货运组织模式与策略;三是针对货运 供需关系及匹配机制,重点研究货运全流程供需状态辨识与预测,并结合深度学习等方法训练和 开发智能供需匹配模型,从而优化货运系统调度,助力社会散乱运力资源整合,提高货运系统的 综合效率。     

地铁网络服务韧性评估与最优恢复策略

针对已有基于拓扑效率的地铁网络韧性指标无法反映地铁运营实际的不足,构建考虑线 路流量影响的路网服务效率指标和基于服务效率的路网服务韧性指标,以及基于路网服务效率 的节点重要度指标;提出以路网服务韧性最大化为目标的优化模型,并基于遗传算法求解模型获 得最优恢复策略。算例结果表明：分别以服务效率和拓扑效率作为路网性能指标,获得的失效节 点恢复次序明显不同;蓄意攻击下,最优恢复策略获得的路网服务韧性分别比基于重要度的优先 恢复策略、基于节点度的优先恢复策略和随机恢复策略高16.76%、72.11%和86.21%。上述结果 表明,必须根据地铁运营实际合理选择路网性能指标和恢复策略,否则可能得到次优甚至明显偏 离实际的方案,无法实现预期目标。     

基于网络交通分配方法族谱的交通分配 一体化技术与工程应用

为满足交通规划、建设与管理等应用场景对交通分配多样化的需求,结合目前交通分配方 法族谱中的众多模型与方法,本文构建能够满足族谱中所有交通分配特征的一体化交通分配技 术框架,提出交通网络交通分配一体化技术体系,并将该体系嵌入交通分析平台软件“交运之星- TranStar”中。该技术体系包括：“模型关键参数”“交通阻抗函数”“交通网络交通分配基础模型与 快速算法”3部分模块组合的分析模型一体化;面向步行、自行车、机动车及公共交通等多模式交 通网络的分析对象一体化;针对城市土地开发,交通网络建设,交通管理控制,公共交通系统,以 及交通政策制定等应用场景一体化。选取南京市道路网络和公交网络进行实证分析。结果表 明,本文提出的交通分配一体化技术具有处理超万节点多模式交通网络的能力,对各类交通模 式、典型业务场景的分析结果可为城市交通系统规划、建设与管理提供决策支持。     

Cellpath: Fusion of cellular and traffic sensor data for route flow estimation via convex optimization

A new convex optimization framework is developed for the route flow estimation problem from the fusion of vehicle count and cellular network data. The issue of highly underdetermined link flow based methods in transportation networks is investigated, then solved using the proposed concept of cellpaths for cellular network data. With this data-driven approach, our proposed approach is versatile: it is compatible with other data sources, and it is model agnostic and thus compatible with user equilibrium, system-optimum, Stackelberg concepts, and other models. Using a dimensionality reduction scheme, we design a projected gradient algorithm suitable for the proposed route flow estimation problem. The algorithm solves a block isotonic regression problem in the projection step in linear time. The accuracy, computational efficiency, and versatility of the proposed approach are validated on the I-210 corridor near Los Angeles, where we achieve 90% route flow accuracy with 1033 traffic sensors and 1000 cellular towers covering a large network of highways and arterials with more than 20,000 links. In contrast to long-term land use planning applications, we demonstrate the first system to our knowledge that can produce route-level flow estimates suitable for short time horizon prediction and control applications in traffic management. Our system is open source and available for validation and extension.     

A modified reinforcement learning algorithm for solving coordinated signalized networks

This study proposes Reinforcement Learning (RL) based algorithm for finding optimum signal timings in Coordinated Signalized Networks (CSN) for fixed set of link flows. For this purpose, MOdified REinforcement Learning algorithm with TRANSYT-7F (MORELTRANS) model is proposed by way of combining RL algorithm and TRANSYT-7F. The modified RL differs from other RL algorithms since it takes advantage of the best solution obtained from the previous learning episode by generating a sub-environment at each learning episode as the same size of original environment. On the other hand, TRANSYT-7F traffic model is used in order to determine network performance index, namely disutility index. Numerical application is conducted on medium sized coordinated signalized road network. Results indicated that the MORELTRANS produced slightly better results than the GA in signal timing optimization in terms of objective function value while it outperformed than the HC. In order to show the capability of the proposed model for heavy demand condition, two cases in which link flows are increased by 20% and 50% with respect to the base case are considered. It is found that the MORELTRANS is able to reach good solutions for signal timing optimization even if demand became increased.     

Application of Lagrangian relaxation approach to α-reliable path finding in stochastic networks with correlated link travel times

This study investigates the important problem of determining a reliable path in a stochastic network with correlated link travel times. First, the distribution of path travel time is quantified by using trip records from GPS probe vehicles. Second, the spatial correlation of link travel time is explicitly considered by using a correlation coefficient matrix, which is incorporated into the α-reliable path problem by Cholesky decomposition. Third, the Lagrangian relaxation based framework is used to handle the α-reliable path problem, by which the intractable problem with a non-linear and non-additive structure can be decomposed into several easy-to-solve problems. Finally, the path-finding performance of this approach is tested on a real-world network. The results show that 15 iterations of calculation can yield a small relative gap between upper and lower bounds of the optimal solution and the average running time is about 5 s for most OD settings. The applicability of α-reliable path finding is validated by a case study.     

Predicting the adoption of connected autonomous vehicles: A new approach based on the theory of diffusion of innovations

On the grounds that individuals heavily rely on the information that they receive from their peers when evaluating adoption of a radical innovation, this paper proposes a new approach to forecast long-term adoption of connected autonomous vehicles (CAVs). The concept of resistance is employed to explain why individuals typically tend to defer the adoption of an innovation. We assume that there exists a social network among individuals through which they communicate based on certain frequencies. In addition, individuals can be subject to media advertisement based on certain frequencies. An individual’s perceptions are dynamic and change over time as the individual is exposed to advertisement and communicates with satisfied and dissatisfied adopters. We also explicitly allow willingness-to-pay (WTP) to change as a result of peer-to-peer communication. An individual decides to adopt when (i) there is a need for a new vehicles; (ii) his/her WTP is greater than CAV price; and (iii) his/her overall impression about CAVs reaches a cutoff value. Applicability of the proposed approach is shown using a survey of employees of the University of Memphis. Our results show that the automobile fleet will be near homogenous in about 2050 only if CAV prices decrease at an annual rate of 15% or 20%. We find that a 6-month pre-introduction marketing campaign may have no significant impact on adoption trend. Marketing is shown to ignite CAV diffusion but its effect is capped. CAV market share will be close to 100% only if all adopters are satisfied with their purchases; therefore, the probability that an individual becomes a satisfied adopter plays an important role in the trend of adoption. The effect of the latter probability is more pronounced as time goes by and is also more prominent when CAV price reduces at greater rates. Some caveats may be inserted when considering the study results as the findings are subject to sample bias and data limitations.     

Capturing correlation with a mixed recursive logit model for activity-travel scheduling

Representing activity-travel scheduling decisions as path choices in a time–space network is an emerging approach in the literature. In this paper, we model choices of activity, location, timing and transport mode using such an approach and seek to estimate utility parameters of recursive logit models. Relaxing the independence from irrelevant alternatives (IIA) property of the logit model in this setting raises a number of challenges. First, overlap in the network may not fully characterize perceptual correlation between paths, due to their interpretation as activity schedules. Second, the large number of states that are needed to represent all possible locations, times and activity combinations imposes major computational challenges to estimate the model. We combine recent methodological developments to build on previous work by Blom Västberg et al. (2016) and allow to model complex and realistic correlation patterns in this type of network. We use sampled choices sets in order to estimate a mixed recursive logit model in reasonable time for large-scale, dense time-space networks. Importantly, the model retains the advantage of fast predictions without sampling choice sets. In addition to estimation results, we present an extensive empirical analysis which highlights the different substitution patterns when the IIA property is relaxed, and a cross-validation study which confirms improved out-of-sample fit.