A bivariate optimal replacement policy for a cold standby repairable system with repair priority

In this article, an optimal replacement policy for a cold standby repairable system consisting of two dissimilar components with repair priority is studied. Assume that both Components 1 and 2, after repair, are not as good as new, and the main component (Component 1) has repair priority. Both the sequence of working times and that of the components'repair times are generated by geometric processes. We consider a bivariate replacement policy (T,N) in which the system is replaced when either cumulative working time of Component 1 reaches T, or the number of failures of Component 1 reaches N, whichever occurs first. The problem is to determine the optimal replacement policy (T,N)* such that the long run average loss per unit time (or simply the average loss rate) of the system is minimized. An explicit expression of this rate is derived, and then optimal policy (T,N)* can be numerically determined through a two‐dimensional‐search procedure. A numerical example is given to illustrate the model's applicability and procedure, and to illustrate some properties of the optimal solution. We also show that if replacements are made solely on the basis of the number of failures N, or solely on the basis of the cumulative working time T, the former class of policies performs better than the latter, albeit only under some mild conditions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A nested benders decomposition approach for telecommunication network planning

Despite its ability to result in more effective network plans, the telecommunication network planning problem with signal‐to‐interference ratio constraints gained less attention than the power‐based one because of its complexity. In this article, we provide an exact solution method for this class of problems that combines combinatorial Benders decomposition, classical Benders decomposition, and valid cuts in a nested way. Combinatorial Benders decomposition is first applied, leading to a binary master problem and a mixed integer subproblem. The subproblem is then decomposed using classical Benders decomposition. The algorithm is enhanced using valid cuts that are generated at the classical Benders subproblem and are added to the combinatorial Benders master problem. The valid cuts proved efficient in reducing the number of times the combinatorial Benders master problem is solved and in reducing the overall computational time. More than 120 instances of the W‐CDMA network planning problem ranging from 20 demand points and 10 base stations to 140 demand points and 30 base stations are solved to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于神经网络的某扫雷犁电液伺服系统建模与控制

扫雷犁电液伺服系统是一类复杂非线性系统,基于传统建模方法构造的线性模型难以反映系统的本质非线性特征,因此提出采用基于正交最小二乘法的径向基函数神经网络对该系统进行精确建模;已有的手动分级控制或传统的PID控制方式不能满足精确控制的战术要求,提出采用基于广义训练和专门训练相结合的神经网络直接逆控制方法,实现系统吃土深度的有效控制。实验仿真结果以及与其他建模和控制方法的比较,验证了提出方法的有效性。     

鸭舵-阻力环复合控制火箭弹制导方法

针对远程火箭弹落点散布大的问题,探讨了一种以鸭舵实现火箭弹姿态稳定,并采用阻力机构进行纵向散布修正的复合控制方法。提出并分析了简易制导系统方案,建立了鸭舵-阻力环复合控制条件下的有控弹道模型,对启控点参数进行了合理设计。仿真结果表明,该制导方法能够有效地抑制由各种扰动因素引起的技术散布,可大幅提高远程火箭弹的射击精度。     

一种海上编队通信的反干扰效能评估方法

针对海上编队通信反干扰效能评估问题,建立了海上编队通信反干扰效能评估指标体系。利用直觉模糊集描述评估指标值,基于熵的物理意义采用模糊熵在指标权重完全未知的情况下求取指标权重,利用同时考虑指标权重和位置权重的IFHA算子集结指标信息,提供效能评估方法,并利用直觉模糊数排序方法比较待评估方案优劣,对方法进行了实例分析。所提供的方法很大程度克服了评估过程中主观因素的影响,对研究类似问题具有借鉴意义。     

Inventory control under substitutable demand: A stochastic game application

Substitutable product inventory problem is analyzed using the concepts of stochastic game theory. It is assumed that there are two substitutable products that are sold by different retailers and the demand for each product is random. Game theoretic nature of this problem is the result of substitution between products. Since retailers compete for the substitutable demand, ordering decision of each retailer depends on the ordering decision of the other retailer. Under the discounted payoff criterion, this problem is formulated as a two‐person nonzero‐sum stochastic game. In the case of linear ordering cost, it is shown that there exists a Nash equilibrium characterized by a pair of stationary base stock strategies for the infinite horizon problem. This is the unique Nash equilibrium within the class of stationary base stock strategies. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 359–375, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10018     

Detection of a Markovian target with optimization of the search efforts under generalized linear constraints

This paper deals with search for a target following a Markovian movement or a conditionally deterministic motion. The problem is to allocate the search efforts, when search resources renew with generalized linear constraints. The model obtained is extended to resource mixing management. New optimality equations of de Guenin's style are obtained. Practically, the problem is solved by using an algorithm derived from the FAB method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 117–142, 2002; DOI 10.1002/nav.10009     

配电教学训练仿真系统研究与开发

介绍了通过硬件仿真和软件编程实现配电器功能的原理和方法,并通过系统设计方案论证及硬件设计实现了对配电教学训练仿真系统的开发,提出了通过串行通信与PC机通信及在原有系统的基础上进行功能扩展来实现系统升级扩展的方法;软件设计采用去除冗余设计和软件仿真两次简化的模型,由控制软件对系统状态进行控制,节点状态由程序中的状态变量所体现,人机交互软件接收指令数据,并输出至主控计算机.     

从一介书生到伟大的军事家——对毛泽东成为伟大军事家的原因分析

毛泽东是世界上最杰出的军事家之一.然而,青年时代的毛泽东并没有想到要去搞军事,更没有想要成为一位伟大的军事家,其最大的愿望,一是当个教员,二是当一名新闻记者.1921年初,毛泽东在新民学会讨论"会员个人生活方法"时,表示:"我可愿做的工作:一教书,一新闻记者,将来多半要赖这两项工作的月薪来生活."(<毛泽东传(1893-1949年)>上,73页,北京,中央文献出版社,1996)后来,毛泽东又回忆说:"我搞过国民革命军政治部的宣传工作,在农民运动讲习所也讲过打仗的重要,可就是从来没有想到自己去搞军事,要去打仗."     

Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine

This paper tackles the general single machine scheduling problem, where jobs have different release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is first introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed‐integer linear programming formulation. By relaxing some constraints, a Lagrangean relaxation algorithm is designed which gives both lower and upper bounds. The special case where jobs have equal weights is analyzed. Computational results are presented and, although the duality gap becomes larger with the number of jobs, it is possible to solve problems of more than 100 jobs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003