基于BP网络的球鼻首参数化优化

本文以某集装箱船为研究对象,对降速航行后的球鼻首进行优化。采用Catia建立船体三维模型,为了产生不同形状的球鼻首,选取球鼻特征参数来描述其基本结构;采用拉丁超立方试验抽样方法得到12组不同形状的球鼻首,提出运用非线性拟合能力较强的BP网络构建球鼻首参数和阻力系数之间的关系模型;采用遗传算法对训练后的网络进行极值寻优。结果显示,优化船型的阻力系数显著降低,说明该方法对球鼻首的优化有一定的借鉴意义。     

USV发展现状及展望

  目的  无人艇（USV）在复杂环境情况下会出现偏离目标航线的情况,为提高水面无人艇的抗干扰能力及实际航行的稳定性,实现对航迹的准确控制,提出一种改进的无人艇航迹控制方法。  方法  根据导航信号受环境影响的情况,对GPS信号有效和无效2种情况下的航迹控制分别进行分析,在自主可控平台上设计并实现了基于模糊控制可变船长比的视线导引算法（LOS）和自抗扰航向控制器(ADRC)相结合的航迹控制方法,并开展了双桨双舵无人艇湖上试验。  结果  仿真结果表明：该方法可满足航迹控制的要求,转弯后航向能够快速保持稳定,无频繁摆舵现象,且该方法能够完成真实环境下的航迹控制,航迹贴线误差均值约为0.1 m,方差约为0.03。  结论  湖上试验结果验证了该算法在实际工程应用中的可行性和有效性。     

点云技术在散货专业煤码头三维可视化中的应用

为了实现安全、可靠、真实的三维煤码头监控,通过GENESIS64软件平台导入3D建模,实现三维场景的展示。3D煤堆由先进的激光点云技术,产生海量测量点,使用点云灰度算法处理,再通过C#点云生成灰度图,在GENESIS64中生成真实的立体堆场画面。     

云南省民航客运发展预测

民航运输是云南省在进行综合交通运输建设的重点之一,也是该省在未来十四五(2021-2025年)和十五五(2026-2030年)规划期间的研究热点。本文以云南省为研究范围,以省内民航客运为研究对象,选取省内主要的社会经济因素为影响因子,运用主成分分析法(PCA)、反向传播神经网络算法(BP神经网络算法)和回归分析法,构建了省内民航客运的预测模型,得出省内各主要机场在十四五末和十五五末的预计旅客吞吐量,对省政府在进行机场改扩建上有一定的指导意义。     

Locating emergency vehicles with an approximate queuing model and a meta-heuristic solution approach

In this paper, the location of emergency service (ES) vehicles is studied on fully connected networks. Queuing theory is utilized to obtain the performance metrics of the system. An approximate queuing model the (AQM) is proposed. For the AQM, different service rate formulations are constructed. These formulations are tested with a simulation study for different approximation levels. A mathematical model is proposed to minimize the mean response time of ES systems based on AQM. In the model, multiple vehicles are allowed at a single location. The objective function of the model has no closed form expression. A genetic algorithm is constructed to solve the model. With the help of the genetic algorithm, the effect of assigning multiple vehicles on the mean response time is reported.     

Modification of the Highway Capacity Manual two‐lane highway analysis procedure for Spanish conditions

The US Highway Capacity Manual (HCM) methodology is used in Spain to evaluate traffic operation and quality of service. The effect of passing manoeuvre on two‐lane highway operational performance is considered through adjustment factors to average travel speeds and percent time spent following. The procedure is largely based on simulations in TWOPAS and passing behaviours observed during US calibrations in the 1970s. It is not clear whether US driving behaviour and vehicles' performance are comparable with Spanish conditions. The objective of this research is to adapt the HCM 2010 methodology to Spanish driver behaviour, for base conditions (i.e. no passing restrictions). To do so, TWOPAS was calibrated and validated based on current Spanish passing field data. The calibration used a genetic algorithm. The case study included an ideal two‐lane highway with varying directional traffic flow rate, directional split and percentage of trucks. The updated methodology for base conditions is simpler than the current HCM 2010 and does not rely on interpolation from tables. Copyright © 2016 John Wiley & Sons, Ltd.     

高速公路场景下的电子稳像技术研究

为了去除高速公路监控视频中自身位置不稳定的事物给全局运动矢量估计带来误差,先通过Canny算子检测图像中的直线,并根据车道边界的特征筛选出道路边界,确定道路区域。再检测道路区域内的Harris角点信息,并与背景图中道路区域内的角点位置进行匹配,从而得到全局运动矢量,并计算出稳定的图像。实验表明,该算法能够满足高速公路场景下的稳像需求。     

Prioritizing road extension projects with interdependent benefits under time constraint

Since transportation projects are costly and resources are limited, prioritizing or sequencing the projects is imperative. This study was inspired by a client who asked: “I have tens of approved road extension projects, but my financial resources are limited. I cannot construct all the projects simultaneously, so can you help me prioritize my projects?” To address this question, the benefits and costs of all the possible scenarios must be known. However, the impacts (or benefit) of road extension projects are highly interdependent, and in sizable cases cannot be specified thoroughly. We demonstrate that the problem is analogous to the Traveling Salesman Problem (TSP). Dynamic change in travel demand during construction is another aspect of the complexity of the problem. The literature is yet to provide efficient methods for large cases. To this end, we developed a heuristic methodology in which the variation of travel demand during the construction period is considered. We introduce a geometrical objective function for which a solution-finding policy based on “gradient maximization” is developed. To address the projects’ interdependency, a special neural network (NN) model was devised. We developed a search engine hybridized of Ant Colony and Genetic Algorithm to seek a solution to the TSP-like problem on the NN based on gradient maximization. The algorithm was calibrated and applied to real data from the city of Winnipeg, Canada, as well as two cases based on Sioux-Falls. The results were reliable and identification of the optimum solution was achievable within acceptable computational time.     

Trip generation and distribution: the inconsistency problem and a possible remedy

There are many shortcomings commonly associated with the conventional urban transportation modeling process. This paper focuses on one of the more important problems — the inconsistency between trip generation and distribution components — and suggests a possible way of alleviating it. The suggested approach involves sorting out the independent effects on tripmaking of origin, destination and travel cost characteristics, and introducing accessibility measures explicitly into the modeling process. The resulting modeling framework can be used to obtain consistent estimates of trip generation and distribution quantities which are responsive to changes in the transportation and spatial systems.     

Direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem

This paper proposes simple and direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem. It is only necessary to account for random variables independent of link flows by performing a simple transformation of the perceived link travel time with a normal distribution. At every iteration of a Monte-Carlo simulation procedure, the values of the random variables are sampled based on their probability distributions, and then a regular deterministic user equilibrium assignment is carried out to produce link flows. The link flows produced at each iteration of the Monte-Carlo simulation are averaged to yield the final flow pattern. Two test networks demonstrate that the proposed algorithms and the traditional algorithm (the Method of Successive Averages) produce similar results and that the proposed algorithms can be extended to the computation of the case in which the random error term depends on measured travel time.