基于改进 BiLSTM 网络的地铁车轮磨耗预测模型

针对地铁车轮磨耗数据时间跨度较长引起的长期依赖问题,为了进一步提升预测精度,提出一种将麻雀搜索算法(sparrow search algorithm,SSA)优化双向长短期记忆网络(bidirectional long short term memory,BiLSTM)的改进 BiLSTM(SSA-BiLSTM)网络模型,用于地铁车轮磨耗预测。首先,利用麻雀搜索算法对双向长短期记忆网络算法的神经元个数、迭代次数、输入批量和学习率等超参数在给定范围内进行寻优,得到参数最优值;然后,以参数最优值来构建改进 BiLSTM 网络模型,对车轮磨耗进行预测分析;最后,以车轮踏面磨耗和轮缘磨耗作为研究对象,将某地铁 1 车厢 1 号车轮的现场实测历史磨耗数据作为输入,对该模型进行训练及验证分析,并与多层感知机(multilayer perceptron,MLP)、LSTM、BiLSTM 以及 SSA-LSTM 模型的预测结果进行对比。研究结果表明：SSA-Bi-LSTM 模型的车轮磨耗预测精度更高,与 LSTM、BiLSTM 以及 SSA-LSTM 网络模型相比,踏面磨耗的平均绝对百分误差(mean absolute percentage error,MAPE)分别降低了 13.28%、10.32%、1.47%,轮缘磨耗分别降低了 9.5%、0.46%、0.02%;分别对同一地铁 2 号、4 号车厢的 1 号位置车轮磨耗进行预测,并与磨耗实测数据进行对比,踏面磨耗的平均绝对百分比误差分别为 1.34%、1.42%,轮缘磨耗的平均绝对百分比误差分别为 0.18%、0.19%,验证了本文所提模型具有良好的泛化性,为地铁轮对智能化管理提供理论支持,延长车轮使用寿命。     

舰载红外搜索警戒系统对反舰导弹的捕捉概率

舰载红外警戒设备与舰载搜索雷达协同工作时能弥补雷达探测性能的不足,对来袭的掠海导弹和低空飞机可给出充分的报警,增强舰艇的低空防御能力.通过对舰载红外搜索警戒系统分析,提出了实际计算探测概率的具体方法和步骤,此方法可用来定量评价舰艇防空反导系统的效能.     

基于红外搜索系统的被动测距技术研究

红外搜索系统是一种被动探测系统，量测数据中无目标的距离量；而评判来袭目标的威胁程度离不开其距离量。介绍了基于红外搜索系统的被动测距技术测量目标距离的算法、原理框图以及仿真试验与结果。     

舰载直升机应召搜索时使用特种浮标问题研究

在使用声纳浮标搜索时,水声环境对搜索效能影响很大,通过布设特种浮标可以测得当面海区水声环境,确定浮标工作深度和作用距离。分析了舰载直升机布设特种浮标的方法和布设模型,针对布设时存在的问题提出了改进对策,为舰载直升机应召搜索时使用特种浮标提供参考。     

航班快速恢复建模与仿真研究

随着民用航空的发展与竞争,航班延误不仅影响航空飞行的安全与正常,更与航空公司的运营效率、运营成本及乘客利益息息相关。针对某一恶劣天气影响,对某公司受影响航班进行重新调配,考虑到航班的备降、盘旋等待、延误、取消等多种状态,以总成本最小为目标函数,建立航班快速恢复模型,通过MATLAB运用遗传算法设计航班恢复算法进行求解,得出最经济的航班恢复方案。     

Free-floating bike sharing: Solving real-life large-scale static rebalancing problems

Free-floating bike sharing (FFBS) is an innovative bike sharing model. FFBS saves on start-up cost, in comparison to station-based bike sharing (SBBS), by avoiding construction of expensive docking stations and kiosk machines. FFBS prevents bike theft and offers significant opportunities for smart management by tracking bikes in real-time with built-in GPS. However, like SBBS, the success of FFBS depends on the efficiency of its rebalancing operations to serve the maximal demand as possible.Bicycle rebalancing refers to the reestablishment of the number of bikes at sites to desired quantities by using a fleet of vehicles transporting the bicycles. Static rebalancing for SBBS is a challenging combinatorial optimization problem. FFBS takes it a step further, with an increase in the scale of the problem. This article is the first effort in a series of studies of FFBS planning and management, tackling static rebalancing with single and multiple vehicles. We present a Novel Mixed Integer Linear Program for solving the Static Complete Rebalancing Problem. The proposed formulation, can not only handle single as well as multiple vehicles, but also allows for multiple visits to a node by the same vehicle. We present a hybrid nested large neighborhood search with variable neighborhood descent algorithm, which is both effective and efficient in solving static complete rebalancing problems for large-scale bike sharing programs.Computational experiments were carried out on the 1 Commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP) instances used previously in the literature and on three new sets of instances, two (one real-life and one general) based on Share-A-Bull Bikes (SABB) FFBS program recently launched at the Tampa campus of University of South Florida and the other based on Divvy SBBS in Chicago. Computational experiments on the 1-PDTSP instances demonstrate that the proposed algorithm outperforms a tabu search algorithm and is highly competitive with exact algorithms previously reported in the literature for solving static rebalancing problems in SBSS. Computational experiments on the SABB and Divvy instances, demonstrate that the proposed algorithm is able to deal with the increase in scale of the static rebalancing problem pertaining to both FFBS and SBBS, while deriving high-quality solutions in a reasonable amount of CPU time.     

论地理信息系统在海上搜救中的应用与展望

地理信息系统（GIS）技术是近些年迅速发展起来的一门空间信息分析技术,它既是描述、存储、分析和输出空间信息的理论和方法的一门新兴的交叉学科,又是以地理空间数据库为基础的一个技术系统。结合GIS的概念、功能及其发展特点,研究其在海上运输领域中,在提高搜救效率、安全管理等技术方面的开发与应用．对于进一步推进GIS与交通运输业的结合,及有效推动船舶运输的发展具有重要意义。     

立交线形动态拖动设计的关键技术

对立交线形动态拖动设计的几个关键技术进行论述.分析了缓和曲线计算精度,提出了动态拖动模式设计模型,以及约束满足条件下的非线性方程组的数值解算法.     

Frank-Wolfe�㷨��⽻ͨ��������: �Ƚϲ�ͬ�������²��Ժ�����������

Frank-Wolfe(FW)算法是一类广泛应用于求解交通分配问题的算法。它具有容易编程实现,所需内存少的特点。但是该算法收敛速度较慢,不能得到路径信息。为了提高算法的效率,本文研究三种流量更新策略(all-at-once, one-origin-at-a-time, one-OD-at-a-time)以及不同的步长搜索策略下的FW算法,其中步长搜索策略包括精确线性搜索方法(包括二分法、黄金分割法、成功失败法)和不精确的线性搜索方法(包括基于Wolfe-Powell收敛准则的搜索方法和Gao等提出的非单调线性搜索方法)。最后,本文将上述策略应用于四种不同规模的交通网络中,并给出较适合求解的组合。     

斜腿刚构桥几何布局的优化设计

采用数学规划的方法从静力和动力两方面对斜腿刚构桥的几何布局进行优化设计。静力优化设计的优化目标是截面截面应力平方均值最小，动力优化设计的优化目标是结构自振周期平方和最小。采用了直接搜索法寻优。通过算例可知，这两种优化设计方法均可行，且均为刚性设计。