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

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

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

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

武汉市过长江交通流量特征分析

武汉市过长江交通是武汉市最主要的交通流向之一。根据流量观测数据分析长江交通流量特征,表明武汉市区过长江交通饱和,交通需求总量大,出行目的种类多。过长江交通没有明显、固定的高峰日和高峰小时,除通勤交通外。还有公务等大量非通勤交通。其中武昌与汉口之间交通是主流向,需要适当新增通道缓解过江难问题。     

船摇前馈控制补偿效果及优化方法研究

雷达隔离船摇的主要手段之一.针对船摇前馈在实际工程应用中补偿效果不理想的问题,通过对前馈复合控制原理、船摇前馈实现方法和效果影响因素的研究,提出了工程实现的优化方法.采用时间序列分析方法进行船摇数据预报可以提高近一个数量级的预报精度,从而直接提高船摇前馈补偿量的计算精度和补偿效果.通过在前馈补偿环节中加入自适应设计以实现船摇前馈信息有效平稳地加入控制环路.此外,选择适宜的时机加入船摇前馈也是工程应用的一个重要因素.     

基于时间序列与小波分析的船舶柴油机故障诊断

模拟柴油机气阀间隙异常的几种情况,并实时监测柴油机缸盖振动信号.采用时间序列分析方法对船舶柴油机缸盖振动信号功率谱进行识别,采用小波变换方法对各信号进行小波包分解,并提取故障特征频段信号进行功率谱估计,实现精确故障诊断.     

港口门机司机绩效考核系统设计

针对某港口企业下属门机队现行绩效考核和管理相对落后的状况提出了有效的改进策略。基于门机作业实时记录,采用Microsoft SQL2005数据库、VC＋＋6．0和水晶报表技术设计了一套司机作业绩效考核软件,实现了对现场采集数据的转换和存储,并结合作业票数据考核门机司机的作业量,自动生成每月的机械队员工工资报表,同时,港口企业通过司机绩效考核软件完成对生产数据的科学、有效的管理。     

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.