解耦的三轴气浮台非线性模糊变结构鲁棒控制问题

针对飞行器全物理仿真三轴气浮台这一具有不确定性的、耦合的非线性系统,对其动力学耦合和可解耦性问题进行了分析、计算和证明.通过综合变结构控制和模糊控制,给出了一种新的非线性控制系统设计方法,此方法既可以避免变结构控制所固有的颤动现象,同时由于该模糊控制律的解析性,所以也具有实现简单,易于工程化的优点.仿真结果表明,给出的模糊变结构控制,对飞行器模型不确定性和外来干扰具有较强的和良好的跟踪性能.     

对运动目标螺旋搜索误区分析

对运动目标搜索是军事系统工程的一个重要内容,其在很多领域具有广泛应用,如对潜艇搜索、对失事舰船飞机搜救、制导武器搜索捕捉目标等.用运动学和数学的有关知识分析了目标定速直航机动时的分布函数以及搜索者与其可相遇的条件,提出了对运动目标按螺旋线搜索的另一种证明方法,建立了直线搜索时目标可能位置点的数学模型,并以此为依据分析了对运动目标螺旋搜索模式的一个误区.     

相控阵雷达LPI搜索方法研究

相控阵雷达可通过合理配置工作参数优化其性能。针对相控阵雷达在搜索目标时易受敌方电子侦察设备威胁的现实,研究了在保持搜索能力的同时,通过合理配置参数降低截获概率的问题。分析了影响相控阵雷达搜索状态LPI(Low Probability of Intercept)性能的主要因素,建立了截获概率模型与搜索能力模型,给出了3种参数调整策略。仿真试验验证了模型的有效性,并比较了3种策略的优劣。     

装备维修器材保障最小费用模型研究

考虑部队装备维修器材需求量的随机变化对保障费用产生的影响,通过实际问题分析给出了在保障单位零星供应条件下,如何确定保障单位最佳的器材存储量并建立器材保障最小费用模型的程序和方法,最后结合实例,验证了模型的适用性.     

不确定条件下装备器材供应网规划模型

装备器材供应网是装备器材供应保障工作的重要基石,其规划问题是我军装备器材保障过程的重要战略决策之一。针对节点、边和需求的不确定性,对不确定条件下由多个区域供应子网构成的装备器材供应网的规划问题展开研究。针对问题的特点,用区间分析理论对供应网规划中的不确定性因素进行度量和运算,得到不确定性规划模型,通过区间运算转化,将不确定性模型转化为确定性混合整数规划模型,并设计采用基于禁忌搜索算法的两阶段算法进行求解,分别得到了不同参数设置下的模型求解结果,并将所用算法与模糊规划和随机规划算法的求解结果进行了比较分析。实例分析结果表明所建立的模型和算法具有较强的实用性。     

拖航安全性影响因素权值的确定方法

运用重要度排序指数法对拖航安全性影响因素的权重进行评价,对变权综合决策方法在舰船拖带中的应用进行了探讨.针对舰船拖带这一多目标决策问题建立了决策模型,对于影响拖带安全的主要指标的权重给出了相应的计算方法,并通过实例对拖带方案进行了评估,为舰船拖带的最优化评定提供了有效的解决途径.     

进入角约束下的载机变结构远距引导

针对一般导引律在载机远距引导中存在的问题,结合远距引导的需求,设计了远距引导的三维变结构导引律。该导引律具有较强自适应性,可以使载机以期望的进入角接近目标。仿真结果表明,载机在该导引律作用下,能以较小过载,平滑轨迹快速接近机动目标,并保证载机引导结束时占有有利的空中战术态势。     

UUV编队协同搜索静止目标的准最优方法

考虑到操作的简单性且实际执行搜索任务时搜索力不是无限可分,将连续空间的搜索问题转换为离散空间的最优搜索问题。通过划分网格,将连续的目标位置分布离散化。根据最优搜索理论,提出了单个无人水下航行器的准最优随机搜索方法,较好地逼近理论最优值。并以此为基础,分析了无人水下航行器编队的3种协同搜索方法:集中最优搜索、分散最大概率搜索和准最优搜索。最后通过实例仿真,得出了编队准最优搜索策略的有效性、优越性和可操作性。此方法将对无人水下航行器编队的战法研究具有参考借鉴意义。     

An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network

Scheduling IT projects and assigning the project work to human resources are an important and common tasks in almost any IT service company. It is particularly complex because human resources usually have multiple skills. Up to now only little work has considered IT‐specific properties of the project structure and human resources. In this article, we present an optimization model that simultaneously schedules the activities of multiple IT projects with serial network structures and assigns the project work to multiskilled internal and external human resources with different efficiencies. The goal is to minimize costs. We introduce a metaheuristic that decomposes the problem into a binary scheduling problem and a continuous staffing problem where the latter is solved efficiently by exploiting its underlying network structure. For comparison, we solve the mixed–binary linear program with a state–of–the–art commercial solver. The impacts of problem parameters on computation time and solution gaps between the metaheuristic and the solver are assessed in an experimental study. Our results show that the metaheuristic provides very favorable results in considerable less time than the solver for midsize problems. For larger problems, it shows a similar performance while the solver fails to return feasible solutions. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 111–127, 2012     

Models and algorithms for shuffling problems in steel plants

In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012