考虑异质性出行需求的主支线公交树网络优化设计

公交线网优化设计是指在一定的运行约束条件下,选择1组公交线路和相关频率以达到优化目标的设计过程,可以表示为一个优化问题。针对具有高异质性出行需求的主支线公交树网络,在考虑客流需求和运营约束的前提下,以用户和运营者的成本最小为目标,提出了1种多目标非线性混合整数优化模型。优化变量为候选线路服务频率。为求解这一模型,设计了1种基于改进的布谷鸟算法的高效元启发式方法。该方法包括初始候选路线集生成过程;基于MNL模型的公交分配过程;确定路线服务频率的改进布谷鸟算法过程。通过算例验证了该方法的有效性和适用性。数值分析结果表明,该算法通过对所有可能的候选路径的服务频率选择得到接近最优的公交线路网络。另一方面,通过保持高峰时的公交线路为有效备择线路,为具有异质性出行需求的网络的重新设计提供了更好的解决方案。此外,该系统在1次运行中产生了1组帕累托解,其允许公交线网设计师评估运营商成本和乘客成本并做出折中方案。通过比较3种算法的计算结果和CPU时间,证明了改进的布谷鸟算法的可靠性和有效性。另外还研究了最优公交网络设计与公交运行速度、总需求规模等关键设计输入参数之间的关系,分析结果表明,关键设计输入参数与最优公交网络具有一定的协同效应。模型与算法为实际的大规模主支线公交树网络的优化设计提供了1种有效的工具。     

Disaggregate Path Flow Estimation in an Iterated Dynamic Traffic Assignment Microsimulation

This article describes the first application of a novel path flow and origin/destination (OD) matrix estimator for iterated dynamic traffic assignment (DTA) microsimulations. The presented approach, which operates on a trip-based demand representation, is derived from an agent-based DTA calibration methodology that relies on an activity-based demand model (Flötteröd, Bierlaire, & Nagel, 2011). The objective of this work is to demonstrate the transferability of the agent-based approach to the more widely used OD matrix-based demand representation. The calibration (i) operates at the same disaggregate level as the microsimulation and (ii) has drastic computational advantages over conventional OD matrix estimators in that the demand adjustments are conducted within the iterative loop of the DTA microsimulation, which results in a running time of the calibration that is in the same order of magnitude as a plain simulation. We describe an application of this methodology to the trip-based DRACULA microsimulation and present an illustrative example that clarifies its capabilities.     

Reliability-based network flow estimation with day-to-day variation: A model validation on real large-scale urban networks

Day-to-day variation in the travel times of congested urban transportation networks is a frustrating phenomenon to the users of these networks. These users look pessimistically at the path travel times, and learn to spend additional time to safeguard against serious penalties that await late arrivals at the destinations. These additional expenses are charges similar to the tolls in system equilibrium flow problem, but may not be collected. With this conjecture, the user equilibrium (UE) formulation of congested network flow problem would lack some necessary factors in addressing appropriate path choices. This study, following a previous work proposing pessimistic UE (PUE) flow, aims to show how to measure this additional travel cost for a link, and investigates how different is PUE from UE, and when such differences are pronounced. Data are collected from the peak-hour travel times for the links of paths in the city of Tehran, to estimate the variance of travel times for typical links. Deterministic functions are obtained by calibrating the standard deviation of the daily variations of link travel times, and probabilistic functions by the technique of copula. UE and PUE traffic assignment models are built and applied to three large cities of Mashhad, Shiraz, and Tehran in Iran. The results show that the estimated flows by PUE model replicate the observed flows in screen lines much better than the UE model, particularly for longer trips. Since PUE is computationally equivalent to UE, this improvement is attained virtually at no cost.     

基于最短路径搜索的动态随机交通分配

提出了一个基于Logit方法的动态交通随机分配模型,该模型通过最短路算法和随机分配来解决动态均衡交通分配中的出行选择问题,避免了以往动态交通均衡分配中解凸规划或非线性规划问题,同时不需要路径枚举,从而使本模型更适合于大型路网的动态交通分配．随后的算例证实了该模型的可行性。     

Lane assignment problem using a genetic algorithm in the Automated Highway Systems

This paper deals with the lane assignment problem in the Automated Highway Systems (AHS). The purpose of lane assignment strategies is to increase throughput on multi-lane highways with many entry and exit points, based on the itineraries of vehicles using the highway (point of entry, time of entry and exit point) and the effects of maneuvers. Using partitioned lane assignment strategies, the lane assignment problem is formulated as an optimization problem to find the proper positions of partitions. Then the optimal problem is solved using a Genetic Algorithm (GA). The proposed algorithm has been validated by comparing its solution with that of an all-cases algorithm for a simple case. Moreover, a traffic simulator with a realistic car-following model as well as lane change logic has been developed. The simulation results show the efficiency of the proposed genetic algorithm, compared with random assignment algorithms.     

工匠精神引领,校企协同共育“汽车医生”的实践研究

习近平总书记指出:努力培养数以亿计的高素质劳动者和技术技能人才,是推进我国由制造大国向制造强国转变、由中国制造向中国创造转变的必然要求。基于这个出发点,以我校五年制高职汽车检测与维修技术专业与海鹏集团合作开展的现代学徒制"海鹏班"为基础,以工匠精神为引领,将职业素养培养融入到建业建设与课程改革中将人才培养与课程建设中。以提升学生技术技能水平为目的,强化精益求精的"汽车医生"的工匠精神养成,将学生培养成精益求精、严谨,一丝不苟、耐心,专注,坚持、专业,敬业的时代新人。     

Robust traffic assignment model: Formulation,solution algorithms and empirical application

ABSTRACT

The deterministic traffic assignment problem based on Wardrop's first criterion of traffic network utilization has been widely studied in the literature. However, the assumption of deterministic travel times in these models is restrictive, given the large degree of uncertainty prevalent in urban transportation networks. In this context, this paper proposes a robust traffic assignment model that generalizes Wardrop's principle of traffic network equilibrium to networks with stochastic and correlated link travel times and incorporates the aversion of commuters to unreliable routes.

The user response to travel time uncertainty is modeled using the robust cost (RC) measure (defined as a weighted combination of the mean and standard deviation of path travel time) and the corresponding robust user equilibrium (UE) conditions are defined. The robust traffic assignment problem (RTAP) is subsequently formulated as a Variational Inequality problem. To solve the RTAP, a Gradient Projection algorithm is proposed, which involves solving a series of minimum RC path sub-problems that are theoretically and practically harder than deterministic shortest path problems. In addition, an origin-based heuristic is proposed to enhance computational performance on large networks. Numerical experiments examine the computational performance and convergence characteristics of the exact algorithm and establish the accuracy and efficiency of the origin-based heuristic on various real-world networks. Finally, the proposed RTA model is applied to the Chennai road network using empirical data, and its benefits as a normative benchmark are quantified through comparisons against the standard UE and System Optimum (SO) models.     

基于拉格朗日松弛算法的自动驾驶公交调度优化研究

为了解决公交实际运营出现的调度方式单一、车辆配合度较差、串车等问题，降低公交运行中人为因素的影响，提高公交系统的运营效率，提出一种考虑乘客动态需求的调度模型，采用自动驾驶环境下的公交运营方式，结合站点实际乘客需求调配车辆，实现了公交车辆利用程度最大和乘客总体等待时间最小的多目标优化。提出的自动驾驶公交调度方法，获取了乘客个体的实时出行需求，同时实现了对车头时距的调控。在模型求解方面，选取拉格朗日松弛算法，最终获得了多目标优化问题的精确解。以北京公交300路快车作为实际案例进行分析，从公交实际运营数据中提取多项参数作为模型的输入，通过拉格朗日松弛算法的求解，得到自动驾驶条件下公交运行时刻表、乘客等待时间、公交承载量、站点上车乘客人数等多项运营指标。通过与公交实际运营状态的对比，论证了采用自动驾驶公交对于改善公交运营现状的可行性。最后将优化结果与公交实际数据进行了对比分析。结果表明：自动驾驶车辆投入公交运营，能够缓解串车问题，同一线路上公交车的载客量分布更为均衡，在同一断面的客流与车头时距的不均衡程度均有所降低；同时高峰时段发车数量减少了20%，公交车的平均承载量提高了21.7%，车辆平均间隔缩短了29.9%。     

长距离顶管平面控制测量关键技术

为解决现有顶管平面测量方法对于顶管机在长距离掘进中的不适用问题,以与顶管机掘进距离成正比的精度需求为切入点,按照不同距离精度需求寻找适当的平面控制测量方法,并把各类顶管平面控制测量技术与单站轨迹式定向长距离顶管导向系统有机结合,在满足精度需求的同时提高工作效率、降低工作强度.采用该方法实现了苏州城区第二水源——阳澄湖引水工程的2条2.67 km顶管隧道的顺利贯通.     

交通管制条件下城市道路网络模型及分配算法研究

城市道路网络模型及其算法是城市道路网络分析和分配的基础。本文首先分析了交通管制条件下原有城市道路网络模型和算法的不足,在此基础上提出一种改进模型和算法,并给出算例。这种改进的模型和算法能较好地满足实际分配的要求,在交通规划、交通管理和交通流模拟中都有着十分广阔的应用前景,且已经被成功地应用于郑州市综合交通规划中。     

不同交通供需分布下的路网畅通可靠度变化规律研究

畅通可靠度是在研究交通供需之间关系的基础上提出的概率型指标。根据畅通可靠度的计算方法,将各小区交通需求和各路段通行能力视为符合正态分布的变量,通过组合不同交通供需分布方式,对所需要研究的路网采用多次随机试验的方法得到各道路单元、路径及系统的畅通可靠度,并研究不同交通供需分布方式对路网车速和畅通可靠度的影响,寻找在不同交通供需下道路畅通可靠度的变化规律。分析表明:道路单元、路径、OD对间及路网的畅通可靠度变化规律是一致的,并且畅通标准越高,路网的畅通可靠度就越低;在同一畅通标准及相同的需求变化范围下,需求越低,相应的畅通可靠度会越高;同时,随着畅通标准的提高,道路通行能力和交通需求方差越大,道路畅通可靠度也越大。     

基于免疫克隆算法的多枢纽选址与混合网络设计综合优化研究

为了描述多枢纽选址与混合网络设计综合优化问题,引入了双层规划模型建立数学模型.上层模型为多目标规划模型,以最小化网络总阻抗和最小化总投资为目标;下层模型为固定需求的用户平衡配流模型.然后,给出了基于免疫克隆算法的具体求解设计和步骤.接着,给出了算例,在不同决策权重条件下进行求解.算例结果验证了算法的可行性和模型的有效性,同时结果表明在建设枢纽后,当决策偏重于交通网络管理部门时,更倾向于建设新路段以降低网络费用和总费用.     

求解交通配流问题的一种新算法

路径选择是交通配流的主要问题,本文采用遗传算法设计了一个新模型以求解交通配流问题。实例计算表明,这一算法能迅速求出问题的全局最优解。     

基于随机过程的服务区停车位数计算方法

基于交通流理论,以随机过程分析为手段,从车辆和道路使用者对各种服务的需求周期性出发,讨论了不同类型服务高峰小时的成因,从机制上解释了服务区高峰小时停留率的形成模式,得出了服务区停车位数与服务区路网布局之间的定量关系,提供了实际路网的服务区停车位数计算方法,并通过算例与日本规范的计算方法进行比较。结果表明:提出的计算方法体现了服务设施间距等因素对服务区停车位数的影响,对服务区高峰小时停留率以及停车位规模计算方法进行了改进;计算结果与日本规范中的计算结果一致。     

燃料电池城市客车动力驱动系统的功率匹配

燃料电池城市客车（FCBUS）驱动系统参数的选择主要考虑整车动力性要求,同时要兼顾其效率和整车经济性。通过整车动力性指标对应的车辆功率需求分析和对典型循环工况对应的车辆功率谱分析,给出了驱动电机峰值功率、额定功率、额定转矩和额定转速的设计步骤和方法,并通过了试验验证。     

公路养护管理系统中数据安全和保护措施

从实际工作的需要出发,以当前中国公路行业的管理体系结构为模型,从架构设计到功能实现全面地介绍了一种数据安全和保护措施--断电保护技术.     

基于扩展状态观测器和滑模控制的双离合器自动变速器起步自适应控制

双离合器自动变速器（Dual Clutch Transmission,DCT）随着服役时间的增加离合器性态会发生变化导致起步性能下降,为降低离合器性态变化对起步性能的影响,提出一种基于扩展状态观测器和滑模控制的DCT起步自适应控制方法。首先,建立DCT起步动力学模型、发动机模型和液压控制系统模型;将DCT起步问题转化为参考轨迹跟踪问题,通过工况识别并利用极小值原理获得了不同起步工况的参考轨迹;在DCT起步动力学模型中将与离合器性态变化相关的项定义为不确定项,设计扩展状态观测器对不确定项进行估计,同时结合自适应滑模控制器,获得了起步发动机转矩和离合器油压的自适应控制率;为了跟踪发动机转矩和离合器油压的自适应控制率,设计了发动机转矩跟踪控制器,同时对液压系统采用了PID闭环控制;通过MATLAB/Simulink平台仿真以及台架试验验证所提出的DCT起步控制方法对离合器性态变化的自适应效果。研究结果表明：所提出的起步自适应控制方法能够有效避免由离合器性态变化导致的起步延时,同时1挡缓起步和急起步的仿真冲击分别减小了53.11%和43.42%,试验起步冲击分别减小了35.66%和30.31%。     

Development of a new time domain-based algorithm for train detection and axle counting

This paper presents an innovative train detection algorithm, able to perform the train localisation and, at the same time, to estimate its speed, the crossing times on a fixed point of the track and the axle number. The proposed solution uses the same approach to evaluate all these quantities, starting from the knowledge of generic track inputs directly measured on the track (for example, the vertical forces on the sleepers, the rail deformation and the rail stress). More particularly, all the inputs are processed through cross-correlation operations to extract the required information in terms of speed, crossing time instants and axle counter. This approach has the advantage to be simple and less invasive than the standard ones (it requires less equipment) and represents a more reliable and robust solution against numerical noise because it exploits the whole shape of the input signal and not only the peak values. A suitable and accurate multibody model of railway vehicle and flexible track has also been developed by the authors to test the algorithm when experimental data are not available and in general, under any operating conditions (fundamental to verify the algorithm accuracy and robustness). The railway vehicle chosen as benchmark is the Manchester Wagon, modelled in the Adams VI-Rail environment. The physical model of the flexible track has been implemented in the Matlab and Comsol Multiphysics environments. A simulation campaign has been performed to verify the performance and the robustness of the proposed algorithm, and the results are quite promising. The research has been carried out in cooperation with Ansaldo STS and ECM Spa.     

贵阳至黄平高速公路走廊方案研究

公路走廊的选定基本确定项目路线走向、工程规模与投资等,从而影响项目乃至沿线的经济和社会效益。文中结合工作实际,对影响走廊选取密切相关的各因素,采取权重分析,通过定量、定性分析后选定推荐方案。该方式避免了以往走廊研究比选中仅定性难以量化的问题。     

考虑拥堵空间排队与溢出的道路网静态交通流分配

为刻画拥堵空间排队与溢出现象对交通流分配的影响，提出考虑拥堵空间排队与溢出的道路网静态交通流分配问题，并构建相关的求解算法，用于描述交通需求在起讫点移动过程中路网整体的宏观运行状态。首先，丰富和完善考虑拥堵空间排队与溢出的静态交通流分配的相关假设，提出次生瓶颈、拥堵干扰与渗透和分段化路段阻抗等基本概念和理论，来刻画拥堵交通瓶颈、拥堵空间排队等交通现象；其次，建立网络瓶颈识别算法和空间排队回溯算法，基于此构建考虑拥堵空间排队和溢出的增量分配算法，用于求解交通流分配的结果；最后，通过使用一个具有说明型的算例进行对比分析。研究结果表明：建立的瓶颈识别、排队回溯和增量分配算法可以识别路网中的瓶颈位置及其拥堵排队区域，并可计算得到各路段上的分段分配流量；与点排队只影响瓶颈路段的运行状况和均一的路段分配结果相比，可有效描述路网整体的宏观运行状态以及由于拥堵空间排队所导致的拥堵干扰与渗透现象；不同于“时间片”的伪动态交通流分配模型，新建算法的分配结果是“全时段”与“整体性”的路网宏观运行状态，包含了拥堵瓶颈的具体位置和空间排队的干扰与渗透情况；一般拥堵点排队模型和基于“时间片”的拥堵空间排队模型难以刻画拥堵干扰与渗透现象以及路网整体的宏观运行状态，故所建立的分配方法是对传统拥堵交通流分配的丰富和发展。