一种基于卫星导航的列车初始定位方法研究

在西北环境恶劣地区,线路区间往往较少设置实体应答器,列车在区间重启时需要长距离低速运行.经过实体应答器后才能确定列车位置。针对该问题.本文提出一种基于卫星导航系统和车载电子地图的列车初始定位方法。该方法利用轨道约束算法和概率学方法,设计满足铁路安全标准要求的列车初始定位方法。     

基于深度强化学习的智能船舶航迹跟踪控制

[目的]智能船舶的航迹跟踪控制问题往往面临着控制环境复杂、控制器稳定性不高以及大量的算法计算等问题。为实现对航迹跟踪的精准控制,提出一种引入深度强化学习技术的航向控制器。[方法]首先,结合视线(LOS)算法制导,以船舶的操纵特性和控制要求为基础,将航迹跟踪问题建模成马尔可夫决策过程,设计其状态空间、动作空间、奖励函数;然后,使用深度确定性策略梯度(DDPG)算法作为控制器的实现,采用离线学习方法对控制器进行训练;最后,将训练完成的控制器与BP-PID控制器进行对比研究,分析控制效果。[结果]仿真结果表明,设计的深度强化学习控制器可以从训练学习过程中快速收敛达到控制要求,训练后的网络与BP-PID控制器相比跟踪迅速,具有偏航误差小、舵角变化频率小等优点。[结论]研究成果可为智能船舶航迹跟踪控制提供参考。     

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

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

Privacy-preserving MaaS fleet management

On-demand traffic fleet optimization requires operating Mobility as a Service (MaaS) companies such as Uber, Lyft to locally match the offer of available vehicles with their expected number of requests referred to as demand (as well as to take into account other constraints such as driver’s schedules and preferences). In the present article, we show that this problem can be encoded into a Constrained Integer Quadratic Program (CIQP) with block independent constraints that can then be relaxed in the form of a convex optimization program. We leverage this particular structure to yield a scalable distributed optimization algorithm corresponding to computing a gradient ascent in a dual space. This new framework does not require the drivers to share their availabilities with the operating company (as opposed to standard practice in today’s mobility as a service companies). The resulting parallel algorithm can run on a distributed smartphone based platform.     

LNG码头应急通道与应急锚地研究

本文针对LNG应急逃离情况以及国内LNG应急锚地使用现状,总结分析国内、外LNG应急锚地布置情况;结合江苏滨海LNG码头通航条件,提出LNG应急通道及应急锚地三种布置方案,通过操船模拟试验论证比选并得出结论,供类似工程参考。     

Strain prediction for critical positions of FPSO under different loading of stored oil using GAIFOA-BP neural network

FPSO (floating, production, storage and offloading) units are widely used in the offshore oil and gas industry. Generally, FPSOs have excellent oil storage capacity owing to their huge oil cargo holds. The volume and distribution of stored oil in the cargo holds influence the strain level of hull girder, especially at critical positions of FPSO. However, strain prediction using structural analysis tools is computationally expensive and time consuming. In this study, a prediction tool based on back-propagation (BP) neural network called GAIFOA-BP is proposed to predict the strain values of concerned positions of an FPSO model under different oil storage conditions. The GAIFOA-BP combines BP model and GAIFOA which is a combination of genetic algorithm (GA) and an improved fruit fly optimization algorithm (IFOA). Results from three benchmark tests show that the GAIFOA-BP model has a remarkable performance. Subsequently, a total of 81 sets of training data and 25 sets of testing data are obtained from experiment using fiber Bragg grating (FBG) sensors installed on the surface of an FPSO model. The numerical results show that the GAIFOA-BP is capable of predicting the strain values with higher accuracy as compared with other BP models. Finally, the reserved GAIFOA-BP model is utilized to predict the strain values under the inputs of a 10-day time series of volume and distribution of stored oil. The predicted strain results are further used to calculate the fatigue consumption of measurement points.     

横梁端部节点优化

通过有限元计算,对比几种常见的横梁端部连接方式,综合考虑结构整体强度、钢材使用量、舱室空间利用率、施工便利性等方面的影响因素,确定较优的连接过渡方式和过渡结构的参数尺寸,为船舶设计横梁端部节点形式的确定提供参考。     

智能网联车环境下高速匝道汇入车流轨迹优化模型

为了解决传统匝道控制车流汇入时车辆需要减速至停止，从而造成延误时间过长的问题，提出了一种智能网联车环境下的高速匝道汇入车辆轨迹优化的两阶段优化模型，其中，第1 阶段优化车辆进入匝道口的时序；第2 阶段基于第1 阶段的最优时序，优化车辆轨迹. 根据所构建的模型设计了一种启发式算法优化车辆通过匝道冲突区域的时序，然后结合 GPOPS工具优化车辆的轨迹.为了验证所提出方法的有效性，将所提出的方法应用到20 min 随机到达的车流，进行仿真实验.实验结果表明，与先进先出的方法相比，本文所提出的方法能够使总延误减少59.7%，总油耗减少10.5%，说明该方法能够实现车辆以较高的速度通过匝道冲突区域，有效地减少了车辆汇入延误，同时也节约了油耗.     

A real-time adaptive signal control in a connected vehicle environment

The state of the practice traffic signal control strategies mainly rely on infrastructure based vehicle detector data as the input for the control logic. The infrastructure based detectors are generally point detectors which cannot directly provide measurement of vehicle location and speed. With the advances in wireless communication technology, vehicles are able to communicate with each other and with the infrastructure in the emerging connected vehicle system. Data collected from connected vehicles provides a much more complete picture of the traffic states near an intersection and can be utilized for signal control. This paper presents a real-time adaptive signal phase allocation algorithm using connected vehicle data. The proposed algorithm optimizes the phase sequence and duration by solving a two-level optimization problem. Two objective functions are considered: minimization of total vehicle delay and minimization of queue length. Due to the low penetration rate of the connected vehicles, an algorithm that estimates the states of unequipped vehicle based on connected vehicle data is developed to construct a complete arrival table for the phase allocation algorithm. A real-world intersection is modeled in VISSIM to validate the algorithms. Results with a variety of connected vehicle market penetration rates and demand levels are compared to well-tuned fully actuated control. In general, the proposed control algorithm outperforms actuated control by reducing total delay by as much as 16.33% in a high penetration rate case and similar delay in a low penetration rate case. Different objective functions result in different behaviors of signal timing. The minimization of total vehicle delay usually generates lower total vehicle delay, while minimization of queue length serves all phases in a more balanced way.     

Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem

In this paper, we study two closely related airline planning problems: the robust weekly aircraft maintenance routing problem (RWAMRP) and the tail assignment problem (TAP). In real life operations, the RWAMRP solution is used in tactical planning whereas the TAP solution is implemented in operational planning. The main objective of these two problems is to minimize the total expected propagated delay (EPD) of the aircraft routes. To formulate the RWAMRP, we propose a novel weekly line-of-flights (LOF) network model that can handle complex and nonlinear cost functions of EPD. Because the number of LOFs grows exponentially with the number of flights to be scheduled, we propose a two-stage column generation approach to efficiently solve large-scale real-life RWAMRPs. Because the EPD of an LOF is highly nonlinear and can be very time-consuming to accurately compute, we propose three lower bounds on the EPD to solve the pricing subproblem of the column generation. Our approach is tested on eight real-life test instances. The computational results show that the proposed approach provides very tight LP relaxation (within 0.6% of optimal solutions) and solves the test case with more than 6000 flights per week in less than three hours. We also investigate the solutions obtained by our approach over 500 simulated realizations. The simulation results demonstrate that, in all eight test instances, our solutions result in less EPDs than those obtained from traditional methods. We then extend our model and solution approach to solve realistically simulated TAP instances.