导弹子母弹战斗部对复杂目标毁伤的计算机仿真

介绍了蒙特卡洛方法(Monte-Carlo)仿真的基本原理,并运用该方法对导弹子母弹战斗部对复杂目标毁伤进行研究,利用Matlab语言编制仿真程序实现了计算机仿真.有效地解决了其他方法计算繁琐的弊端,大大提高了毁伤仿真的计算效率.仿真结果表明应用该方法建模技术简洁,模型的通用性好,并能够随时根据需求进行功能扩展.     

Optimal outbound dispatch policies: Modeling inventory and cargo capacity

In this paper, we present an optimization model for coordinating inventory and transportation decisions at an outbound distribution warehouse that serves a group of customers located in a given market area. For the practical problems which motivated this paper, the warehouse is operated by a third party logistics provider. However, the models developed here may be applicable in a more general context where outbound distribution is managed by another supply chain member, e.g., a manufacturer. We consider the case where the aggregate demand of the market area is constant and known per period (e.g., per day). Under an immediate delivery policy, an outbound shipment is released each time a demand is realized (e.g., on a daily basis). On the other hand, if these shipments are consolidated over time, then larger (hence more economical) outbound freight quantities can be dispatched. In this case, the physical inventory requirements at the third party warehouse (TPW) are determined by the consolidated freight quantities. Thus, stock replenishment and outbound shipment release policies should be coordinated. By optimizing inventory and freight consolidation decisions simultaneously, we compute the parameters of an integrated inventory/outbound transportation policy. These parameters determine: (i) how often to dispatch a truck so that transportation scale economies are realized and timely delivery requirements are met, and (ii) how often, and in what quantities, the stock should be replenished at the TPW. We prove that the optimal shipment release timing policy is nonstationary, and we present algorithms for computing the policy parameters for both the uncapacitated and finite cargo capacity problems. The model presented in this study is considerably different from the existing inventory/transportation models in the literature. The classical inventory literature assumes that demands should be satisfied as they arrive so that outbound shipment costs are sunk costs, or else these costs are covered by the customer. Hence, the classical literature does not model outbound transportation costs. However, if a freight consolidation policy is in place then the outbound transportation costs can no longer be ignored in optimization. Relying on this observation, this paper models outbound transportation costs, freight consolidation decisions, and cargo capacity constraints explicitly. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 531–556, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10030     

Capacity allocation to sales agents in a decentralized logistics network

Many logistics systems operate in a decentralized way, while most optimization models assume a centralized planner. One example of a decentralized system is in some sea cargo companies: sales agents, who share ship capacity on a network, independently accept cargo from their location and contribute to the revenue of the system. The central headquarters does not directly control the agents' decisions but can influence them through system design and incentives. In this paper, we model the firm's problem to determine the best capacity allocation to the agents such that system revenue is maximized. In the special case of a single‐route, we formulate the problem as a mixed integer program incorporating the optimal agent behavior. For the NP‐hard multiple‐route case, we propose several heuristics for the problem. Computational experiments show that the decentralized system generally performs worse when network capacity is tight and that the heuristics perform reasonably well. We show that the decentralized system may perform arbitrarily worse than the centralized system when the number of locations goes to infinity, although the choice of sales incentive impacts the performance. We develop an upper bound for the decentralized system, where the bound gives insight on the performance of the heuristics in large systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

弹道导弹反拦截作战中子母弹抛撒方法研究

以弹道导弹突破“爱国者”反导弹为背景 ,研究了一种通过调整子母弹抛撒高度提高突防能力的方法。通过对所建子母弹飞行动力学模型的仿真 ,计算出子母弹不被拦截的最优抛撒高度 ,同时也计算了该抛撒高度下子弹抛撒圆的半径及其抛撒误差 ,为作战应用提供了理论基础     

运输机装载规划视景仿真技术的研究

以运输机装载规划过程为仿真对象,建立简化数学模型,然后结合Unity3D引擎,运用视景仿真技术相关知识,把运输机装载规划全过程、运输机装载过程中质心变化等进行实时显示。运用视景仿真技术进行运输机装载规划,可对真实装载规划过程起到重要的引导作用,并且能够有效缩短运输机装载规划周期,提高运输机装载效率。     

具有多射击诸元的子母弹武器系统毁伤效能分析

利用蒙特卡罗方法和Matlab语言编制程序,对一个炮射子母弹火力单位采用多个射击诸元对集群目标射击时的毁伤效能进行了仿真分析。结果表明,在射弹数目较大的条件下,多射击诸元的毁伤效能明显优于传统的集火射击体制。     

火箭子母弹电子时间引信电路设计

为火箭子母弹定时开舱提供了一种性能先进的电子时间引信电路系统,阐述其电路组成、工作原理和功能,并分析了该电子时间引信系统的特点。     

子弹均匀散布子母弹最有利火力分配方法

在将子弹均匀散布的椭圆区域等效转换为矩形区域的基础上,建立了适宽射向射击子母弹对矩形目标毁伤全概率计算的数学模型。通过函数转换和泛函分析给出了子弹均匀散布子母弹理想射击密度,得到了理想射击密度下对目标的毁伤概率计算公式。讨论了最有利火力分配方式的确定方法,给出了最优射向间隔和表尺差的计算公式,为便于实际应用,给出了最优火力分配计算中所需的3个参数的近似计算公式,最后给出了应用算例。