The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

A decision support system for the procurement of military equipment

The use of life-cycle costs in procurement is limited by the accuracy of cost estimates and assessments of availability risks under the conditions generating costs. Critical to these problems are the needs and responses of equipment to maintenance and repair. Using transition probabilities to define the relationships between serviceability and maintenance and repairs, this article develops a comprehensive decision support system for military procurement. It uses a dynamic programming model to determine the least-cost set of maintenance and repair decisions, where adjustments are included for warranty conditions, time value of money, the opportunity costs of equipment failure, and the end-of-cycle salvage values or disposal costs. The system allows users to define working and failed states, create their own rules or indicators of availability from estimates of state probabilities and establish thresholds of risk acceptability.     

飞机反区速度矢量不稳定及其控制的机理

在信号流图的基础上,提出多回路分析的方法,并用于研究反区时速度矢量不稳定及其稳定控制的机理。建立了纵向动力学的信号流图,并证明了一个回路的收敛性定理。在此基础上,通过理论分析得出了速度矢量不稳定在不同层面上的原因,也得出了速度和轨迹的发散度表达式等,并表明阻力-速度曲线、轨迹角-速度曲线、极曲线、阻力系数曲线等存在相互对应的反区和正区,并且阻力-速度曲线和轨迹角-速度曲线在斜率上成比例。研究得出进场动力补偿系统下速度矢量的稳定临界条件、收敛度、稳定机理等,理论分析和仿真比较了速度恒定进场动力补偿系统和迎角恒定进场动力补偿系统在控制性能上的差异。     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

基于改进信息熵的综合反隐身作战效能评估

首先提出了改进信息熵的作战效能评估方法,将作战过程划分为若干作战节点,节点的效能发挥受若干因素影响,并用不确定性自信息量来描述影响的不确定程度。在影响因素选取上,引入了未知因素,有效解决了具体作战中难以全面考虑节点效能发挥的所有影响因素问题。其次基于综合反隐身作战中的信息流关系建立了信息流图,并构建了对应的作战效能评估指标体系,最后计算了不同传感器组合和不同作战方式组合下的作战效能,并得出了结论：反隐身作战中,越多样化的传感器组合和越综合化的作战方式,作战的不确定性自信息量越小,作战效能越大。     

在任职教育中开发学员任职经验的探讨

任职教育是在受训学员有着一定的任职经验基础上,提高岗位任职能力的一种短期培训。在教学实施过程中,必须注重挖掘任职经验,交流任职经验,再把经验上升为理论从而去指导部队实践。这种任职经验的开发,有利于在教学过程中按需施教,扩大师生的视野,丰富教学资源,实现理论与实践的统一,有效达成任职教育的目标。     

有源诱饵弹对抗毫米波制导武器仿真分析

有源诱饵弹是对抗毫米波制导武器的一种重要手段。根据毫米波雷达制导导弹波束窄的特点,采用投放多枚诱饵弹以组成诱饵阵的对抗方法。初步建立了对抗过程仿真的数学模型,并通过该模型对对抗过程进行了仿真分析。分析表明,如果依据形势合理布放诱饵,将会对目标起到很好的保护作用。     

在排球比赛中双人拦网时吊球技术的运用

现代排球技战术的飞速发展,运动员的不断＂身高化＂使得排球比赛的网上对抗异常激烈,当主、副攻位置遭到拦网的阻挠而不能有效的扣球时,积极合理的采用排球吊球技术可以达到扣球同样效果,所以在平时的训练和比赛中要重视排球吊球在比赛中起到的作用。     

Nonperiodic preventive maintenance for repairable systems

As a complex system with multiple components usually deteriorates with age, preventive maintenance (PM) is often performed to keep the system functioning in a good state to prolong its effective age. In this study, a nonhomogeneous Poisson process with a power law failure intensity is used to describe the deterioration of a repairable system, and the optimal nonperiodic PM schedule can be determined to minimize the expected total cost per unit time. However, since the determination of such optimal PM policies may involve numerous uncertainties, which typically make the analyses difficult to perform because of the scarcity of data, a Bayesian decision model, which utilizes all available information effectively, is also proposed for determining the optimal PM strategies. A numerical example with a real failure data set is used to illustrate the effectiveness of the proposed approach. The results show that the optimal schedules derived by Bayesian approach are relatively more conservative than that for non‐Bayesian approach because of the uncertainty of the intensity function, and if the intensity function are updated using the collected data set, which indicates more severe deterioration than the prior belief, replacing the entire system instead of frequent PM activities before serious deterioration is suggested. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010