A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

The minmax multidimensional knapsack problem with application to a chance‐constrained problem

In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two‐period, two‐level, chance‐constrained problem with recourse. We show that the MKP is NP‐hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assumptions regarding the operational setting of the logistics problem, the chance‐constrained optimization problem is decomposable into a series of MKPs that are solved separately. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

军人伤亡保险存在的问题探析

军人伤亡保险作为军人保险制度的重要组成部分,其经济补偿功能已经被广大官兵逐渐认可。但作为分散军人职业风险的特定机制,其作用并未被充分开发出来,主要表现在较低的补偿水平等方面。因此,应充分借鉴国内外的相关经验,扬长避短,以充分发挥军人伤亡保险的作用。     

基层警营文化建设存在的问题及对策

基层警营文化建设是公安边消警部队文化工作的基础和基层建设的重要保证,直接关系部队的稳定、官兵关系和谐以及官兵的健康成长。通过实地调研基层警营文化建设情况,发现存在的问题与不足,分析其成因,提出切实可行的解决对策。     

随军配偶未就业期间社会保险问题分析

军人配偶随军未就业期间社会保险的建立解决了军人配偶在随军未就业期间的基本生活补贴和养老、医疗保险问题,在一定程度上保障了随军配偶的利益。但在执行过程中也出现一些诸如险种较少,保障范围较窄,保障程度较低等问题。在分析存在问题的基础上,提出一些完善社会保险的建议。     

高校干部档案材料收集工作存在的问题与对策

新时期高校干部档案工作应更好地为学校各级领导决策服务,为教学、科研、管理的各项工作服务。文章从高校干部档案的收集工作入手,对高校干部档案收集工作中存在的问题进行分析,并提出解决问题的对策。     

球约束凸二次规划的一个算法

针对球约束凸二次规划问题,利用Lagrange对偶将其转化为无约束优化问题,然后运用单纯形法对其求解,获得原问题的最优解。最后,对文中给出的算法给出了论证。     

Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness

We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines M_j, and the M_j subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017     

带三维落角约束的寻的导弹制导与姿控系统设计

针对带三维落角约束的寻的导弹制导与姿态控制系统设计问题,提出一种基于终端滑模控制和扩张状态观测器的六自由度制导控制系统设计方法。建立包含模型不确定项的寻的导弹六自由度质心与绕质心模型,设计内外双层环路六自由度制导控制系统框架;基于弹-目三维相对运动模型和坐标系转移矩阵建立以攻角和侧滑角为输入的三维全耦合导引方程,利用终端滑模控制方法和扩展状态观测器得到期望的攻角和侧滑角并将其转化为对应的俯仰、偏航和滚转角指令;根据线性形式的寻的导弹绕质心动力学方程,设计与俯仰、偏航和滚转角相关的滑模面向量,并利用终端滑模控制方法和扩张状态观测器得到寻的导弹的副翼偏角、方向舵偏角和俯仰舵偏角指令。六自由度数值仿真结果验证了该方法的有效性和鲁棒性,并证明了该制导控制系统设计方法能以较少的控制设计参数完成预设的制导控制任务。     

平流层飞艇抗风场干扰约束Unscented卡尔曼滤波算法设计与应用

为了提高风场干扰环境下飞艇的导航精度,研究飞艇抗风场干扰导航算法。在建立风场干扰条件下飞艇速度误差约束模型的基础上,设计抗风场干扰的约束Unscented卡尔曼滤波算法。确定风场干扰条件下飞艇的速度误差约束量,将该约束与Unscented卡尔曼滤波算法相结合,对速度误差进行估计和补偿,以减小风场对飞艇定位精度的影响;证明该算法的状态估计量不仅是无偏的,而且协方差小于标准Unscented卡尔曼滤波的协方差;将提出的算法应用于捷联惯导/天文/合成孔径雷达组合导航系统中进行仿真验证,并与自适应扩展卡尔曼滤波和抗差自适应Unscented卡尔曼滤波算法进行比较。结果表明:提出的约束Unscented卡尔曼滤波算法的滤波性能明显优于自适应扩展卡尔曼滤波和抗差自适应Unscented卡尔曼滤波算法,能够有效抑制风场对飞艇定位精度的影响,提高飞艇的导航定位精度。