A Pareto-improving hybrid rationing and pricing policy with multiclass network equilibria

This paper extends the work on Pareto-improving hybrid rationing and pricing policy for general road networks by considering heterogeneous users with different values of time. Mathematical programming models are proposed to find a multiclass Pareto-improving pure road space rationing scheme (MPI-PR) and multiclass hybrid rationing and pricing schemes (MHPI and MHPI-S). A numerical example with a multimodal network is provided for comparing both the efficiency and equity of the three proposed policies. We discover that MHPI-S can achieve the largest reduction in total system delay, MHPI can induce the least spatial inequity and MHPI-S is a progressive policy which is appealing to policy makers. Furthermore, numerical results reveal that different classes of users react differently to the same hybrid policies and multiclass Pareto-improving hybrid schemes yield less delay reduction when compared to their single-class counterparts.     

Aggregating mobile object trajectories: cumulative time geographic density estimation for GPS data

We present new approaches that expand upon the time geographic density estimation (TGDE) framework previously employed to estimate potential path trees. In the past, TGDE metrics have identified possible locations an individual moving object may have passed between, given known origin and destination points. This paper utilizes a new form of TGDE to investigate taxicab GPS traces over a specified time horizon with position ‘gaps’. To this end, we propose a new extension to the TGDE framework, TGDE-C, which is used to determine the cumulative TGDE values for a group of GPS traces, at a given location. These metrics are applied to multiple taxis and allow for time of day analysis. Additionally, we combine these new extensions with existing TGDE metrics that allow us to determine how accessible individual or groups of vehicles are to urban opportunities.     

Formulating cargo inventory costs for liner shipping network design

This study examines how to incorporate the inventory costs of containerized cargoes into existing liner service planning models such that the designed networks could be improved while not causing extra modeling/computational burden. Two approaches are compared: (i) not considering the inventory costs at all and (ii) incorporating the inventory costs associated with onboard time and those related to transshipment by assuming a fixed connection time. The two models are compared with the ideal model capturing the exact inventory costs on a route choice problem and a capacity planning problem based on extensive randomly generated and practical numerical experiments. The results show that: first, ignoring the inventory costs in service planning models may lead to network design with much higher costs (poor network design decisions); second, in service planning models assuming weekly frequency, the inventory costs associated with onboard time could be formulated exactly, and those related to the connection time of weekly services could be approximated by assuming fixed connection time of 3.5 days for ports with 1 day’s minimum connection time and 4.5 days for ports with 2 days’ minimum connection time.     

Mathematically calculating the transit time of cargo through a liner shipping network with various trans-shipment policies

This paper derives the mathematical expressions for the transit time of cargo through a liner shipping network. Main efforts are devoted to deriving the calculation expressions of the connection time of cargo during trans-shipment. For the forward and many-to-one trans-shipment policies, we conduct a minor correction towards the expressions in existing studies to improve the completeness. Meanwhile, we propose an alternative but more straightforward calculation method for connection time which bypasses the complicated inductive argument in existing studies. Then we introduce two new trans-shipment policies: backward trans-shipment and one-to-many trans-shipment, and mathematically calculate the corresponding connection times. Numerical experiments also deliver some managerial insights into the effectiveness of backward trans-shipment in transit time control.     

动态载荷识别的自适应延迟逆模型方法

为减小载荷识别问题对原系统先验知识的依赖,采用系统的自适应延迟逆模型识别时域载荷。采用自适应算法辨识延迟逆模型,代替了一般识别方法中的系统特性矩阵求逆过程,避免了病态问题。随后将工作状态下的响应作为逆模型的输入,则其输出就是时域载荷的延迟估计。通过对两端简支梁结构进行载荷识别的仿真研究,以及对双层隔振试验台架的试验研究,识别了稳态激励和瞬态激励,验证了该方法的有效性。该方法不需要了解系统的数学模型及参数,因此能够应用于工程实践中。     

基于LSTM的舰船运动姿态短期预测

舰船的六自由度运动状态形成复杂的非线性过程,运动姿态会受到耦合作用、不定周期、噪声信号以及混沌特性等因素的干扰,因此很难得到精确的预测结果.为了提升舰船运动姿态的预测精度,利用舰船时间序列的特点,建立了基于长短期记忆单元(LSTM)模型,对其进行了舰船姿态预测仿真,将结果与时间序列分析法的结果进行对比.实例分析表明:基于LSTM模型的预测方法具有精确度高、易实现的特点.这为舰船运动短期预测提供了一个新的思路和方法.     

基于AQWA的双浮箱-双水平板浮式防波堤水动力分析

运用AQWA软件,针对双浮箱-双水平板浮式防波堤,建立不规则波作用下浮体锚链的耦合模型,研究时域情况下,改变水平板与浮箱的垂直间距,分析浮体运动响应以及锚链受力情况;并深入探讨了不同波浪周期和波高情况下水平板长度对浮体运动响应以及锚链受力的影响.结果表明,增加水平板与浮箱的垂直间距和水平板长度,可以有效减小浮体运动响应和锚链受力.波高和波浪周期是浮体重要的水动力因素,波高越大,波浪周期越长,浮体运动响应越剧烈;当浮体水平板长度达到21米左右时,整个防波堤达到最佳锚泊状态.     

城市交叉口交通流特征与短时预测模型

时间尺度大于15 min的城市交通流预测模型已无法满足交通信号实时控制和交通信息实时发布的需求,通过对广州市中心区交叉路口交通流长期观察和数据采集,分析了各种时间尺度的交通流特性,提出以路口信号周期作为时间尺度,绿灯流率作为变量的ARIMA(p,d,q)短时交通预测模型。以1个和3个信号周期的时间尺度为例,对城市交叉路口不同时间段交通流进行建模和预测。结果表明ARIMA(p,d,q)预测模型结构稳定,算法简单,时间尺度为3个信号周期的预测模型可以很好地保持交通流特征,均方根误差为0.015 9,预测精度较高。     

SIR-20地质雷达在工程中的应用及图谱解释

介绍了地质雷达探测的基本原理,并结合工程实例和模拟试验说明了地质雷达的具体应用。通过对地质雷达检测图谱的分析和归类处理,找出目标体的地质雷达图谱特征,为地质雷达在工程中的应用提供了判别依据。     

山区双车道公路驾驶员疲劳特性研究

山区双车道公路由于地形条件限制线形复杂多变,山体及路侧植被遮挡视线的现象时有发生,增加了驾驶操作的难度和强度.导致驾驶操作频繁、精神紧张.长时间高强度、大负荷的驾驶操作极易产生驾驶疲劳,进而发生交通事故.因此,研究山区双车道公路驾驶员的驾驶疲劳特性,可为山区公路的交通安全设计和管理提供参考,预防交通事故,保证人车安全.