On the (S-1, S) inventory model under compound poisson demands and i.i.d. unit resupply times

We analyze an (S-1, S) inventory model with compound Poisson demands. Resupply times for individual units are independent and identically distributed. Such a model can also be characterized as an M^X/G/∞ queue. We derive expressions of performance measure such as the steady-state distribution and the expectation of the number of backlogged units. In addition, numerical examples are included to reflect the effects of i.i.d. unit resupply times. © 1996 John Wiley & Sons, Inc.     

舰艇编队防空火力区划分方法研究

通过分析水面舰艇编队内各平台防空火力区,建立了编队防空火力区模型,提出并对比了两种不同的防空火力重叠区划分方法。对基本队形和复杂队形的编队进行了防空火力区划分仿真,仿真结果验证了火力区划分方法的有效性,可为编队协同作战指挥决策提供基础。     

模糊需求下保障设施选址-路径模型及算法

针对装备保障过程中被保障单位需求量不确定的问题,在详细分析保障设施选址-路径相关因素的基础上,利用三角模糊数对需求量进行标定。通过运用模糊综合评价与群决策思想确定保障设施备选址点权重,构建时间满意度函数与惩罚成本函数,建立模糊需求下带有时间窗及容量限制的选址-路径模型,并设计了基于聚类分析与蚁群算法的混合启发式求解算法。通过算例分析验证了模型的正确性及算法的有效性。     

Supply chain coordination with product line design and a revenue sharing scheme

Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it.     

Mean residual life of coherent systems consisting of multiple types of dependent components

Mean residual life is a useful dynamic characteristic to study reliability of a system. It has been widely considered in the literature not only for single unit systems but also for coherent systems. This article is concerned with the study of mean residual life for a coherent system that consists of multiple types of dependent components. In particular, the survival signature based generalized mixture representation is obtained for the survival function of a coherent system and it is used to evaluate the mean residual life function. Furthermore, two mean residual life functions under different conditional events on components’ lifetimes are also defined and studied.     

制导航空子母炸弹高速抛撒分离数值仿真

制导航空子母炸弹在跨音速抛撒子弹药过程中,子弹药与母弹的分离伴随着复杂的流场和激波干扰,该过程中不仅存在着激波与激波的相互碰撞、部分激波的多次反射,而且由于受到多体运动的相互作用,其气流方向也发生变化,形成了变化复杂的压力、速度分布区域。采用数值模拟的方法对制导航空子母炸弹子弹药高速抛撒分离过程进行了数值仿真分析,应用嵌套网格技术,耦合多体动力学方程以及 N－S 方程求解子母炸弹高速分离过程,为工程设计、研究提供理论指导与计算依据。     

基于VR与PNN相结合的机电液控制系统故障诊断方法

针对大型复杂机电液控制系统故障诊断中存在的数学模型获取困难、历史故障数据匮乏问题,提出了一种将虚拟样机与概率神经网络相结合的故障诊断混合方法。建立系统的虚拟样机,并对其可信性进行校核与验证。在此基础上进行大量随机性故障植入与仿真实验,获取故障仿真数据。经过特征提取与概率神经网络模式识别训练,形成用于诊断的知识库,从而实现故障诊断。以操舵系统作为研究案例,得到了较高的故障检测和隔离精度与较低的虚警及漏警率,验证了该方法的可行性,为大型复杂机电液控制系统故障诊断提供新的思路。     

地理信息系统专业实践教学体系研究

实践教学是GIS专业教学至关重要的环节。结合GIS知识体系结构、专业特点和社会需求,讨论了GIS专业实践教学体系的基本框架及其依托。     

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     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010