战场物资运输指挥控制的对偶分析

在战场的供求双方之间实施快速物资运输的指挥控制是作战指挥控制的一个重要组成部分,根据供求双方的物资供应量和需求量、运输路径的长度和运输工具的能力等参数,制订一个使物资总运载量以及耗费时间为最小的运输指挥控制计划是战场指挥员必须解决的关键问题.一种基于线性规划及对偶分析的战场物资运输的指挥控制方法为解决此类问题提供了一种可行途径.     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system

A single server is faced with a collection of jobs of varying duration and urgency. Each job has a random lifetime during which it is available for nonpreemptive service. Should a job's lifetime expire before its service begins then it is lost from the system unserved. The goal is to schedule the jobs for service to maximize the expected number served to completion. Two heuristics have been proposed in the literature. One (labeled π^S) operates a static priority among the job classes and works well in a “no premature job loss” limit, whereas the second (π^M) is a myopic heuristic which works well when lifetimes are short. Both can exhibit poor performance for problems at some distance from the regimes for which they were designed. We develop a robustly good heuristic by an approximative approach to the application of a policy improvement step to the asymptotically optimal heuristic π^S, in which we use a fluid model to obtain an approximation for the value function of π^S. The performance of the proposed heuristic is investigated in an extensive numerical study. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

基于博弈均衡分析的联合作战远程火力战法

用定量分析的方法开发远程火力战法是联合作战规划中必须解决的重要问题,借助仿真和博弈分析的混合方法,在对博弈效用函数计算的基础上,构建基于识别真目标、假目标以及火力命中目标概率的二人非零和(TPNZS)非合作博弈模型来开发远程火力战法,对一个典型的联合作战远程火力打击系统的初步研究表明:敌我双方的战法分别为π*=(0,π2*,1-π2*)=(0.000 0,0.674 1,0.325 9)和Δ*=(0.000 0,0.000 0,Δ3*)=(0.000 0,0.000 0,1.000 0)。     

捷联惯导初始对准中H_∞滤波器参数优化研究

对H∞滤波在捷联导航系统初始对准中的应用进行了研究。通过仿真和实验验证了滤波器在初始对准中的性能,并对如何设置参数进行了研究。结果表明,H∞滤波在参数选取合适的情况下方位角收敛速度比卡尔曼滤波快。当参数选取不合适的时候,H∞滤波会发散。虽然H∞滤波可能提高方位角收敛速度,但它自身的鲁棒性可能被削弱。因此,在实际系统中,必须选取合适的参数以保证滤波器的稳定性和初始对准的速度。实际使用过程中,先把参数设置为一个很小的值,再逐步调大以寻找临界值来获得最优的性能。     

基于蚁群算法的航空弹药需求测算

智能化是现代航空弹药需求与指挥控制系统的发展趋势,如何进行合理快速地调拨航空弹药是系统设计过程中的关键任务之一。为此,提出了依据目标对航空弹药进行选择的策略,利用蚁群算法对战斗目标进行聚类分析,对各类目标进行模糊综合评判,从而确定装备出动方案,依据弹药与装备的关系,对满足既定保障度的弹药需求量建立模型,并计算出满足既定保障度的弹药供应量,为战前对战场态势预估,实现弹药战时及时准确调拨,为作战弹药准备提供依据。     

基于种群分类的变尺度免疫克隆选择算法

提出了一种基于种群分类的变尺度免疫克隆选择算法.该算法通过对目标函数进行非线性尺度变换,突出了全局最优解的优势地位;建立记忆子群实现了种群代际进化信息的交换;依据亲和度将抗体分为精英子群、普通子群、劣等子群,并对其分别执行自适应高斯变异、均匀变异和消亡更新等策略,增强了算法的局部和全局搜索能力.引入小生境技术提高了抗体...     

虚拟PDM环境下基于特征增长的协同设计

协同设计目前已经成为解决复杂产品设计问题的关键技术之一.在分析了现有协同设计问题的基础上,提出通过构建虚拟PDM(VPDM,Virtual PDM),应用交换特征增长数据的方法,来解决企业间异构PDM、CAD应用系统的协同设计问题.给出了虚拟PDM的定义,并介绍了基于虚拟PDM进行协同设计的基本原理.建立了基于虚拟PD...     

内编队重力场测量卫星微推力器姿轨一体化控制

内编队重力场测量卫星通过精密定轨和相对状态测量实现高精度高分辨率地球重力场测量.这两项技术都依赖于精密编队控制和姿态控制.稳态工作期间,要求相对位移必须控制在厘米量级内,外卫星对地定向精度优于0.1°.姿轨一体化控制的目标是利用微推力器保障稳态工作期间的科学测量.基于带推力器布局的耦合线性模型进行了内编队重力场测量卫星...     

雾对舰载雷达电子侦察能力影响仿真

针对雾对舰载雷达电子侦查能力影响同题,引入雾对雷达电磁波衰减比例系数,建立了雾环境下雷达电子侦察距离的估算模型,并以雾对雷达侦察作用距离的影响为目标,对不同工作频率雷达侦察作用距离的影响进行了仿真分析,获得了定性和定量分析结论.