舰炮武器对驱逐舰目标射击毁伤定律研究

在综合评判驱逐舰目标毁伤等级并建立目标毁伤树的基础上,构造了舰炮武器系统对驱逐舰目标射击命中毁伤区域的简化模型图,建立了舰炮对驱逐舰目标射击的条件命中概率模型,通过分析弹丸对装甲目标的终点效应,建立了舰炮对驱逐舰目标射击的条件毁伤概率模型.计算结果表明,运用该方法研究舰炮武器系统对驱逐舰目标射击毁伤定律可信性高.     

基于状态的检查与修理综合决策模型

分析了单部件系统退化过程的特点,建立了基于状态的检查与修理决策模型。该模型根据系统的当前状态来决定检查与修理,通过分析计算系统在一个更新周期内平均检查次数、预防性维修及修复性故障的概率,建立维修费用与检查问隔及预防性维修阈值的关系,以平均维修费用最小为目标,优化检查间隔及预防性维修阈值。最后运用Matlab对模型进行数值计算,结果表明,模型能有效地降低维修费用。     

基于博弈论的装备采办成本控制问题研究

从武器装备采办的理论需求出发,以博弈论为理论工具,对武器装备采办过程中的生产成本控制问题进行了分析;建立了基于激励的生产成本控制模型,并对成本控制模型的特点进行了分析和解释;针对军方在激励合同执行过程中有可能出现的2类错误,对成本控制模型进行了优化。在非对称信息条件下,优化后的成本控制模型不但能有效减少2类错误的发生,而且可提高军方装备采办效用,减少代理方合同风险。     

Capacitated warehouse location model with risk pooling

In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Clifford分析中K超正则函数的Riemann边值问题

Clifford分析中的函数理论被广泛研究,得到的许多结果推广了经典复分析中解析函数的理论。文中研究了Clifford分析中K超正则函数的Riemann边值问题,得到它的一种表示式和Cauchy积分公式等一些性质,利用转化法和积分方程及不动点原理证明了它的一类Riemann边值问题O解的存在唯一性。     

分物问题的分法数计算

r个物品分配到n个盒子中,在不同的条件下会有不同的分法数。本文讨论了不同条件下,分法数的计算方法。     

线性系统测试矩阵优化

研究了工程中常见的线性系统循环指数为1(即其约当标准形不同的约当块不出现重根)的情况下测试矩阵优化的方法.通过将系统矩阵变换为约当标准型,能够简单地判定测试矩阵能否保持系统可观测.采用该方法可以在保持系统可观测的情况下,简单而直观地获取系统测试代价最小的测试策略.例子表明,该算法在工程上易于应用.     

低地球轨道卫星网络节能方法

通常卫星的唯一能源来源是太阳能,因此星上网络设备的能源供应问题比地面网络的更加严峻。通过修改和扩展链路容量受限的最小代价多商品流模型来适应卫星网络这一特殊的体系结构,并基于低轨道卫星网络的多重覆盖机制和流量分布模型,改进现有的启发式算法来关闭冗余的卫星节点、星地链路和星间链路。在满足链路利用率和路由跳数增加比例约束的条件下,仿真实验中关闭上述三种参数的比例分别可达59%、61%和72%,卫星网络的总体节能比例可达65%。     

卫星数传调度模型研究

卫星数传调度问题是一个具有多时间窗口、多资源约束的优化问题。针对该问题,建立了卫星数传需求模型、任务模型和调度模型。在建模过程中,采用了框架模型形式,把问题中的主要约束封闭于每个数传任务中,这在降低调度模型复杂度的同时,也降低了调度算法设计难度。还提出了调度算法设计思想,并设计了一基于灵活度的调度算法。仿真表明,所建立的模型及算法对解决卫星数传调度问题是可行的。     

Chance‐constrained multi‐terminal network design problems

We consider a reliable network design problem under uncertain edge failures. Our goal is to select a minimum‐cost subset of edges in the network to connect multiple terminals together with high probability. This problem can be seen as a stochastic variant of the Steiner tree problem. We propose two scenario‐based Steiner cut formulations, study the strength of the proposed valid inequalities, and develop a branch‐and‐cut solution method. We also propose an LP‐based separation for the scenario‐based directed Steiner cut inequalities using Benders feasibility cuts, leveraging the success of the directed Steiner cuts for the deterministic Steiner tree problem. In our computational study, we test our branch‐and‐cut method on instances adapted from graphs in SteinLib Testdata Library with up to 100 nodes, 200 edges, and 17 terminals. The performance of our branch‐and‐cut method demonstrates the strength of the scenario‐based formulations and the benefit from adding the additional valid inequalities that we propose. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 321–334, 2015