“协同制导通道”基本概念及其应用分析

舰艇编队协同反导作战,是海上网络中心作战的典型样式.针对舰艇编队网络化协同反导作战装备体系特殊性,提出了“协同制导通道”基本概念和数学表示方法,并对基于协同制导通道分配方法运用于网络化反导作战条件下武器资源分配进行了研究.分析了单舰反导作战“武器目标分配”的局限性,网络化反导作战“弹-目匹配”新需求和“协同制导通道”的选择方法,为确定“协同制导通道”选择的最优化指标,提出选择“协同制导通道”优化算法奠定了基础.     

异步雷达组网协同跟踪动态传感器分配算法

针对异步雷达组网下的协同跟踪问题提出了一种基于异步顺序融合的动态传感器分配算法。该算法对异步雷达的量测值按采样时刻顺序滤波,根据滤波协方差和目标期望协方差的接近程度动态选择下一时刻跟踪的最优传感器集合。仿真分析表明该算法和基于伪量测的异步雷达组网协同跟踪传感器分配算法相比具有较少的计算量和较高的目标跟踪精度。     

Terminal allocation problem in a transshipment hub considering bunker consumption

This article investigates the method of allocating arriving vessels to the terminals in transshipment hubs. The terminal allocation decision faced by a shipping alliance has the influence on the scheduled arrival time of vessels and further affects the bunker consumption cost for the vessels. A model is formulated to minimize the bunker consumption cost as well as the transportation cost of inter‐terminal transshipment flows/movements. The capacity limitation of the port resources such as quay cranes (QCs) and berths is taken into account. Besides the terminal allocation, the QC assignment decision is also incorporated in the proposed model. A local branching based method and a particle swarm optimization based method are developed to solve the model in large‐scale problem instances. Numerical experiments are also conducted to validate the effectiveness of the proposed model, which can save around 14% of the cost when compared with the “First Come First Served” decision rule. Moreover, the proposed solution methods not only solve the proposed model within a reasonable computation time, but also obtain near‐optimal results with about 0.1～0.7% relative gap. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 529–548, 2016     

Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

A dynamic allocation heuristic for centralized safety stock

An inventory system that consists of a depot (central warehouse) and retailers (regional warehouses) is considered. The system is replenished regularly on a fixed cycle by an outside supplier. Most of the stock is direct shipped to the retailer locations but some stock is sent to the central warehouse. At the beginning of any one of the periods during the cycle, the central stock can then be completely allocated out to the retailers. In this paper we propose a heuristic method to dynamically (as retailer inventory levels change with time) determine the appropriate period in which to do the allocation. As the optimal method is not tractable, the heuristic's performance is compared against two other approaches. One presets the allocation period, while the other provides a lower bound on the expected shortages of the optimal solution, obtained by assuming that we know ahead of time all of the demands, period by period, in the cycle. The results from extensive simulation experiments show that the dynamic heuristic significantly outperforms the “preset” approach and its performance is reasonably close to the lower bound. Moreover, the logic of the heuristic is appealing and the calculations, associated with using it, are easy to carry out. Sensitivities to various system parameters (such as the safety factor, coefficient of variation of demand, number of regional warehouses, external lead time, and the cycle length) are presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system

A single server is faced with a collection of jobs of varying duration and urgency. Each job has a random lifetime during which it is available for nonpreemptive service. Should a job's lifetime expire before its service begins then it is lost from the system unserved. The goal is to schedule the jobs for service to maximize the expected number served to completion. Two heuristics have been proposed in the literature. One (labeled π^S) operates a static priority among the job classes and works well in a “no premature job loss” limit, whereas the second (π^M) is a myopic heuristic which works well when lifetimes are short. Both can exhibit poor performance for problems at some distance from the regimes for which they were designed. We develop a robustly good heuristic by an approximative approach to the application of a policy improvement step to the asymptotically optimal heuristic π^S, in which we use a fluid model to obtain an approximation for the value function of π^S. The performance of the proposed heuristic is investigated in an extensive numerical study. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

基于混合智能算法的小型通信干扰装备分配优化

如何充分发挥小型通信干扰装备的作战效能是指挥员面临的棘手问题。本文将战术指标——干扰后的通信畅通区覆盖程度作为评估通信干扰装备分配优劣的指标,分别建立了单机和多部干扰时的通信干扰有效压制区和通信畅通区边界的计算模型,并给出了通信干扰有效压制区和通信畅通区面积的计算方法。构建了基于机会约束规划的空域频域通信干扰任务分配模型,并设计了混合蚁群算法和遗传算法的模型求解算法。最后进行了仿真实验,验证分析了模型和算法的合理性。研究成果为通信对抗战术计算和作战运用研究拓展了思路。     

社会单位建筑消防设施现状与对策研究

确保社会单位建筑消防设施的完好有效,直接关系到建筑物整体的防灾、抗灾的能力,也是筑牢社会单位＂防火墙＂工程的基本保障之一。剖析了社会单位建筑消防设施的现状,分析存在的问题,并就加强建筑消防设施的日常管理提出了几点设想和建议。     

Mixed rules in multi‐issue allocation situations

Multi‐issue allocation situations study problems where an estate must be divided among a group of agents. The claim of each agent is a vector specifying the amount claimed by each agent on each issue. We present a two‐stage rule. First, we divide the estate among the issues following the constrained equal awards rule. Second, the amount assigned to each issue is divided among the agents in proportion to their demands on this issue. We apply the rule to two real‐world problems: the distribution of natural resources between countries and the distribution of budget for education and research between universities.     

耐久性及其在装备研制中的应用

机械产品在武器装备中占有较大的比例,机械产品的故障,有很多是由于疲劳、磨损、腐蚀、老化等渐变性的耗损过程造成的,寿命是机械产品可靠性中的重要问题。耐久性的提出为解决机械产品与寿命有关的问题提供了方法和工具。通过探讨耐久性的定义、极限状态、耐久性参数、耐久性分配与预计等有关耐久性的基本问题,给出了耐久性分配与预计的工程实例。