装备器材保障资源调度决策模型及算法

装备器材保障资源调度问题是一个非常复杂的问题,根据其优化目标要求,从保障时间最短、保障耗费最低、安全性最高3个方面建立了该问题的多目标优化模型,并通过目标优先度决策将其转化为单目标模型;接着,采用两阶段法进行求解,将其分为最优路径决策、器材分配决策两个阶段进行决策优化,在明确资源点到需求点之间的最优路径后再进行器材资源的分配;并分别采用基于小生境的自适应遗传算法和基于生成树的遗传算法进行求解。通过实例分析,求解结果能够满足装备器材保障的要求,表明所构建的决策模型和算法是有效的。     

基于NGA算法的舰载机机库出库调度优化

为了在复杂的机库环境中,尽可能缩短舰载机出库时间,优化其出库顺序,对舰载机多机出库调度优化问题进行了研究。首先,对该问题进行分析,建立了适合优化的数学模型。其次,设计了一种适合优化舰载机多机出库调度问题的算法—NGA算法,该算法是在遗传算法(GA)的基础上,对原有交叉和变异策略进行改变以适应所求解问题,并融入执行路径探测和规划的通视图算法后形成的。最后,分别将该方法和枚举法应用于求解尼米兹级航母舰载机多机出库调度优化问题T4。仿真结果为基于NGA算法所得的最短出库时间为801 s,最短移动距离为1 098.3 m;基于枚举法结果为800.4 s和1 097.6 m。由结果可知,NGA算法计算结果与枚举法相差较小,可以应用于求解舰载机多机出库调度问题。     

基于改进RCPSP的军队建设项目中长期规划问题建模与求解

针对军队建设项目中长期规划编制中的任务安排问题,探索运用项目调度理论和方法提供一种辅助的定量分析手段.以传统资源受限项目调度问题模型为基础,考虑军费预算定期划拨的特点,增加资源可用时间区间作为约束条件,构建了带资源时间约束的多项目调度模型,提出了一种集成动态遗传算法和启发式算法的逐阶段迭代多项目调度算法.该模型和求解算法能够在有限时间和预算条件下,充分利用各年度预算并达成项目规划预期收益.仿真实验表明,本文提出的逐阶段迭代多项目调度算法能够快速求解大规模算例,避免早熟并获得满意解,在求解速度和质量方面具有一定优势.     

电子侦察卫星联合侦察的混合调度算法

针对电子侦察卫星的使用约束,及不同任务的调度需求,建立了电子侦察卫星联合侦察的多目标混合整数规划模型.利用进化算法的全局搜索能力和变邻域搜索的局部优化能力,提出了一种多目标进化算法和变邻域搜索相结合两阶段混合调度算法MOEA VNS.针对问题多时间窗组合优化特点,设计了进化算子与邻域移动算子,在确保解多样性的同时使算法...     

基于改进布谷鸟搜索算法的多传感器调度方法

针对以往战场环境中目标跟踪背景下多传感器调度算法收敛性差、求解精度低的问题,在CS算法(布谷鸟搜索算法)的基础上,提出了一种基于差分进化的布谷鸟搜索算法.在跟踪目标模型的基础上,以跟踪精度、任务完成率以及传感器资源能源消耗为指标,建立多传感器调度模型;借鉴差分进化思想,对布谷鸟搜索算法进行改进;利用改进后的布谷鸟搜索算法(DE-CS算法)求解传感器调度模型.将DE-CS算法与基础CS算法进行仿真比较,仿真结果表明,改进后的算法在收敛速度和精度方面都得到了有效改善,证明改进后的算法有较好的求解质量.     

基于协同进化的多平台联合对地观测优化调度

在分析了卫星与无人机在执行观测与资源调度上的特性差异基础上,建立了多平台联合对地观测调度问题的数学模型,提出了多平台协同进化调度算法(MPCCPSA)进行求解。MPCCPSA采用分层式协同进化架构解决了不同类型观测方案统一调度生成问题。根据不同类型平台使用特性以及观测目标集合特点,采用分治-合作策略将其分解分配到各平台,顶层的交叉、变异操作保证各种群的多样性,底层的分治、合作算子保证卫星与无人机之间保持观测能力动态互补,在确保可行解的前提下加快收敛速度。仿真实验表明该方法能够有效解决空-天基多类型平台联合观测优化调度问题。     

基于多目标问题的装备维修保障资源调度研究

针对战时装备维修保障资源调度面临维修保障资源需求量不确定、调度时间不确定、调度路径可靠性不确定的问题,通过引入三角模糊数,将不确定信息量化,构建了以维修保障资源调度时间最短、维修保障资源调度路径可靠性最高和维修保障资源调度成本最小为目标的多目标调度模型,并给出了确定各目标相对重要度的方法,然后通过极大极小法将多目标模型转换为单目标模型,并结合LINGO软件对模型进行求解得出维修保障资源的最优调度方案。最后,引入算例进行了分析计算,结果证明了该模型的有效性,对于战时开展装备维修保障资源调度具有一定参考价值。     

基于混合变异策略差分进化算法的无人机航路规划

提出在一种三维场景参数部分已知的有威胁空域中,采用差分进化算法(DE)规划无人机(UAV)航路,为了提高差分进化算法性能,以生成最优的路径,而采取多种变异策略的差分进化算法。算法根据种群个体的适应度值,将初始化的种群分为3个子种群,然后对于不同子种群采取不同变异策略。重点构建了环境模型和生存模型。数值实验结果表明,相较于单一变异策略的DE算法,混合变异策略的DE算法在无人机航路规划问题求解中,具有更好的求解效果和环境适应能力。     

基于多资源点的装备应急器材调度决策模型

针对装备应急器材调度决策问题,从调度路径优化和调度计划分配2个方面,研究了其多目标优化模型的构建。将资源点划分为若干级别来确定资源点选取的优先次序,通过先求解资源点与需求点之间的最优路径,后求解器材资源分配量的思路,建立了装备应急器材调度决策的广义最优路径模型和运输模型,采用改进的Dijkstra算法对模型进行求解,仿真结果表明:所构建的决策模型及算法是有效的。     

滑翔飞行器多目标弹道优化的进化-配点混合求解策略

针对高超声速滑翔飞行器弹道多目标优化问题,综合考虑计算效率和精度,结合分解进化算法与配点法提出一种混合求解策略。根据滑翔飞行器动力学模型和弹道设计中需要考虑的约束条件,建立飞行器多目标弹道优化模型。利用控制量离散化方法将多目标弹道优化问题转化为带约束的多目标参数优化问题,并采用罚函数法处理约束条件,随后利用分解多目标进化算法进行求解。为了提高弹道优化的精度,将椭球聚合法与配点法相结合,以多目标进化算法得到的Pareto解作为初始解进行迭代求解。通过典型的复杂约束多目标弹道优化的算例表明,所提出的混合求解策略能够获得满足复杂约束要求的Pareto最优解集,实现有效的多目标弹道优化。     

The Impact of the Unemployment Rate on Attrition of First-Term Enlistees

This study examines the effects of home-state unemployment rates on attrition behavior of Navy enlistees for successive career windows during the first term of service: the first 6?months, the second 6?months, the second year, and the third year of service. The results indicate that attrition is negatively associated with changes in the local unemployment rate during the first three career windows covering two years of service. However, after two years of service, the estimated effect of the unemployment rate becomes insignificant for most groups of sailors. This is likely because sailors with the poorest job matches are sorted out early in the first term of service.     

A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relationships among pairs of jobs (whenever possible) and eliminates the first and the last few jobs in an optimal sequence. The remaining jobs are then ordered by incorporating the precedence relationships in a dynamic programming framework. Propositions are proved which considerably reduce the total computation involved in the dynamic programming phase. Computational results indicate that the solution time goes up less than linearly with the size (n) of the problem. The median solution time for solving 50 job problems was 0.36 second on UNIVAC 1108 computer.     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017     

探月飞船初次再入段纵程的解析预测方法

探月飞船升阻比较低,为实现长纵程飞行,必须采用跳跃式再入方式。在跳跃式再入轨迹在线规划或预测制导中,如何快速准确地预测初次再入段纵程是一个非常关键的问题。针对这一问题,研究提出一种解析预测方法:利用匹配渐进展开方法得到再入纵向运动方程的闭型近似解;将初次再入段轨迹分为三段,第一段采用高度作为积分自变量,并利用复合梯形公式得到纵程,第二段和第三段分别采用二次多项式来拟合阻力加速度-能量剖面,根据近似解结果反解出多项式系数,并将得到的阻力加速度倒数-能量函数进行积分,得到第二段和第三段的纵程;对解析预测方法的精度和计算效率进行分析,结果表明该方法计算精度较高,速度快,可用于跳跃式再入轨迹的在线规划和制导。     

The quay crane scheduling problem with time windows

The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time windows. The problem is of practical relevance, because container terminal operators frequently redeploy cranes among vessels to speed up the service of high‐priority vessels while serving low‐priority vessels casually. This article provides a mathematical formulation of the problem and a tree‐search‐based heuristic solution method. A computational investigation on a large set of test instances is used to evaluate the performance of the heuristic and to identify the impact of differently structured crane time windows on the achievable vessel handling time. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于锁相环的GNSS授时接收机钟差校准算法

GNSS(全球卫星导航系统)授时接收机利用卫星导航信号获取钟差并校准本地时钟,从而与GNSS系统时间同步。提出了全新的基于锁相环的GNSS授时接收机钟差校准算法,将钟差校准过程等效为传统的锁相环模型,鉴相器的功能由PVT(位置、速度与时间)解算实现,压控振荡器的功能由本地时间调整接口实现,环路将本地秒相位与GNSS系统的秒相位锁定。分析了环路总误差的组成,以及环路参数与各误差项的关系,给出了误差最小的环路优化设计准则。在北斗二号卫星导航接收机平台上进行了对比实验,验证了算法的有效性。     

空间救援发射窗口分析

从发射窗口的基本特性出发,推导了空间救援任务发射窗口的解析求解方法.将空间救援发射窗口问题分解为平面窗口问题和相位窗口问题,分别建立了平面窗口与相位窗口的解析求解模型,最后获得了发射窗口解析解.用直观曲线描述了同一经度的不同纬度所有发射点对应的发射窗口,为空间救援任务发射窗口的分析和快速计算提供了基础.     

圆锥壳方程的二次渐近解

本文由旋转壳的一对二阶常微分方程得出圆锥壳的复变量方程,利用渐近积分法推导出方程的一次近似解和二次近似解。二次近似解达到薄壳理论所具有的精度,一次近似解也具有足够精度。对于所取算例,本文解的计算结果与已有的Kelvin函数解的结果符合良好。但本文解为有限形式的简单表达式,便于计算应用。     

基于状态反馈的导弹滚转通道变结构控制

针对导弹滚转通道参数时变性和快速性要求,提出了一种易于实现状态反馈变结构控制器的设计。将系统分为确定部分和不确定部分,然后分别对这两部分进行变结构控制。结果表明,适当的校正规则不仅保证滑模的存在,而且具有对参数扰动和外部扰动的不变性;状态信号的反馈提高了滚转通道的响应能力;伪滑模大大削减了变结构控制的抖动。并通过仿真证明了该方法的正确性和有效性。     

Validation of a strategy for harbor defense based on the use of a min‐max algorithm receding horizon control law

We present a validation of a centralized feedback control law for robotic or partially robotic water craft whose task is to defend a harbor from an intruding fleet of water craft. Our work was motivated by the need to provide harbor defenses against hostile, possibly suicidal intruders, preferably using unmanned craft to limit potential casualties. Our feedback control law is a sample‐data receding horizon control law, which requires the solution of a complex max‐min problem at the start of each sample time. In developing this control law, we had to deal with three challenges. The first was to develop a max‐min problem that captures realistically the nature of the defense‐intrusion game. The second was to ensure the solution of this max‐min problem can be accomplished in a small fraction of the sample time that would be needed to control a possibly fast moving craft. The third, to which this article is dedicated, was to validate the effectiveness of our control law first through computer simulations pitting a computer against a computer or a computer against a human, then through the use of model hovercraft in a laboratory, and finally on the Chesapeake Bay, using Yard Patrol boats. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 247–259, 2016