Newsvendor problems with sequentially revealed demand information

This article analyzes a capacity/inventory planning problem with a one‐time uncertain demand. There is a long procurement leadtime, but as some partial demand information is revealed, the firm is allowed to cancel some of the original capacity reservation at a certain fee or sell off some inventory at a lower price. The problem can be viewed as a generalization of the classic newsvendor problem and can be found in many applications. One key observation of the analysis is that the dynamic programming formulation of the problem is closely related to a recursion that arises in the study of a far more complex system, a series inventory system with stochastic demand over an infinite horizon. Using this equivalence, we characterize the optimal policy and assess the value of the additional demand information. We also extend the analysis to a richer model of information. Here, demand is driven by an underlying Markov process, representing economic conditions, weather, market competition, and other environmental factors. Interestingly, under this more general model, the connection to the series inventory system is different. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 2012     

连续情形的窃贼问题

讨论了连续时间上的窃贼问题。Ｊｔ是［０,ｔ］上窃贼作案的次数,｛Ｊｔ｝ｔ≥０是Ｐｏｉｓ－ｓｏｎ过程;收获过程与风险过程都是独立同分布的时间序列。利用弱无穷小算子,我们找出了最优停时规则。     

双二体几何切面法及天梯地月转移轨道分析

双二体模型是求解地月转移轨道的重要基础。与传统的采用月球影响球入口点经纬度的描述方式不同,本文提出一种基于飞行轨道面参数来描述地月转移轨道的双二体模型几何表达方式,结合一维非线性方程求根算法Brent算法和Lambert原理,将原始三维球面搜索算法降维成为二维圆上的搜索算法,可以高效求解地月转移轨道的形状参数。为避免重复计算,将转移轨道窗口计算的轨道多变量搜索问题解耦分解成两个子问题——转移轨道形状参数求解问题和转移轨道面空间定向问题,降低了问题的求解维度。形成两级并行计算算法,充分发挥多核计算机算力,加速计算过程。仿真结果表明,基于提出的并行圆锥曲线几何切面法,可以成功应用于计算天梯地月转移轨道分析。     

Generalized orienteering problem with resource dependent rewards

We introduce a generalized orienteering problem (OP) where, as usual, a vehicle is routed from a prescribed start node, through a directed network, to a prescribed destination node, collecting rewards at each node visited, to maximize the total reward along the path. In our generalization, transit on arcs in the network and reward collection at nodes both consume a variable amount of the same limited resource. We exploit this resource trade‐off through a specialized branch‐and‐bound algorithm that relies on partial path relaxation problems that often yield tight bounds and lead to substantial pruning in the enumeration tree. We present the smuggler search problem (SSP) as an important real‐world application of our generalized OP. Numerical results show that our algorithm applied to the SSP outperforms standard mixed‐integer nonlinear programming solvers for moderate to large problem instances. We demonstrate model enhancements that allow practitioners to represent realistic search planning scenarios by accounting for multiple heterogeneous searchers and complex smuggler motion. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

高速行进坦克身管速度对射击精度影响

坦克在高速行进时,由于路面谱等外部激励的影响,车体姿态和运动状态都会发生变化。由于车体的振动和随动系统的控制误差等,致使坦克火炮在射击时身管前端存在一定的速度扰动。原有解命中问题的条件中未考虑这一速度扰动的影响,使得坦克在高速行进条件下的目标提前点预测产生误差。通过建立外弹道模型,较准确地仿真分析了这一误差的大小和对射击精度的影响。     

基于委托模式的多分辨率联合仿真

多分辨率联合仿真是实现多层次、多视角仿真的有效方法之一。现有多分辨率联合仿真模式存在一致性偏差和仿真剧情割裂问题,从而影响仿真的有效性。为此,提出基于委托模式的多分辨率联合仿真思路,该模式下能够较好地避免仿真剧情割裂问题,同时降低一致性问题的解决难度。通过实例验证,该方法较好地适用于大规模作战和局部作战行动的多分辨率联合仿真。     

理想格上高效公钥加密方案

目前现存的R—LWE公钥加密方案,普遍存在公钥尺寸大、密文扩展率高的缺陷。给出一种高效的理想格上公钥加密方案,在多用户环境中,借助一个基于广义背包难题的可抵抗碰撞的哈希函数构造用户的公私钥对,缩短了公钥长度;通过增加整个密文中携带消息密文的份额,有效降低了加密每比特明文的平均开销。在安全性方面,由公钥恢复私钥的困难性可以归约到理想格中SVP问题,对密文的攻击相当于求解判定性R—LWE问题。因此,方案能够达到CPA安全性。     

递归划分的标签约束可达性计算方法

现实世界中的图往往在结点和边上包含描述信息,可达性查询是图数据管理和挖掘中的基本操作之一。针对图数据中标签约束的可达性计算问题,提出一种基于递归划分的可达性计算方法 RP-Hop。该算法基于层次划分思想,利用独立集性质,在保持标签和可达性前提下对大规模图进行递归划分,并结合贪婪扩展思想和递归编码,为标签约束的可达性查询提供压缩索引。经过合成和真实数据集上的实验,结果表明,RP-Hop算法不仅降低了索引大小和构建时间,而且提高了查询效率。     

高校评建工作中问题管理模式应用研究

问题管理模式把发现问题作为高校评建工作中经常性的制度内容,把解决问题作为高校评建工作的核心。在高校评建过程中,运用问题管理模式会大大提高评建工作的质量和效率。     

我国新能源战略之消防安全问题研究

新能源战略的实施是我国能源战略调整的重要内容,也是经济可持续发展的重要保证。研究了氢能、燃料电池、"可燃冰"、洁净煤等新能源在开发、生产、储运和使用过程中存在的消防安全问题,并提出了相应的消防安全对策,为确保国家能源战略调整的顺利实施提供技术支持。