战备物资储备统筹方法？

根据战备物资储备工作的特点和要求,分析了统筹工作的目的和意义,用于指导战备物资的储备工作。构建了战备物资储备统筹模型,运用定性和定量相结合的方法,综合考虑各种因素对储备的影响,对各方向的战备物资消耗需求量进行多层次的统筹,最终获得战备物资的储备限额量。     

战备物资储备统筹方法?

根据战备物资储备工作的特点和要求,分析了统筹工作的目的和意义,用于指导战备物资的储备工作。构建了战备物资储备统筹模型,运用定性和定量相结合的方法,综合考虑各种因素对储备的影响,对各方向的战备物资消耗需求量进行多层次的统筹,最终获得战备物资的储备限额量。     

网电对抗战备器材储备布局物流场模型研究

网电对抗战备器材储备布局的科学性、合理性,直接影响制约战时网电对抗维修器材供应,影响网电对抗装备保障的效能。着眼网电对抗战备器材储备布局的目标,立足网电对抗战备器材储备布局的原则,基于物流场理论构建网电对抗战备器材储备布局模型,并运用线性规划和Matlab进行模型求解,获得网电对抗战备器材储备布局的优化方案。     

军事虚拟仓库组织结构的博弈分析

简要介绍了军事虚拟仓库及其组织结构形式．以及博弈论的相关知识。结合军事后勤系统的特点,采用完全信息静态博弈纳什均衡的方法分析了军事虚拟仓库的组织结构模式,在假设的合理的条件下模拟3种组织形式的博弈过程。通过各个模型的最终纳什均衡,指出了3种组织结构形式运作的结果和其积极因素、消极因素、噪声构成．结合我军现有的后勤保障体制,提出现行保障体制的合理与不合理的地方,并给出了改进方案,对优化全军后方仓库布局及管理和战备物资储备及应急保障有着重要意义,可以为总部决策提供咨询建议。     

轴辐式战备物资储备网络枢纽储备点选址初探

为解决分散式点状分布的后方仓库在进行战备物资保障时运输线路多、保障效率低的问题,构建了轴辐式战备物资储备网络,着重探讨了该网络中枢纽储备点的选址问题。首先介绍了轴辐式战备物资储备网络的结构及优点;接着探讨了枢纽储备点的选取问题,建立了枢纽储备点选址评价体系;然后通过SPSS22软件,结合统计数据,运用主成分分析法简化了选址指标;最后通过聚类分析法对储备点划分了层级,得到的聚类结果可作为枢纽储备点的选取依据。     

武警部队后勤战备物资储备节点选址模型的构建

部队后勤战备物资储备节点是后勤战备物资储备的核心。着眼于武警部队后勤战备物资保障实际,结合物流节点选址的基本理论,构建了武警部队后勤战备物资储备节点的一元和多元选址模型,讨论了选址模型的应用思路。既是拓展武警部队后勤保障理论的有益探索,也能为武警部队后勤战备物资储备管理提供很好的决策依据。     

战备物资储备探析

战备物资储备是国家和军队为保障国防战备和战争需要进行的各种物资储存,是保证国民经济部分或全部由平时向战时转换并争取时间进行战争动员的必要手段。文章在阐述战备物资储备的基本含义及高技术局部战争对战备物资储备的要求的基础上,重点对战备物资储备体制、储备布局、储备规模及储备结构等问题进行了探讨。     

联勤分部战备储备物资审计初探

对于联勤分部审计部门来说,战备物资储备审计还是一个全新的课题,现结合我们的工作实际和体会对此作一些粗浅探讨。一、把握特点,认识审计监督的内涵(一)审计的针对性战备物资储备审计主要是对战役、战术物资储备计划、使用、管理等情况进行的综合检查和监督,联勤分部所属仓库储存的战备物资主要是上级拨付和指令调用的物资,自行采购、使用及处理并不多,审计部门在审计时,应主要针对内控制度、经费使用和物资管理三个方面加强审查监督。(二)审计的复杂性战备物资储备种类繁多,既有小到医药用品,大到武器装备的实物,又有形形色色的各种备件、…     

论建立适度规模的战略物资储备总量

储备足够的战略物资是保持足够的军事能力和战备水平的重要方面。战略后方基地担负着战略物资储备、供应任务,其保障能力的强弱对战争胜负有着十分重要的作用。因此,必须建立适度规模的物资储备总量,为保障未来战争的胜利奠定物资基础。在战备物资储备问题上,过去在“早打、大打、打核战争”思想的指导下,到处建军工厂,修储备库,战备物资越储越多,以至出现了诸如部队的运输力量已由畜力运输改成汽车运输多年后,战略仓库还有不少马鞍、马蹄铁;嘎斯车淘汰多年     

基于两级供应关系的军械战备器材存储模型研究

提出了在一定经费的约束条件下,使所有二级存储场站的所有战备器材期望缺货数最小的模型,通过对后方仓库存量初值和场站库存量的确定,求解出后方仓库和场站之间库存量的优化分配调整方案。最后通过实例得出发散型布局形态模型。     

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     

An exact analysis of a joint production‐inventory problem in two‐echelon inventory systems

We consider a two‐echelon inventory system with a manufacturer operating from a warehouse supplying multiple distribution centers (DCs) that satisfy the demand originating from multiple sources. The manufacturer has a finite production capacity and production times are stochastic. Demand from each source follows an independent Poisson process. We assume that the transportation times between the warehouse and DCs may be positive which may require keeping inventory at both the warehouse and DCs. Inventory in both echelons is managed using the base‐stock policy. Each demand source can procure the product from one or more DCs, each incurring a different fulfilment cost. The objective is to determine the optimal base‐stock levels at the warehouse and DCs as well as the assignment of the demand sources to the DCs so that the sum of inventory holding, backlog, and transportation costs is minimized. We obtain a simple equation for finding the optimal base‐stock level at each DC and an upper bound for the optimal base‐stock level at the warehouse. We demonstrate several managerial insights including that the demand from each source is optimally fulfilled entirely from a single distribution center, and as the system's utilization approaches 1, the optimal base‐stock level increases in the transportation time at a rate equal to the demand rate arriving at the DC. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于CREAM的后方仓库叉车装卸运输弹药HRA评估

针对我军后方仓库弹药装卸运输环节对人员叉车操作的安全性需求,设计出了叉车操作测试场地路线,归纳总结了人员操作叉车进行弹药装卸运输环节中的安全失效形式及失效原因,构建了HRA评估数学模型．选取我军某后方仓库搬运机械建制班人员为对象,进行了实地测试,得到了弹药装卸运输环节的人为失误概率．测试结果表明,基于CREAM方法能够较好地解决后方仓库弹药装卸运输环节人为失误概率的量化问题．     

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     

基于LVQ网络的高校科研能力评估

作为高校核心能力的科研能力,其高低已成为衡量一所高校综合实力的重要指标。如何准确高效的评价高校科研能力成为政府、企业和高校面临的一个十分重要的问题。影响高校科研能力的因素众多,本文选取11个典型指标,建立了基于LVQ的高校科研能力评估模型及算法。首先,介绍了LVQ网络;其次,建立了一种新的基于LVQ的高校科研能力评估模型及算法;最后,利用MATLAB R2009a编程实现了LVQ高校科研能力评估模型及算法。选取25所高校的科研能力数据用于仿真实验,其中20所高校数据作为训练集,其它5所作为测试集,该算法分类正确率为80%,达到了预期目标。仿真结果表明,该模型提高了高校科研能力评价的准确率,评价结果更加客观、公正,对高校科研能力评价具有一定的参考意义。     

战场物资快速运输的指挥控制

针对战场快速物资运输的指挥控制问题,提出一种基于线性规划的方法。根据供求双方物质的供应和需求总量、地理空间上的位置以及运输工具的运载能力等信息,制订一个满足供求双方物资总运载量,并以运送所有物资耗费时间为最小的优化目标,改进了传统运输问题模型。仿真分析表明,该方法为实现战场物资快速运输的指挥控制提供了有价值的参考。     

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     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

A simulated port facility in a theatre of operations

A hypothetical port facility in a theatre of operations is modeled and coded in a special purpose simulation language, for the purpose of conducting simulation experiments on a digital computer. The experiments are conducted to investigate the resource requirements necessary for the reception, discharge, and clearance of supplies at the port. Queue lengths, waiting times, facility utilizations, temporary storage levels, and ship turn-around times are analyzed as functions of transportation and cargo handling resources, using response surface methodology. The resulting response surfaces are revealing in regard to the sensitivity of port operations to transportation resource levels and the characteristics of the port facility's load factor. Two specific conclusions of significant value are derived. First, the simulation experiments clearly show that the standard procedures for determining discharge and clearance capacities take insufficient account of the effects of variability. Second, the response surfaces for ship turn-around times and temporary storage levels indicate that an extremely steep gradient exists as a function of troop levels.