基于感知信息共享的C2网络特征分析*

指挥控制(C2,Command and Control)关系网络连接数的增加会增强指控节点之间的信息共享,但也会增加节点信息处理和交换负荷,如果达到一定程度,则会造成节点本身的"信息过载"从而影响C2网络性能.对此,通过研究C2网络在两种不同处理方式下的共享感知信息平均提交时间,用网络节点响应时间的均方差表征一个C2网络的共享态势感知时间的一致性,最后对两种不同结构C2网络特征参数的计算,说明了网络连接增加会导致信息提交时间的延长,但一致性会增强.     

A two‐echelon inventory‐location problem with service considerations

We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Single‐warehouse multi‐retailer inventory systems with full truckload shipments

We consider a multi‐stage inventory system composed of a single warehouse that receives a single product from a single supplier and replenishes the inventory of n retailers through direct shipments. Fixed costs are incurred for each truck dispatched and all trucks have the same capacity limit. Costs are stationary, or more generally monotone as in Lippman (Management Sci 16, 1969, 118–138). Demands for the n retailers over a planning horizon of T periods are given. The objective is to find the shipment quantities over the planning horizon to satisfy all demands at minimum system‐wide inventory and transportation costs without backlogging. Using the structural properties of optimal solutions, we develop (1) an O(T²) algorithm for the single‐stage dynamic lot sizing problem; (2) an O(T³) algorithm for the case of a single‐warehouse single‐retailer system; and (3) a nested shortest‐path algorithm for the single‐warehouse multi‐retailer problem that runs in polynomial time for a given number of retailers. To overcome the computational burden when the number of retailers is large, we propose aggregated and disaggregated Lagrangian decomposition methods that make use of the structural properties and the efficient single‐stage algorithm. Computational experiments show the effectiveness of these algorithms and the gains associated with coordinated versus decentralized systems. Finally, we show that the decentralized solution is asymptotically optimal. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

联合补充博弈的费用分摊

就一个仓库、多个零售商,对联合订货费用函数的模型进行分析,给出了一个求解最佳订货周期的多项式时间的算法,且算法的时间复杂性为O（nlogn）。利用文献[8]中的技巧,给出了该库存博弈的核。     

Fleet management in European integration: the case of military helicopter support

The article focuses on both economics and spatial issues related to Maintenance Repair and Overhaul (MRO) of defence platforms in Europe. Using facts and figures related to costs, trends and fleet sizes evolution, the authors discuss the interest of a spatial reorganisation of MRO production. Given the fiscal situation of the main European countries with a modern army, the relevant scale to consider the reorganisation is certainly Europe. Through the example of defence helicopters fleets of a selection of European countries, the authors address the question of cooperation of the MRO. A greater cooperation in the support of fleets would lead to a spatial reorganisation of MRO. On one side economies can be expected from this reorganisation, but, on the other hand, new problems arise. Specifically, a number of costs associated with different forms of “distances” – geographical, operational and political distances – limit the potential savings that could be expected. This work provides insights on these important issues for the construction of a European defence, both in its political, military and industrial dimensions.     

A characterization of optimal base‐stock levels for a multistage serial supply chain

In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016     

配套装备器材的库存与运输集成优化研究

针对我军配套装备器材订货的特点,在考虑库存容量空间限制与整套装备的最低期望满足率两种约束条件下,建立了配套装备器材的库存与运输优化模型,并应用改进的动态规划方法进行求解。结果表明：应用库存与运输的优化模型,在保障军事目标实现的前提下,有效地降低了物流成本。     

基于武器协同共用的无人机反潜作战效能研究

在一个暴露时间有限的反潜作战想定背景下,提出了评估该作战过程的效能指标,建立了相应的模型,并把武器协同共用条件下的作战结果与传统作战模式的结果作比较,结论表明,武器协同共用作战模式能够有效改善各项作战效能指标,是提高作战效能的有效手段。     

机动条件下的公共计算平台研究

针对未来战术机动系统的作战要求,利用面向服务技术体制(SOA),结合段集成机制,提出了构建机动系统的轻量级公共计算平台。平台从层次上划分为系统服务层、核心服务层、基础服务层和公共应用服务四个层次,每个层次通过编程接口向上层提供服务,以支持机动系统的动态演化、灵活配置、动态部署与系统间的互操作和信息共享。