一种基于部分搜索的GNSS模糊度解算方法

为解决LAMBDA算法搜索策略效率不高的问题,提出了一种基于部分搜索的模糊度解算新方法。该方法的解算成功率接近LAMBDA算法,且只需对最后3维模糊度元素采取搜索策略。同时,通过合理设定搜索椭球的大小和搜索策略;大大提高了搜索效率。通过实验对该新算法与Bootraping算法、LAMBDA算法进行了比较分析,进一步验证了该新算法的有效性。     

求解CVRP问题的一种改进启发式蚁群算法

针对蚁群算法求解CVRP问题时收敛速度慢、求解质量不高的缺点,提出了一种改进启发式蚁群算法。该算法借鉴蚁群系统和基于排列的蚂蚁系统的优点设计信息素更新策略,既加强了对每次迭代最好解的利用,又避免了陷入局部最优;按一定比例使用基本方法和基于PFIH方法构造路径,扩大了算法的搜索空间;采用一种混合局部搜索算子,增强了算法局部寻优能力。实验结果表明,改进启发式蚁群算法可以大幅度减少车辆运行成本,具有较快的收敛速度。     

远程制导火箭子母弹对机场跑道毁伤研究

对机场跑道毁伤封锁是远程制导武器的重要任务,其毁伤判断的依据是最小升降窗口存在与否。采用Monte-Carlo方法对远程制导火箭子母弹打击机场跑道的炸点分布进行仿真模拟,提出了一种改进的搜索飞机起降最小升降窗口算法,并用该算法计算分析了远程制导火箭子母弹相关战技术因素对机场跑道毁伤的影响程度。计算结果表明改进算法计算封锁概率的值相对于区域搜索算法更加精确,研究结果对远程制导火箭子母弹的作战运用及进一步优化设计具有参考与实用价值。     

A learning tabu search for a truck allocation problem with linear and nonlinear cost components

The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015     

基于满意度的通信保障方案优选方法

针对当前通信保障方案缺少科学有效的评估方法,提出一种基于满意度的优选方法。从保障性、可靠性、时效性和经济性等4个方面,建立了评价指标体系;结合各个评价指标的特点,给出了具体量化方法,克服了评价时的主观性,并对量化后的结果进行了规范化处理;利用满意度理论,通过求解一系列关于指标权重的线性规划问题,确定了各评价指标的权重值;计算各预选方案的综合效能值,确定最终排序。最后,结合某次通信保障案例,对4个预选方案进行比较,该方法计算结果与实际相符,证明了其有效性。     

稀布阵下宽带多波束组合印证测向算法

在稀布阵下,对信号强度不同的多个信号进行多波束测向时,由于波束主瓣较宽,副瓣较高,因而无法分辨信号到达方向。针对此问题,提出了一种新的多波束测向算法,即多波束组合印证测向算法。该方法充分利用高副瓣的特点,建立多波束学习训练匹配表,通过查表综合判定信号到达方向。仿真实验结果表明:该算法很好地解决了稀布阵下对同时到达阵元的多个信号测向问题,且算法简单,运算量小,测向精度较好,具有很好的工程应用价值。     

基于劣化度的装备健康状态评估模型

为了准确评估装备的健康状态,实施装备的状态维修,引入劣化度概念,结合装备的特点,确定了以装备特征参数劣化度为评估指标,运用变权模糊理论,建立了基于劣化度的装备健康状态变权模糊综合评估模型。结合地空导弹装备实际工作,进行了实例分析,验证了该方法的准确性和有效性。     

高三复习前要做好的三件事

高考复习是一个系统工程,每一个环节要精心筹划,落实到位,才能收到良好的效果.文章深入分析了高三复习前要做好的三件事,研究考纲,明确方向;研究考题,预测命题趋势;研究学情,正确定位。这对每一位高三教师进行高三复习具有指导意义。     

A search game on a cyclic graph

There is a finite cyclic graph. The hider chooses one of all nodes except the specified one, and he hides an (immobile) object there. At the beginning the seeker is at the specified node. After the seeker chooses an ordering of the nodes except the specified one, he examines each nodes in that order until he finds the object, traveling along edges. It costs an amount when he moves from a node to an adjacent one and also when he checks a node. While the hider wishes to maximize the sum of the traveling costs and the examination costs which are required to find the object, the seeker wishes to minimize it. The problem is modeled as a two‐person zero‐sum game. We solve the game when unit costs (traveling cost + examination cost) have geometrical relations depending on nodes. Then we give properties of optimal strategies of both players. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.