日-地(月)系拉格朗日L1点及晕(Halo)轨道应用

日-地(月)系统拉格朗日L1点及L1点附近的晕(Halo)轨道在"夸父"工程中有重要的应用价值,可用于对太阳实施持续观测.利用数值分析方法,找到了日-地(月)-探测器三者构成的圆限制性三体问题中L1点附近的周期晕(Halo)轨道,分析了轨道的特性.研究结果对"夸父"工程中的目标轨道设计有一定的参考价值.     

A branch‐and‐cut algorithm for the nonpreemptive swapping problem

In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch‐and‐cut algorithm based on a 0‐1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

一种指挥控制系统中的目标优化分配方法

对现有的目标优化分配模型进行了分析,给出了防空指挥控制系统中目标优化分配的工程背景,在该背景下,对影响目标优化分配的因素进行了分析总结,给出了一种以拦截效能为效益函数的目标优化分配模型,对该模型进行了仿真验证.     

基于区间数的DS证据合成方法研究

在DS证据理论的应用过程中,命题的基本概率赋值函数起到了关键的作用,传统DS证据理论中基本概率赋值函数的取值为[0,1]中的单点值.在很难准确将证据所支持命题的基本概率赋值表示为[0,1]之间的单点值时,可以用区间数形式来表示命题的基本概率赋值.在建立符合运算封闭性的区间数广义求和与广义乘积算子的基础上,定义了基于区间数的基本概率赋值函数、信任函数以及似然函数等重要概念,给出了证据合成规则,进而提出了基于区间数的DS证据合成方法.计算实例表明,与传统DS证据合成方法相比,基于区间数的DS证据合成方法具有更灵活的应用特性和更小的计算复杂度.     

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

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

基于模糊匈牙利算法的炮兵火力单位分配问题

发挥诸火力单位的整体协调优势,寻求在给定约束条件下总的射击效果最好的分配方案,是火力单位最优分配的基本任务.匈牙利算法是求解传统的指派问题的一种较好的方法,运用模糊匈牙利算法在决策过程中将主观因素与客观因素有机地结合起来,解决火力单位分配方案决策中多指标指派问题,从而可以有效地解决炮兵火力单位分配最优化问题.     

联合作战目标协同模型构建与求解方法?

在对联合作战目标协同研究内容分析的基础上,提出了多任务部队与多作战目标的协同目标分配模型,其融合了目标综合价值、目标打击有效性、目标威胁适配度、目标类型匹配、目标距离匹配等因素。通过对各因素量化并将协同目标分配模型转换为指派问题进行求解,验证了分析方法的可行性。     

基于云遗传算法的防空导弹目标分配问题

针对传统遗传算法在防空导弹目标优化分配中存在的缺陷,提出了一种更为有效的云遗传算法。通过该算法对防空导弹目标分配模型进行仿真求解,得出防空导弹射击目标的最优目标分配方案。通过算例分析,云遗传算法相比传统遗传算法收敛速度快,搜索效率高出一倍左右,对产生局部最优解情况进行了合理有效的控制,可操作性、优越性更强。     

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     

Clifford分析中K超正则函数的Riemann边值问题

Clifford分析中的函数理论被广泛研究,得到的许多结果推广了经典复分析中解析函数的理论。文中研究了Clifford分析中K超正则函数的Riemann边值问题,得到它的一种表示式和Cauchy积分公式等一些性质,利用转化法和积分方程及不动点原理证明了它的一类Riemann边值问题O解的存在唯一性。