关于A-增生算子的广义变分包含的Mann-型迭代算法

通过研究A-增生算子的性质,延伸了关于H-增生算子的预解算子概念到新的A-增生算子。通过进一步运用A-增生算子的预解算子技巧,考虑了一类新的关于A-增生算子的广义变分包含,并提出了一种Mann-型迭代算法来逼近此类广义变分包含的解。最后证明了新的一类广义变分包含解的存在性和唯一性,并讨论了由此Mann-型迭代算法产生的迭代序列的收敛特征。     

末制导段比例导引法的改进

为了消除比例导引法末制导段的各种干扰因素,抑制法向过载的跳动,基于广义卡尔曼滤波多步估计理论,提出了将拦截导弹直接向瞬时遭遇点导引的末制导导引方法,并进行了计算机仿真.仿真结果表明,该方法可以明显消除或减小末制导段比例导引律的各种干扰因素,抑制法向过载的跳动,改善末制导的弹道特性,减小脱靶量,缩短拦截时间.     

装甲装备使用可用度与维修保障费用的优化模型

维修保障费用是影响装甲装备使用可用度的重要因素之一。要在有限的保障经费下实现高可用度要求,就必须建立装甲装备的使用可用度与维修保障费用的优化模型。根据装甲装备实际维修特点,在分析装甲装备预防性维修过程中故障类型多样的基础上,构建了装甲装备在给定维修周期内的使用可用度模型和维修保障费用模型,进而建立了使用可用度与维修保障费用的优化模型,提出了模型的解法和模型的改进建议。     

广义Liénard方程Poincaré分岔极限环的唯一性和不存在性

讨论了一类广义Linard方程x¨+f1(x)x.2+εf2(x)x.+g(x)=0的Poincar分岔极限环的唯一性和不存在性。将不对Abel积分进行分项,而是利用一阶Mel′nikov函数直接从整体上进行分析讨论,得出了若干判别准则和充分条件。     

灰色局势决策理论在炮兵火力计划优选中的运用

为了解决炮兵火力计划选择的随意性和盲目性,提出了以灰色理论为基础,综合考虑炮兵火力计划的性质和拟制原则的优选方法;深入研究了局势决策在计划优选中的应用;最后举例说明了灰色局势决策理论在计划优选中的应用,进一步证明了其科学性和创新性,为优选决策提供了一种定量和定性相结合的新方法。     

A novel modeling approach for express package carrier planning

Express package carrier networks have large numbers of heavily‐interconnected and tightly‐constrained resources, making the planning process difficult. A decision made in one area of the network can impact virtually any other area as well. Mathematical programming therefore seems like a logical approach to solving such problems, taking into account all of these interactions. The tight time windows and nonlinear cost functions of these systems, however, often make traditional approaches such as multicommodity flow formulations intractable. This is due to both the large number of constraints and the weakness of the linear programming (LP) relaxations arising in these formulations. To overcome these obstacles, we propose a model in which variables represent combinations of loads and their corresponding routings, rather than assigning individual loads to individual arcs in the network. In doing so, we incorporate much of the problem complexity implicitly within the variable definition, rather than explicitly within the constraints. This approach enables us to linearize the cost structure, strengthen the LP relaxation of the formulation, and drastically reduce the number of constraints. In addition, it greatly facilitates the inclusion of other stages of the (typically decomposed) planning process. We show how the use of templates, in place of traditional delayed column generation, allows us to identify promising candidate variables, ensuring high‐quality solutions in reasonable run times while also enabling the inclusion of additional operational considerations that would be difficult if not impossible to capture in a traditional approach. Computational results are presented using data from a major international package carrier. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Optimal sensor placement for underwater threat detection

The optimization framework for optimal sensor placement for underwater threat detection has been developed. It considers single‐period and multiperiod detection models, each of which includes two components: detection algorithm and optimization problem for sensor placement. The detection algorithms for single‐period and multiperiod models are based on likelihood ratio and sequential testing, respectively. For the both models, the optimization problems use the principle of superadditive coverage, which is closely related to energy‐based and information‐based approaches. An algorithm for quasi‐regular sensor placement approximating solutions to the optimization problems has been developed based on corresponding continuous relaxations and a criterion for its applicability has been obtained. Numerical experiments have demonstrated that the algorithm consistently outperforms existing optimization techniques for optimal sensor placement.© 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种分析广义脊形传输器件的新型数值方法

利用Compact 2-D频域有限差分(FDFD)法分析广义脊形传输器件特性,得到的本征方程只涉及4个横向场分量,与同时处理6个场分量的本征问题相比,大大降低了CPU时间,同时由给定的工作频率f求解相移常数β,易于实际应用.针对广义脊形传输器件的复杂结构,本文划分了不同的子区.几种代表性的脊形波导传输结构分析结果与其他方法一致,表明了本文分析思路的可行性.     

航天器交会型轨道追逃策略的滚动时域优化

针对航天器自由时域交会型轨道追逃过程中的测量误差等不确定性对交会的影响,提出了一种基于滚动时域优化的高时效策略求解方法。根据微分对策理论推导得到博弈鞍点控制策略,并对问题进行等价转换;通过预先离线求解开环鞍点策略,将问题初始状态和相应的解作为样本以进行神经网络训练,训练后的网络结构可以快速得到相应问题的近似解。为了更好地应对博弈环境中的测量噪声,基于神经网络结构设计了滚动时域求解框架,并通过周期性的滚动求解最终实现对逃逸航天器的交会。数值仿真表明,所提出的策略可以有效应对测量噪声不确定性,且相比于文献中已有的策略,计算耗时可从分钟级降至秒级。