基于BPAF判决的决策层目标属性融合研究

在D-S证据理论框架下,研究了基于目标基本概率赋值(BPAF)判决的决策层目标属性融合问题。简要介绍了D-S证据组合理论框架,阐述了基于BPAF判决的决策层目标属性融合策略、步骤;分析了证据严重冲突时,Dempster证据组合规则不合理的本质原因;提出必须对D-S证据组合规则进行改善等需要继续深入探讨的几个问题。     

车载光学测量设备任务调度问题建模与求解

为提高观测方案效费比、改进探测能力,探索了一类车载光学测量设备的观测任务调度问题,并给出了解决方案。将观测任务调度问题建模为一个寻找最优观测方案的数学问题,结合设备的性能特点,给出了观测方案的数学描述,梳理了观测方案应满足的约束,提出了评价观测方案质量的指标,进而利用多属性决策方法来计算不同方案的总体效能,并排序获得最优方案。仿真算例验证了方法的有效性,相关研究成果对车载光学测量设备的运用实践具有一定的参考价值。     

基于BP神经网络的D-S证据理论及其应用

命题基本概率分配(BPA)的确定是D-S证据理论得以广泛应用的关键之一.目前,大部分确定方法受专家知识偏好影响较大,难以反映客观情况.将BP网络运用到基本概率分配的确定过程中,使得BP网络和D-S证据理论两者有机地联合应用,这样既可利用D-S证据理论来表达和处理不确定信息,又可以充分发挥BP网络的自学习、自适应和容错能力.文中建立了基于BP网络的D-S证据理论的故障诊断模型,并给出了证据的融合算法.仿真实验表明,该模型可行.     

弹炮结合武器系统火力分配优化问题研究

在确定弹炮结合武器系统对目标的可射击系数、火力重叠修正系数和转火矛盾修正系数的基础上,结合防空作战的实际,通过对运用地空导弹射击、运用高炮射击、运用地空导弹和高炮混合射击三种情况的分析,介绍了解决弹炮结合武器系统火力分配优化问题的一般步骤。通过算例,证明了该方法的可行性,为有效解决弹炮结合武器系统火力分配优化问题提供了一种较为科学的方法。     

A branch‐and‐price algorithm for a targeting problem

In this paper, we consider a new weapon‐target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model. We present a branch‐and‐price algorithm for the problem employing the disaggregated formulation, which has exponentially many columns denoting the feasible allocations of weapon systems to each target. A greedy‐style heuristic is used to get some initial columns to start the column generation. A branching strategy compatible with the pricing problem is also proposed. Computational results using randomly generated data show this approach is promising for the targeting problem. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

人工免疫在军事领域的应用

人工免疫学是继神经网络、进化计算之后新的智能计算研究领域和研究热点.为探讨人工免疫可运用的军事领域,给相关科研工作者提供新方法、新思路,对生物免疫系统的一些概念进行了介绍,简要分析了生物免疫系统中的免疫机制,人工免疫系统基本特征,然后着重分析了该学科在信息系统安全、防御系统设计、目标识别、故障诊断、优化、火力分配等方面中的应用.     

改进遗传算法的导弹目标分配方法

针对遗传算法在解决导弹目标分配问题中的困难,将火力单位的目标分配问题变换为针对导弹的目标分配问题,之后应用遗传算法求解,求解后还原为火力单位的分配结果,并用实例验证了应用遗传算法的可行性.之后,引入"优势"基因对标准遗传算法进行改进,大量实例表明,改进后的算法提高约60%的搜索效率.     

Graph distance‐dependent labeling related to code assignment in computer networks

For nonnegative integers d₁, d₂, and L(d₁, d₂)‐labeling of a graph G, is a function f : V(G) → {0, 1, 2, …} such that |f(u) − f(v)| ≥ d_i whenever the distance between u and v is i in G, for i = 1, 2. The L(d₁, d₂)‐number of G, λ(G) is the smallest k such that there exists an L(d₁, d₂)‐labeling with the largest label k. These labelings have an application to a computer code assignment problem. The task is to assign integer “control codes” to a network of computer stations with distance restrictions, which allow d₁ ≤ d₂. In this article, we will study the labelings with (d₁, d₂) ∈ {(0, 1), (1, 1), (1, 2)}. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

任务划分与处理机调度的递归-分治方法

本文介绍并实现了一种如何把一个顺序执行的任务集,根据其子任务之间潜在的并行性,划分成若干个可并发执行的任务子集,并把每个子集分配给一个处理机,使各处理机之间的数据通信量尽可能地少,同时兼顾各处理机之间负载平衡的算法。最后给出了几个典型例题的试算结果,为了满足用户的不同要求,文章还提出了几点改进方法。     

Exact algorithms and bounds for the dynamic assignment interdiction problem

We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017