Integrating decisions with advance supply information in an assemble-to-order system

We study a periodic-review assemble-to-order (ATO) system with multiple components and multiple products, in which the inventory replenishment for each component follows an independent base-stock policy and stochastic product demands are satisfied according to a First-Come-First-Served rule. We assume that the replenishment for various component suffers from lead time uncertainty. However, the decision maker has the so-called advance supply information (ASI) associated with the lead times and thus can take advantage of the information for system optimization. We propose a multistage stochastic integer program that incorporates ASI to address the joint optimization of inventory replenishment and component allocation. The optimal base-stock policy for the inventory replenishment is determined using the sample average approximation algorithm. Also, we provide a modified order-based component allocation (MOBCA) heuristic for the component allocation. We additionally consider a special case of the variable lead times where the resulting two-stage stochastic programming model can be characterized as a single-scenario case of the proposed multistage model. We carry out extensive computational studies to quantify the benefits of integrating ASI into joint optimization and to explore the possibility of employing the two-stage model as a relatively efficient approximation scheme for the multistage model.     

基于随机Petri网的装甲车辆综合电子系统可靠性研究

由于装甲车辆综合电子系统具有耦合性强、动态离散和复杂度高的特点,其难以采用静态故障树方法进行系统可靠性分析,针对这一难题,运用动态故障树方法对系统可靠性进行了分析判别,并运用随机Petri网建立了故障树的仿真模型。以某型车辆为例,通过仿真实验得出了综合电子系统的故障率和可用度指标的动态变化曲线,其分析结果为系统可靠性与测试性设计提供了理论参考。     

射线追踪法应用于传播预测的研究

近年来,随着射线追踪法的发展,利用精确的3维数字地图,使精确的电波传播预测成为现实。但是这种方法有很大的缺陷,文中从现阶段城市3维地图建立现状和控制成本的角度考虑,探索了结合射线追踪技术和传统电波传播预测方法,借助计算机辅助设计分析,实现传播覆盖预测的一种新方法,并尝试实现了一个工程案例,进行了相关分析。     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

军用车辆行动部分疲劳寿命随机有限元分析

阐述了基于随机有限元的车辆行动部分可靠性原理及基本过程,将结构件的弹性模量、泊松比和几何尺寸等因素定义为随机场,并对其进行离散,同时分析了车辆行驶的典型路面的路面谱,利用随机有限元求解在不同的路面状况下车辆行动零部件的受力情况,得到了零部件危险点应力的随机分布和不同路面状况下疲劳可靠性,并对相关的实例进行分析。     

Information security: Designing a stochastic‐network for throughput and reliability

Todas information and communication network requires a design that is secure to tampering. Traditional performance measures of reliability and throughput must be supplemented with measures of security. Recognition of an adversary who can inflict damage leads toward a game‐theoretic model. Through such a formulation, guidelines for network designs and improvements are derived. We opt for a design that is most robust to withstand both natural degradation and adversarial attacks. Extensive computational experience with such a model suggests that a Nash‐equilibrium design exists that can withstand the worst possible damage. Most important, the equilibrium is value‐free in that it is stable irrespective of the unit costs associated with reliability vs. capacity improvement and how one wishes to trade between throughput and reliability. This finding helps to pinpoint the most critical components in network design. From a policy standpoint, the model also allows the monetary value of information‐security to be imputed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Optimal allocation of minimal repairs in parallel and series systems

In reliability engineering, the concept of minimal repair describes that the repair brings the failed unit (eg, system or component) to the situation which is same as it was just before the failure. With the help of the well‐known Gamma‐Poisson relationship, this paper investigates optimal allocation strategies of minimal repairs for parallel and series systems through implementing stochastic comparisons of various allocation policies in terms of the hazard rate, the reversed hazard rate, and the likelihood ratio orderings. Numerical examples are presented to illustrate these findings as well. These results not only strengthen and generalize some known ones in the seminal work of Shaked and Shanthikumar, but also solve the open problems proposed by Chahkandi et al.'s study and Arriaza et al.'s study.     

弹性BP神经网络消除轮速传感器误差方法的研究

汽车轮速是汽车运动状态参数的主要信息源,是控制系统的核心,其精度直接影响这些系统的性能.为了提高轮速的精度,降低传感器的研制成本,提出了一种基于弹性BP神经网络的误差分析方法消除轮速传感器误差.将改进的BP神经网络--弹性BP神经网络用于误差分析,并提出误差匹配的算法.理论和仿真结果表明,该方法使绝对误差达到2×10-4>rad,能够有效地消除传感器误差,提高轮速信号的精度.     

关于半鞅向量随机积分的两个结果

首先利用半鞅Girsanov定理与闭图像定理证明了:若{Xn}是带滤基的完备概率空间(Ω,F,F,P)中的一列半鞅,其中滤基F=(Ft)t≥0满足通常条件,且{Xn}在关于P的Emery拓扑空间中收敛于X,则当概率测度Q相似文献