The stochastic joint replenishment problem: A new policy,analysis, and insights

In this study, we propose a new parsimonious policy for the stochastic joint replenishment problem in a single‐location, N‐item setting. The replenishment decisions are based on both group reorder point‐group order quantity and the time since the last decision epoch. We derive the expressions for the key operating characteristics of the inventory system for both unit and compound Poisson demands. In a comprehensive numerical study, we compare the performance of the proposed policy with that of existing ones over a standard test bed. Our numerical results indicate that the proposed policy dominates the existing ones in 100 of 139 instances with comparably significant savings for unit demands. With batch demands, the savings increase as the stochasticity of demand size gets larger. We also observe that it performs well in environments with low demand diversity across items. The inventory system herein also models a two‐echelon setting with a single item, multiple retailers, and cross docking at the upper echelon. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

加强建筑消防设计审核工作之思考

结合自己的工作实践 ,分析建筑消防设计审核工作的重要性 ,并对如何加强建筑消防设计审核工作提出了看法。     

The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy

We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

武警学院研究生教育回顾与发展问题思考

武警学院研究生教育已开办六年,分析六年来研究生教育的基本情况、取得的成绩和存在的问题,对于今后一个时期的研究生教育具有现实指导作用。     

消防中介机构法制建设问题研究

消防中介机构法制建设还存在很多问题,立法滞后,执法不严,必须加强法制建设,促进消防中介机构规范运行,以利于消防中介机构的健康发展。     

防空火控系统火力分配的多目标优化研究

在防空火控系统的研究中,如何充分发挥火力单元的作战效能,使来袭目标遭受最大的毁伤,是火力分配研究的一个关键问题.通过对防空火控系统的分析,给出了防空火控系统火力分配的问题描述,并建立了基于指派问题的火力分配数学模型.提出了威胁度计算的改进方法.在使防空高炮群对威胁度大的目标造成大的毁伤分配准则下,研究了利用匈牙利法求解指派问题时的具体方法.经仿真验证,此火力分配方法合理、有效.     

贪心遗传算法解决一般武器-目标分配问题

一般武器-目标分配问题,是使武器发挥最大效能而使目标遭受最大毁伤的最优化问题.遗传算法广泛用于解决最优化问题.提出一种具有贪心优化机制的局部搜索方法,以提高遗传算法的搜索效率,从而迅速找到全局最优解.应用于炮兵武器-目标分配问题的仿真试验结果表明,此算法比现有的其他搜寻算法具有更好的求解效率.     

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     

面向多平台多目标协同跟踪的指派问题

针对多平台多目标协同跟踪中要求多个无人地面平台尽可能均匀地协同跟踪多个目标的特点,提出了改进的离散粒子群优化算法。首先采用连续型粒子群优化算法中的速度和位置迭代公式,然后对粒子位置进行离散编码,使粒子编码对应于可行的指派方案;其次,在优化算法中引入局部搜索,提高算法寻优性能。最后将所提算法应用于多平台多目标协同跟踪中的指派问题,并与未加入局部搜索的粒子群优化算法比较,仿真结果表明,加入局部搜索后的离散粒子群优化算法具有较好的寻优性能。     

CGCS2000大地问题解算工程运用研究

军事信息系统研制中经常涉及CGCS2000坐标系下的大地问题解算,但直接采用韦森特公式进行软件设计存在一些问题。通过对韦森特公式在工程运用中的问题进行了分析,对正解、反解算法进行了补充完善并给出了相关的计算实例供编程检查。改进后的算法简单实用,适合军事信息系统软件的实现。