基于交通限制的路网最优路径算法

为了解决车辆诱导系统中复杂道路结构表达及因为城市道路交通信号管理而产生的最优路径选择求解的复杂性,依据图论中最短路径算法的基本原理,提出了含有禁行路线路网的最优路径求解算法。以行程时间最少为目标,按照网络转化法把含有禁行路线的路网转化为不含有禁行路线的路网,采用邻接节点矩阵和邻接节点权矩阵实现了道路节点关系的表达,改善了传统的Dijkstra算法,将全局节点路径的求解转化为与求解节点紧密联系的局部区域求解,将所研究的网络转化方法和改进的路径寻优算法应用于车辆诱导系统。结果表明应用该算法能够在含有禁行路线的路网中求解最优路径,减少了问题求解的路网节点数,提高了计算效率。     

导弹中末段制导导引律转换研究

文章研究了导弹由中间段制导律向末段制导律转换的问题,提出了一种可变导引系数的组合制导律,即可变系数组合比例导引律（ACNG）。仿真结果表明,该导引律总体优于纯比例导引和固定系数组合比例导引律,中末段弹道过渡平滑,衔接良好,有利于中末段的交班,同时降低了导弹的需用过载。     

基于贝叶斯网络的末制导雷达可靠性分析

复杂系统的可靠性数据分散、混杂,传统方法难以得出有效的分析结论。贝叶斯网络模型能够描述部件间相互关系与系统影响程度的变化趋势,较适于建立可靠性分析模型。为此,以某型导弹末制导雷达为实例,通过不同条件下两种贝叶斯网络模型（静态与动态）的比较分析,较为详细地给出故障诊断与致因影响等结论,并验证了模型的有效性。     

一种新的鱼雷垂直命中目标的制导方法

该文针对鱼雷采用前视角声纳和旁视声纳识别和跟踪目标,引入了初始导引段跟踪虚拟目标的概念,提出一种新的精确制导方法,给出了导引跟踪和垂直命中弹道的数学模型。经仿真和分析表明：该制导方法对攻击目标的初始态势几乎没有限制,即使目标为逃避攻击进行转向机动,也能垂直命中目标。     

基于绿色交通的拉萨公共交通出行引导研究

在绿色交通的条件下,以层次分析法对拉萨市居民公共交通出行的影响因素进行分析,得到居民公共交通出行主要影响因素是经济性和环保意识,其次为便捷性和个人偏好以及出行者的年龄.提出以提高经济性和增强环保意识为主,兼顾便捷性和个人偏好以及年龄为辅的公共交通出行引导策略.     

双目标路径诱导下的交通信息定价策略

为了提高交通信息定价精度,在假定出行者权衡出行时间和出行费用双目标路径诱导的基础上,建立混合均衡定价模型,通过实例对模型进行了标定和验证,对比评价了单目标和双目标路径诱导下的交通信息定价策略,并给出双目标路径诱导下的交通信息定价结果。研究结果表明,与双目标路径诱导相比,单目标路径诱导改变了交通信息定价的可行区域,当具有信息的出行者、交通信息提供者、交通管理者三方各自的利益为决策主体时,交通信息的最终价格分别为1.3、2.6和1.8元,说明了混合均衡定价模型是有效的。     

交通拥挤漂移的形成机理与预防技术

为了研究交通诱导信息对驾驶员驾驶行为的影响,从诱导比例、替代路径数量、替代路径合理性和路网交通负荷分布的角度,分析了在动态交通诱导条件下拥挤漂移现象的产生机理,提出了逐步增加诱导比例,在路阻数据中加入干扰因子与K最短路方法等3种预防交通拥挤漂移的技术,并采用Vissim交通仿真软件对其进行了模拟评价。模拟结果表明:在局部拥挤的道路网络中,所提出的3种方法都能够减轻或消除拥挤漂移现象,其中K最短路方法的效果最好,其次是逐步诱导方法,尽管在路阻数据中加入干扰因子的方法效果最不理想,但仍优于对车辆进行100%诱导和不采取任何诱导措施的情况。     

Variable guidance for pedestrian evacuation considering congestion,hazard, and compliance behavior

A methodology for optimizing variable pedestrian evacuation guidance in buildings with convex polygonal interior spaces is proposed. The optimization of variable guidance is a bi-level problem. The calculation of variable guidance based on the prediction of congestion and hazards is the upper-level problem. The prediction of congestion provided the variable guidance is the lower-level problem. A local search procedure is developed to solve the problem. The proposed methodology has three major contributions. First, a logistic regression model for guidance compliance behavior is calibrated using a virtual reality experiment and the critical factors for the behavior are identified. Second, the guidance compliance and following behaviors are considered in the lower-level problem. Third, benchmarks are calculated to evaluate the performance of optimized variable guidance, including the lower bound of the maximum evacuation time and the maximum evacuation time under a fixed guidance. Finally, the proposed methodology is validated with numerical examples. Results show that the method has the potential to reduce evacuation time in emergencies.     

我国航海类毕业生在船服务期缩短原因初探及对策研究

对于近几年开始出现的我国航海类毕业生在船服务期缩短这一现象,本文试图通过综合分析,探究其成因;并在此基础上,运用现代人力资源管理的有关观点,研究解决这个问题的方法.     

A geometry-based algorithm to provide guidance for electric vehicle charging

Electric vehicles (EVs) have been regarded as effective options for solving the environmental and energy problems in the field of transportation. However, given the limited driving range and insufficient charging stations, searching and selecting charging stations is an important issue for EV drivers during trips. A smart charging service should be developed to help address the charging issue of EV drivers, and a practical algorithm for charging guidance is required to realise it. This study aims to design a geometry-based algorithm for charging guidance that can be effectively applied in the smart charging service. Geographic research findings and geometric approaches are applied to design the algorithm. The algorithm is practical because it is based on the information from drivers’ charging requests, and its total number of calculations is significantly less than that of the conventional shortest-first algorithm. The algorithm is effective because it considers the consistency of direction trend between the charging route and the destination in addition to the travel distance, which conforms to the travel demands of EV drivers. Moreover, simulation examples are presented to demonstrate the proposed algorithm. Results of the proposed algorithm are compared with those of the other two algorithms, which show that the proposed algorithm can obtain a better selection of charging stations for EV drivers from the perspective of entire travel chains and take a shorter computational time.