A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

载体干扰磁场补偿方法

获得载体航行路径上各点地磁场的精确测量值是地磁匹配导航的前提,而载体上各种干扰磁场的存在会引起磁力仪输出的偏差,影响匹配的精度,因此必须对载体干扰磁场进行补偿。在分析载体干扰磁场特性的基础上,提出利用矢量测量值对地磁场总场值进行补偿的方法。该方法首先根据矢量磁力仪的测量模型得到关于载体磁场参数的非线性方程,然后采用非线性参数估计方法估计出精确的载体干扰磁场系数,最后再利用估计结果对测量值进行补偿。通过仿真对该方法的有效性进行研究,并设计了半实物实验对其实用性进行验证。结果表明采用本文提出的方法补偿后地磁场总场值的测量误差在20nT以内,而且该方法参数估计精度高,应用方便,可以有效地对导航载体干扰磁场进行补偿。     

基于云分类器的液体火箭发动机故障诊断方法

本文首先将液体火箭发动机故障诊断问题转化为故障特征的模式分类问题,然后针对当前模式分类方法难以处理不确定性信息、属性特征空间的划分过硬等缺陷,结合云模型和云变换研究,提出了一种基于云分类器的液体火箭发动机起动过程故障诊断方法。历次试车数据的验证结果表明,该方法能够及时准确识别发动机起动工作过程中的故障模式。     

一种对时钟偏差不敏感的无源RFID标签编解码算法

基于我国自主射频识别空中接口协议GJB 7377.1-2011,提出了一种对时钟偏差不敏感的无源RFID标签编解码算法。该算法充分考虑了时钟频率偏差、计数误差、分频误差等对编解码的影响,推导出了标签正确编解码所需的时钟约束条件,并得到了标签编解码的基本思路和方法。仿真结果表明,提出的编解码算法对标签时钟精度要求较低,只要时钟频率大于1.60 MHz,即可满足要求,大大降低了硬件实现的难度和复杂度,与同类实现方式相比,功耗降低了近50%。     

封装对螺旋线圈发射器互感梯度的影响

互感梯度是决定线圈炮加速力的主要因素。本文以螺旋线圈炮为例,建立了计算互感梯度的二维有限元模型,对四种不同属性的封装材料和封装尺寸对互感梯度的影响做出了分析和比较,并给出了不同的封装材料及尺寸下封装的电流密度和磁场分布图。分析表明,互感梯度受到封装材料电导率和磁导率的双重制约。电导率决定了封装中感应涡流的大小;磁导率决定了对磁场的加强程度。减小封装与线圈的间距,导磁材料的磁场加强效果更好,而导电材料的涡流效应也更明显;增加封装的厚度,导磁材料可以更好地增强磁场,但导电材料由于电阻更小涡流效应更明显。为了实现互感梯度的最大化,可以在减小封装与驱动线圈间距并增加封装厚度的情况下使用高磁导率的硅钢片制作封装,硅钢片的厚度应该尽量小从而削弱涡流效应。     

半预制破片PELE弹丸对武装直升机毁伤效能

为研究半预制破片PELE弹丸对武装直升机的毁伤效能,选取代表性的阿帕奇武装直升机为研究对象,建立了阿帕奇武装直升机关键部件驾驶舱和发动机舱的等效模型,在此基础上应用ANSYS/LS-DYNA就半预制破片PELE弹丸对阿帕奇武装直升机的毁伤效能进行了数值分析.结果表明:半预制破片PELE弹丸能有效穿透阿帕奇武装直升机的防护装甲,在穿透防护靶后弹丸壳体大面积碎裂,产生大量具有较高轴向剩余速度和一定径向飞散速度的破片,形成一个大面积的破片场,这些破片及弹丸剩余部分可对武装直升机内部人员及仪器设备造成有效毁伤,极大地增强了PELE弹丸的毁伤效能.     

A LONG‐RUN ANALYSIS OF DEFENCE SPENDING IN THE NATO COUNTRIES (1960–99)

This paper analyses the long‐run demand for defence output through a homogeneous treatment of 15 NATO member countries between 1960 and 1999. We carry out a progressive study of the interactions between either defence spending or defence burden and their main determinants: income, external threat and allied military spending. To that end, we use time‐series analysis with endogenously determined structural breaks. We further consider individual country functions related to one another through a common correlated effects method, in order to take into account explicitly the connections between members of an alliance.     

改进的笛卡尔遗传编程组合电路演化设计

利用笛卡尔遗传编程进行电路演化时,存在收敛速度慢、收敛时间波动较大等问题．对笛卡尔遗传编程中的可编程单元模型进行改进,增加与目标函数相关的逻辑运算,去除无关的逻辑运算,从而提高演化算法命中目标的概率．利用改进的笛卡尔遗传编程方法分别对电机换相电路和乘法器等组合电路进行演化设计．结果表明,改进后的方法明显缩短了电路演化生成的时间,且收敛时间波动较小．     

A mathematical formulation and efficient heuristics for the dynamic container relocation problem

The container relocation problem (CRP) is concerned with emptying a single yard‐bay which contains J containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. The CRP can be modeled as a binary integer programming (IP) problem and is known to be NP‐hard. In this work, we focus on an extension of the CRP to the case where containers are both received and retrieved from a single yard‐bay, and call it the dynamic container relocation problem. The arrival (departure) sequences of containers to (from) the yard‐bay is assumed to be known a priori. A binary IP formulation is presented for the problem. Then, we propose three types of heuristic methods: index based heuristics, heuristics using the binary IP formulation, and a beam search heuristic. Computational experiments are performed on an extensive set of randomly generated test instances. Our results show that beam search heuristic is very efficient and performs better than the other heuristic methods.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 101–118, 2014