基于遗传算法的分布式多传感器航迹关联算法

以分布式多传感系统中的两节点序贯航迹关联方法为基础,把多节点情况下的航迹关联问题转化为多维分配问题。而多维分配问题是典型的组合优化问题,其计算量随着维数的增加而出现指数爆炸现象,进而根据遗传算法能够解决组合优化问题的能力,提出了利用遗传算法解决此多维分配问题的一种方法。仿真实验结果表明,遗传算法能够有效地求解此多维分配问题,使航迹关联具有较高的成功率。     

基于马尔柯夫过程的武器系统目标分配问题决策分析

将防空作战中武器系统目标分配决策作为一个在动态随机系统中实现最优化的问题,并用马尔柯夫过程理论进行建模分析,提出新的算法并运用Matlab编程;通过对实行不同策略时武器系统长期平均效能的分析比较,指出在目标分配问题上仅靠原有的静态线性规划决策方法是不够的,还必须考虑动态随机对抗过程本身的特性.     

一种新的基本概率函数构建方法及应用

针对Dempster-Shafer(D-S)证据推理中基本概率赋值函数的构造问题,基于模糊聚类分析给出了一种新的构建方法.将它应用到雷达目标识别的仿真实验中,并与灰关联法相比较,结果表明该方法切实可行,不仅提高了基本概率赋值的准确性和稳定性,而且利用了数据的结构信息,有效缓解了证据的冲突.     

基于神经网络的特征结构提取

本文在详细讨论特征结构提取问题的能量函数表示的基础上,通过对该能量函数表示的适当变换和整理,高阶关联非线性连续时间神经网络被引入到特征结构的提取问题中。这种方法直观、明了,它将所要提取的特征结构与网络稳定时的输出直接对应起来,可对特征结构进行自适应跟踪、估计,这为特征结构的提取提出了一个新的方法。     

C~3I 系统中基于多目标决策理论的对空攻击任务分配决策问题研究

根据多目标决策理论,从系统的角度出发,提出了防御权系数问题,并在此基础上研究对空攻击任务的分配策略,给出了效度最大攻击任务分配策略和重点防护目标优先攻击任务分配策略,并引入攻击强度阀值概念,对这两种分配策略进行了改进,最后给出了具体算法。     

分物问题的分法数计算

r个物品分配到n个盒子中，在不同的条件下会有不同的分法数。本文讨论了不同条件下，分法数的计算方法。     

战时装甲装备修理任务划分标准的探讨

介绍了战时装甲装备的各级修理机构,给出了战时装甲装备修理任务的划分标准,描述了修理对象的分布规律——艾拉姆咖(Эрланга)分布的分布函数和概率密度函数。在此基础上,计算得到了战损某型坦克进入各级修理机构的概率,通过对比分析,发现我军修理任务的划分存在不合理性,俄军修理任务的划分比较科学,建议采用俄军修理任务的划分标准。     

Parallel machine scheduling with job assignment restrictions

In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

军械仓库的物资发放研究

用仿真模型研究了仓库物资的发放过程,定量解决了如何科学合理地分配一条作业线中作业机械的使用问题。根据这一结果,研究了在给定作业量的情况下如何确定作业机械数量的方法。     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016