高超声速滑翔飞行器滑翔段初始状态的唯一性和最优性分析

临近空间高超声速滑翔飞行器的弹道特性主要受滑翔段初始状态和飞行器控制律影响。在飞行器控制律确定的情况下,研究了滑翔段初始状态对高超声速滑翔飞行器弹道特性的影响规律。按照滑翔弹道的不同形式,在纵向平衡滑翔条件下,通过理论推导得出飞行器状态变量的解析式,结合平衡滑翔条件分析平衡滑翔弹道滑翔段初始状态的唯一性;在纵向跳跃滑翔条件下,构建弹道性能评价指标,利用群智能算法,寻找弹道性能最优时的滑翔段初始状态。利用单因素敏感性分析方法,分别对两种滑翔弹道的滑翔段初始状态进行敏感性分析,初始状态中初始速度对弹道特性的影响最大。对高超声速滑翔飞行器初始状态唯一性与最优性的分析,可为高超声速滑翔飞行器的弹道设计、弹道跟踪、轨迹预测和轨迹优化提供借鉴。     

面向多最优解组合优化问题的决策求解算法

针对具有固定物品总和、多最优解特征的组合优化问题,以固定总和实数子集问题和购买鸡翅问题为例,给出了这类多最优解组合优化问题的形式化表示。在分析枚举等经典算法基础上,提出了基于整数状态表示和实数状态表示的0-1决策递归搜索多最优解动态规划算法。针对该算法在最优解数量较大时,时间复杂度趋向O(mⁿ)的问题,提出了基于相同决策路径合并和基于0-x决策的两种改进算法。实验中两种改进算法的计算时间基本符合与O(nb+nm)的正比关系,表明对于这类多最优解组合优化问题具有良好的求解性能。     

织女一号气象火箭设计中的若干技术

织女一号气象火箭是一种小型无控固体火箭,由于采用了若干先进的技术,使其总体性能达到了国际先进水平。本文介绍了其总体性能,重点介绍了总体方案设计中采用的包括最优推力程序等若干先进技术。     

ATIE:一种自适应的可调域间出口选择算法

TIE算法能对域间出口的选择进行调节,但是该算法的参数计算过于复杂,并且出口选择的调节并不能随负载的变化而变化,因此提出了一种自适应的可调域间出口选择算法ATIE,该算法能够满足流量工程和网络健壮性要求,并通过参数T的改变随当前负载的变化而变化.实验表明,ATIE算法能够在控制剖面敏感性和随负载变化的流量工程自适应性上达到合理的折衷.     

基于灰色决策原理的导弹核武器最佳配置模型

核武器是国家军事战略的基石,其配置的合理性直接影响核力量作战运用的成效.分析了影响导弹核武器配置的因素,将导弹核武器划分为平时和战时两种状态,构建了导弹核武器最佳配置的灰色规划模型计算结果验证了模型的正确性.研究表明:基于灰色规划原理构建的最佳配置模型在解的稳定性、模型的适应性上要优于同类线性规划模型.核武器最佳配置问题一直是核作战运用研究的重要内容.研究成果可为导弹武器的订购、存贮、阵地配置及作战运用提供理论决策依据.     

C3I时隙分配优化设计

用线性规划方法讨论了Ｃ３Ｉ通信网络中时隙分配的优化设计问题     

Dynamic routing of prioritized warranty repairs

Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

The parallel replacement problem with demand and capital budgeting constraints

A generalized parallel replacement problem is considered with both fixed and variable replacement costs, capital budgeting, and demand constraints. The demand constraints specify that a number of assets, which may vary over time, are required each period over a finite horizon. A deterministic, integer programming formulation is presented as replacement decisions must be integer. However, the linear programming relaxation is shown to have integer extreme points if the economies of scale binary variables are fixed. This allows for the efficient computation of large parallel replacement problems as only a limited number of 0–1 variables are required. Examples are presented to provide insight into replacement rules, such as the “no‐splitting‐rule” from previous research, under various demand scenarios. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 40–56, 2000     

战役野战油库油料输送力量优化分配研究

如何科学、合理分配战役野战油库油料输送力量是战时油料保障必须面临的一个实际问题。首先根据战役野战油库运油车分配模型得到一个运油车初始分配方案,然后运用计算机模拟技术对分配方案进行模拟,并根据模拟结果不断调整,直至得到优化的分配方案,为制定战役野战油库油料输送计划提供决策依据。     

Resource allocation in an asymmetric technology race with temporary advantages

We consider two opponents that compete in developing asymmetric technologies where each party's technology is aimed at damaging (or neutralizing) the other's technology. The situation we consider is different than the classical problem of commercial R&D races in two ways: First, while in commercial R&D races the competitors compete over the control of market share, in our case the competition is about the effectiveness of technologies with respect to certain capabilities. Second, in contrast with the “winner‐takes‐all” assumption that characterizes much of the literature on this field in the commercial world, we assume that the party that wins the race gains a temporary advantage that expires when the other party develops a superior technology. We formulate a variety of models that apply to a one‐sided situation, where one of the two parties has to determine how much to invest in developing a technology to counter another technology employed by the other party. The decision problems are expressed as (convex) nonlinear optimization problems. We present an application that provides some operational insights regarding optimal resource allocation. We also consider a two‐sided situation and develop a Nash equilibrium solution that sets investment values, so that both parties have no incentive to change their investments. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 128–145, 2012