无人机的协同侦察航路规划

无人机将成为侦察卫星、有人驾驶侦察机的重要补充与增强手段 ,成为未来战场上广泛应用的一种侦察工具。为了提高无人机 (U AV)的侦察效率 ,在执行侦察任务前必需规划设计出高效的无人机侦察飞行航路。针对这一问题 ,提出了一种侦察效率指标评估的计算方法 ,解决了航路规划中的侦察效率量化问题。考虑在大范围任务区域内进行侦察航路优化存在计算的复杂性和收敛等问题 ,采用遗传算法对侦察航路进行了优化处理。通过该方法得到的侦察航路可以有效地提高无人机的侦察效率。     

一种有效的常规雷达目标识别方法

基于小波变换和进化网络提出一种有效的常规雷达目标识别方法。即首先利用 Mallat算法对雷达目标一维距离像进行特征提取和压缩 ,然后在进化规划的基础上提出一种混合进化算法来优化设计由多层前向网络构成的分类器。实验结果表明 ,整个目标识别系统的结构简单 ,同时具有较好的推广能力     

基于遗传算法的涡轮增压器叶轮优化设计

提出了一种基于遗传优化理论的涡轮增压器叶轮的优化设计方法,论述了以涡轮增压器叶轮能量损失最小为目标函数,以叶轮叶片进口角、进口直径、进口宽度、出口直径、叶片数、出口角为设计变量的涡轮增压器叶轮的优化设计模型及优化计算的方法,数值计算表明,这种算法可以方便地求得具有最小涡轮损失的涡轮叶形参数.     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

防空导弹武器系统目标分配的多种算法

叙述了防空导弹武器系统目标分配的一般数学模型。在此基础上,建立了防空导弹的5种目标分配数学优化算法,并讨论了数学模型的求解问题。最后,对这5种数学优化算法进行了比较。     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

多级可修备件库存的生灭过程建模与优化

针对VARI-METRIC模型在低可用度下结果不准确的问题,建立基于生灭过程的任意等级、任意层级可修件库存优化模型。通过对各级站点、各类备件需求率与到达率的预测,对每个部件建立其生灭过程模型,并提出基于生灭过程的装备可用度计算方法。以整个保障系统的装备可用度为约束指标,以备件总购置费最低为目标,利用边际算法得到最优备件配置方案,并建立仿真模型对所得优化方案进行评估与调整。结合算例,以仿真结果作为检验标准,选取权威的VMETRIC软件与该解析模型在优化性能、计算精度及适用性上进行对比和说明。结果表明,无论是解析模型还是VMETRIC软件,均存在一定的适用范围,而采用解析与仿真相结合的方法无疑具有更强的适应性。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000     

Optimal (τ, T) opportunistic maintenance of a k‐out‐of‐n:G system with imperfect PM and partial failure

The opportunistic maintenance of a k‐out‐of‐n:G system with imperfect preventive maintenance (PM) is studied in this paper, where partial failure is allowed. In many applications, the optimal maintenance actions for one component often depend on the states of the other components and system reliability requirements. Two new (τ, T) opportunistic maintenance models with the consideration of reliability requirements are proposed. In these two models, only minimal repairs are performed on failed components before time τ and the corrective maintenance (CM) of all failed components are combined with PM of all functioning but deteriorated components after τ; if the system survives to time T without perfect maintenance, it will be subject to PM at time T. Considering maintenance time, asymptotic system cost rate and availability are derived. The results obtained generalize and unify some previous research in this area. Application to aircraft engine maintenance is presented. © 2000 John Wiley & Sons;, Inc. Naval Research Logistics 47: 223–239, 2000