Risk‐sensitive sizing of responsive facilities

We develop a risk‐sensitive strategic facility sizing model that makes use of readily obtainable data and addresses both capacity and responsiveness considerations. We focus on facilities whose original size cannot be adjusted over time and limits the total production equipment they can hold, which is added sequentially during a finite planning horizon. The model is parsimonious by design for compatibility with the nature of available data during early planning stages. We model demand via a univariate random variable with arbitrary forecast profiles for equipment expansion, and assume the supporting equipment additions are continuous and decided ex‐post. Under constant absolute risk aversion, operating profits are the closed‐form solution to a nontrivial linear program, thus characterizing the sizing decision via a single first‐order condition. This solution has several desired features, including the optimal facility size being eventually decreasing in forecast uncertainty and decreasing in risk aversion, as well as being generally robust to demand forecast uncertainty and cost errors. We provide structural results and show that ignoring risk considerations can lead to poor facility sizing decisions that deteriorate with increased forecast uncertainty. Existing models ignore risk considerations and assume the facility size can be adjusted over time, effectively shortening the planning horizon. Our main contribution is in addressing the problem that arises when that assumption is relaxed and, as a result, risk sensitivity and the challenges introduced by longer planning horizons and higher uncertainty must be considered. Finally, we derive accurate spreadsheet‐implementable approximations to the optimal solution, which make this model a practical capacity planning tool.© 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

Route optimization for multiple searchers

We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

无人机系统自主控制技术研究现状与发展趋势

无人机系统是未来进行信息对抗、夺取信息优势、实施火力打击的重要手段。"自主性"是无人机系统区别于有人机最重要的技术特征,实现无人机系统的自主控制,提高其智能程度,是无人机系统的重要发展趋势。对无人机系统自主控制问题进行了阐述,首先分析了无人机系统自主控制技术的发展需求,然后介绍了自主控制的概念和自主等级的划分;分析了无人机系统自主控制技术的研究现状,提出了无人机系统自主控制的关键技术问题,主要包括体系结构、感知与认知、规划与控制、协同与交互等;最后对无人机系统自主控制技术的发展趋势进行了展望。     

巡航导弹航迹规划中雷达探测盲区的快速构造算法

现代防空系统对巡航导弹的低空飞行和突防造成极大的威胁,利用防空系统中预警雷达的探测盲区进行隐蔽飞行是提高巡航导弹生存能力的重要手段,在此雷达探测盲区的快速构造算法是关键。说明了什么是雷达探测盲区,分析了影响雷达探测盲区的三个主要因素,并就对巡航导弹影响最大的雷达地形遮蔽盲区构造了基于极坐标的快速算法,并用一个地形实例验证了该方法的有效性。     

通信对抗无人机集群侦察区域规划规则研究

侦察区域规划是通信对抗无人机集群智能侦察的首要任务.能否合理规划侦察区域,对通信对抗侦察任务的完成至关重要.通过研究侦察区域规划分配和动态调整流程,结合通信对抗战斗原则和相关军事经验,整理归纳出通信对抗无人机集群进行侦察区域规划的行为规则、判定规则和策略规则,并提出了规则的使用建议,构想了具体应用场景.     

A general strategic capacity planning model under demand uncertainty

Capacity planning decisions affect a significant portion of future revenue. In equipment intensive industries, these decisions usually need to be made in the presence of both highly volatile demand and long capacity installation lead times. For a multiple product case, we present a continuous‐time capacity planning model that addresses problems of realistic size and complexity found in current practice. Each product requires specific operations that can be performed by one or more tool groups. We consider a number of capacity allocation policies. We allow tool retirements in addition to purchases because the stochastic demand forecast for each product can be decreasing. We present a cluster‐based heuristic algorithm that can incorporate both variance reduction techniques from the simulation literature and the principles of a generalized maximum flow algorithm from the network optimization literature. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于黑板推理与分层规划的CGF模糊决策模型

计算机生成兵力具有智能行为是其最大的特点,也是当前研究的重点和难点。为了使计算机生成兵力决策的智能化水平有所提高,把复杂的决策过程进行分层规划,将各层中决策子任务的求解策略、推理策略与黑板推理方法中的多任务协同工作原理相结合,构造了基于黑板推理的计算机生成兵力决策模型。同时,也将模糊理论应用到决策模型中。有效地提高了计算机生成兵力的智能水平。     

美国空间军事系统发展新动向

综述了美国在军事空间技术新的发展动向,包括美国空军的“空间军力加强、空间军力应用、空间支援、空间对抗”四大空间军事任务区,快速响应空间,新的空天进攻飞行器,军事小卫星运载器,军事小卫星,导弹防御先进技术等的发展动态。分析了军事空间技术的发展趋势。     

Integrated capacity,demand, and production planning with subcontracting and overtime options

Models for integrated production and demand planning decisions can serve to improve a producer's ability to effectively match demand requirements with production capabilities. In contexts with price‐sensitive demands, economies of scale in production, and multiple capacity options, such integrated planning problems can quickly become complex. To address these complexities, this paper provides profit‐maximizing production planning models for determining optimal demand and internal production capacity levels under price‐sensitive deterministic demands, with subcontracting and overtime options. The models determine a producer's optimal price, production, inventory, subcontracting, overtime, and internal capacity levels, while accounting for production economies of scale and capacity costs through concave cost functions. We use polyhedral properties and dynamic programming techniques to provide polynomial‐time solution approaches for obtaining an optimal solution for this class of problems when the internal capacity level is time‐invariant. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007