Assessment of schedule-based and frequency-based assignment models for strategic and operational planning of high-speed rail services

Despite some substantial limitations in the simulation of low-frequency scheduled services, frequency-based (FB) assignment models are by far the most widely used in practice. They are less expensive to build and less demanding from the computational viewpoint with respect to schedule-based (SB) models, as they require neither explicit simulation of the timetable (on the supply side), nor segmentation of OD matrices by desired departure/arrival time (on the demand side).The objective of this paper is to assess to what extent the lack of modeling capabilities of FB models is acceptable, and, on the other hand, the cases in which such approximations are substantial and more detailed SB models are needed. This is a first attempt to shed light on the trade-off between (frequency-based) model inaccuracy and (scheduled-based) model development costs in the field of long-distance (e.g. High-speed Rail, HSR) service modeling.To this aim, we considered two modeling specifications estimated using mixed Revealed Preferences (RP) and Stated Preferences (SP) surveys and validated with respect to the same case study. Starting from an observed (baseline) scenario, we artificially altered the demand distributions (uniform vs. time-varying demand) and the supply configuration (i.e. train departure times), and analyzed the differences in modal split estimates and flows on individual trains, using the two different model specifications.It resulted that when the demand distribution is uniform within the period of analysis, such differences are significant only when departure times of trains are strongly unevenly spaced in time. In such cases, the difference in modal shares, using FB w.r.t. SB, is in the range of [0%, +5%] meaning that FB models tend to overestimate HSR modal shares. When the demand distribution is not uniform, the difference in modal shares, using FB w.r.t. SB, is in the range of [−10%, +10%] meaning that FB models can overestimate or underestimate HSR modal shares, depending on timetable settings with respect to travelers’ desired departure times. The differences in on-board train flow estimates are more substantial in both cases of uniform and not uniform demand distribution.     

Waiting time and the role and value of information in scheduled transport

A new logit-based model for assigning public transit passengers to transit lines or routes is proposed. The model is based on the realistic assumption that once passengers arrive at stops, they can obtain information regarding the specific departure times. Furthermore, it takes into account that passengers are heterogeneous and hence, the choice made by a ‘representative’ passenger appears to be stochastic. The model is evaluated by means of simulations.     

环境导向的城市交通分配模型综述

交通分配是智能交通诱导和控制的重要理论依据,研究基于因素的城市交通分配模型极具理论价值和实际意义。考虑环境因素的交通配流问题还刚刚起步,无论是模型的构建还是算法的设计与改进都仍有待于进一步的研究和探讨。系统地综述了目前国内外基于环境因素的交通分配的典型模型和算法,并提出其今后需要改进和发展的方向。     

基于GIS的公交网络模型及其在公交线路查询中的应用

分析了公交网络的特点，研究了如何利用GIS技术建立基于道路网的公交网络模型，提出了基于最优化路径条件下的换乘搜索方法，并探讨了其在公交线路查询中的应用．该方法可用于计划出行路线和提供在线信息，有效综合了线路、费用、时间及相关的动态交通数据．这样的系统可建立在互联网GIS系统中，为出行者提供交互式的服务．     

环境导向的城市交通分配模型综述

交通分配是智能交通诱导和控制的重要理论依据，研究基于因素的城市交通分配模型极具理论价值和实际意义。考虑环境因素的交通配流问题还刚刚起步，无论是模型的构建还是算法的设计与改进都仍有待于进一步的研究和探讨。系统地综述了目前国内外基于环境因素的交通分配的典型模型和算法，并提出其今后需要改进和发展的方向。     

二次曲面绘制的计算机虚拟实验设计

介绍了二次曲面的相关数学知识，探讨了二次曲面图形绘制及特征展示的实验设计，并通过具体实例给出了图形绘制及特征展示的算法过程和程序实现。     

基于混合系统模型预测控制的列车优化运行

为保证列车高效率运行,需要对自动驾驶系统进行高效设计。列车运行过程具有高度非线性化的特性,针对这一特性,通过引入整数变量,建立基于混合系统的列车混合逻辑动态模型,其次考虑列车运行过程的多重约束,通过二次规划求解控制律。同时为了降低控制器计算量,在模型预测控制的基础上引入了阶梯式控制策略。最后利用Matlab仿真软件使其跟踪一条即定曲线,对所提的控制策略进行数值仿真。结果表明,该控制器可以在降低计算量的基础上,保证列车准时高效跟踪既定曲线,当改变控制器参数时,对跟踪效果有较大的影响。仿真结果对本文采用的方法进行了有效验证。     

Dynamic autonomous vehicle fleet operations: Optimization-based strategies to assign AVs to immediate traveler demand requests

Motivated by the growth of ridesourcing services and the expected advent of fully-autonomous vehicles (AVs), this paper defines, models, and compares assignment strategies for a shared-use AV mobility service (SAMS). Specifically, the paper presents the on-demand SAMS with no shared rides, defined as a fleet of AVs, controlled by a central operator, that provides direct origin-to-destination service to travelers who request rides via a mobile application and expect to be picked up within a few minutes. The underlying operational problem associated with the on-demand SAMS with no shared rides is a sequential (i.e. dynamic or time-dependent) stochastic control problem. The AV fleet operator must assign AVs to open traveler requests in real-time as traveler requests enter the system dynamically and stochastically. As there is likely no optimal policy for this sequential stochastic control problem, this paper presents and compares six AV-traveler assignment strategies (i.e. control policies). An agent-based simulation tool is employed to model the dynamic system of AVs, travelers, and the intelligent SAMS fleet operator, as well as, to compare assignment strategies across various scenarios. The results show that optimization-based AV-traveler assignment strategies, strategies that allow en-route pickup AVs to be diverted to new traveler requests, and strategies that incorporate en-route drop-off AVs in the assignment problem, reduce fleet miles and decrease traveler wait times. The more-sophisticated AV-traveler assignment strategies significantly improve operational efficiency when fleet utilization is high (e.g. during the morning or evening peak); conversely, when fleet utilization is low, simply assigning traveler requests sequentially to the nearest idle AV is comparable to more-advanced strategies. Simulation results also indicate that the spatial distribution of traveler requests significantly impacts the empty fleet miles generated by the on-demand SAMS.     

与交通控制协同的交通流准均衡分配模型研究

本文从路网均衡最优的角度，考虑交叉口交通信号控制对交通流的阻滞延误，建立了以路网总出行时间最小为目标的交通流均衡分配方程。通过引入拥挤度的概念，提出一个准均衡分配算法，算法不苛求能在一个问隔内使混乱交通流趋于平稳，而是在一定交通需求下，根据路段的运行状况（拥挤度），加载或卸载路段交通量，并考虑驾驶员出行特性，优化交叉口最佳信号配时，使交通流在不断反馈与不断调整过程中达到最优。     

A discrete optimization approach for locating Automatic Vehicle Identification readers for the provision of roadway travel times

This paper develops an algorithm for optimally locating Automatic Vehicle Identification tag readers by maximizing the benefit that would accrue from measuring travel times on a transportation network. The problem is formulated as a quadratic 0–1 optimization problem where the objective function parameters represent benefit factors that capture the relevance of measuring travel times as reflected by the demand and travel time variability along specified trips. An optimization approach based on the Reformulation–Linearization Technique coupled with semidefinite programming concepts is designed to solve the formulated reader location problem. To illustrate the proposed methodology, we consider a transportation network that is comprised of freeway segments that might include merge, diverge, weaving, and bottleneck sections. In order to derive benefit factors for the various origin–destination pairs on this network, we employ a simulation package (INTEGRATION) in combination with a composite function, which estimates the travel time variability along a trip that is comprised of links that include any of the four identified sections. The simulation results are actually recorded as generic look-up tables that can be used for any such section for the purpose of computing the associated benefit factor coefficients. Computational results are presented using data pertaining to a freeway section in San Antonio, Texas, as well as synthetic test cases, to demonstrate the effectiveness of the proposed approach, and to study the sensitivity of the quality of the solution to variations in the number of available readers.