石化企业设置火灾事故应急水池的必要性及容量计算

简要阐述了石化企业设置火灾事故情况下事故应急水池的必要性,并对事故应急水池的计算方法进行分析,最后结合工程实例进行容量计算,对同类的设计提供一定的参考。     

自动化电弧喷涂路径偏移间距的优化模型

基于电弧喷涂沉积丘的轮廓呈高斯分布的假设,并结合实验结果,建立了电弧喷涂沉积丘轮廓的数学模型,由此推导出了自动化喷涂过程中平行路径偏移间距这一重要参量的优化模型。该模型为合理规划自动化喷涂的路径提供了依据。     

反辐射无人机在电子战中的应用及其效能分析

简要讨论了反辐射无人机系统的组成和两种典型的反辐射无人机,指出了其在电子战中的应用。并针对某型反辐射无人机的系统能力,即命中概率和毁伤概率进行了理论分析和计算。     

一类带配送中心运输问题的容量扩张模型研究

运输问题一般采用表上作业法来解决,考虑一类带配送中心的运输问题,若仍采用表上作业法,会使问题复杂化.文中采用一种构造辅助网络的方法:在运输网络中将每个配送中心均拆分成两个点,连接两点形成新弧,构造出新的网络,并给每条弧赋予参数,将此类运输问题转换为最小费用流模型来解决,可以使问题模型和运算简单化.在此基础上,考虑运输网络中配送中心和边的容量扩张问题.     

新型钢-混凝土组合板的力学性能研究

以加劲肋形式、组合板厚度和栓钉布置为参数,进行了9块新型组合板的力学性能试验.试验结果表明,组合板的正截面承载力可按基于修正平截面假定的极限状态计算;组合板的跨中挠度,可在按现行规范计算的基础上,加上考虑界面滑移影响的附加变形值予以修正.     

Aircraft routing under the risk of detection

The deterministic problem for finding an aircraft's optimal risk trajectory in a threat environment has been formulated. The threat is associated with the risk of aircraft detection by radars or similar sensors. The model considers an aircraft's trajectory in three‐dimensional (3‐D) space and represents the aircraft by a symmetrical ellipsoid with the axis of symmetry directing the trajectory. Analytical and discrete optimization approaches for routing an aircraft with variable radar cross‐section (RCS) subject to a constraint on the trajectory length have been developed. Through techniques of Calculus of Variations, the analytical approach reduces the original risk optimization problem to a vectorial nonlinear differential equation. In the case of a single detecting installation, a solution to this equation is expressed by a quadrature. A network optimization approach reduces the original problem to the Constrained Shortest Path Problem (CSPP) for a 3‐D network. The CSPP has been solved for various ellipsoid shapes and different length constraints in cases with several radars. The impact of ellipsoid shape on the geometry of an optimal trajectory as well as the impact of variable RCS on the performance of a network optimization algorithm have been analyzed and illustrated by several numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Capacity allocation with traditional and Internet channels

In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

An EOQ model with multiple suppliers and random capacity

We consider an EOQ model with multiple suppliers that have random capacities, which leads to uncertain yield in orders. A given order is fully received from a supplier if the order quantity is less than the supplier's capacity; otherwise, the quantity received is equal to the available capacity. The optimal order quantities for the suppliers can be obtained as the unique solution of an implicit set of equations in which the expected unsatisfied order is the same for each supplier. Further characterizations and properties are obtained for the uniform and exponential capacity cases with discussions on the issues related to diversification among suppliers. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

数据链规划问题的贪心算法

数据链是一种汇集通信、导航和识别的综合化战场信息系统。为了保证在960～1215MHz频段工作的各类设备的电磁兼容,数据链的使用必须符合操作约束和协调约束,必须在满足各类约束条件下,根据数据链的作战需求实现网络规划。首先分析了数据链存在的典型约束,在此基础上对数据链规划问题建模并提出了一种数据链规划的贪心算法,算法较好地解决了数据链规划问题。