Economic lot sizing with constant capacities and concave inventory costs

This article studies the classical single‐item economic lot‐sizing problem with constant capacities, fixed‐plus‐linear order costs, and concave inventory costs, where backlogging is allowed. We propose an O(T³) optimal algorithm for the problem, which improves upon the O(T⁴) running time of the famous algorithm developed by Florian and Klein (Manage Sci18 (1971) 12–20). Instead of using the standard dynamic programming approach by predetermining the minimal cost for every possible subplan, we develop a backward dynamic programming algorithm to obtain a more efficient implementation. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

美国“深绿”计划对指挥控制的影响

“深绿”计划是美国国防部高级研究计划署为满足现代战争对快速决策的需求而提出的.“深绿”计划的目的是将仿真嵌入指挥控制系统,利用仿真支持正在进行的军事行动.通过对深绿体系结构、实现深绿的关键技术以及深绿实施方案的分析,重点研究了深绿计划对指挥控制的影响.该研究力图为我军作战指挥决策支持系统的建设提供方法和技术上的启发及借鉴.     

用于目标跟踪无线传感器网络的动态分簇算法

针对跟踪精度和网络能耗的问题,提出了一种用于目标跟踪无线传感器网络的基于预测的动态分簇算法.把目标运动过程看作是高斯马尔可夫过程,根据目标历史轨迹,估计下一时刻位置坐标和运动速度,然后基于估计结果优化选择分簇的簇头和簇成员,形成一个动态分簇来实现目标跟踪.仿真结果表明:该算法使目标跟踪有较好的跟踪精度,能有效均衡网络能耗,延长网络寿命.     

一娄非线性抛物方程组解的爆破现象新证明

利用能量方法给出了一类非线性抛物方程组解的有限时刻爆破现象的新证明,此方法将初值的条件从正的初值减弱到某些非负的情形。     

基于DTRC的形式自动证明平台及其应用

动态项重写计算(DTRC)是项重写系统(TRS)的元计算模型,具有层次化结构和动态重写等特征,可应用于归纳定理的形式自动证明以及项重写系统弱终止性的形式自动证明等方面.文中介绍了一个基于DTRC的形式自动证明平台及其在TRS弱终止性自动证明上的应用.     

关于圆柱壳在水下爆炸冲击波作用下二次加载现象的数值模拟研究

运用大型商业有限元程序MSC.DYTRAN数值模拟了水下爆炸冲击波载荷作用下自由环肋圆柱壳的非线性动态响应.采用一般耦合算法(generalcoupling)模拟流体与结构的耦合效应,计算中考虑了材料的应变率强化效应,几何非线性的影响,分析了空穴现象的产生和二次加载对结构响应的影响.仿真结果表明,相同工况和厚度下的无限自由平板和自由环肋圆柱壳,后者的空化时间比前者长,而壳体运动的最大速度后者比前者低.     

Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales

This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Approximate dynamic programming methods for an inventory allocation problem under uncertainty

We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

合成分队动态武器目标分配协同决策模型

针对合成分队地面作战特点,提出了一种动态武器目标分配的协同决策模型,该模型基于一种自适应决策中心的协同决策体系结构,以战场信息共享为核心,实现动态火力协同优化分配。提出了针对战场应急目标的一种快速火力分配方法,提高火力整体打击效率的火力适度分配优化方法,适应战场态势动态变化的anytime终止控制方法。仿真实例表明,该模型能够满足合成分队火力动态分配的需求,提高动态武器目标分配决策的合理性和科学性。