一种新的进化规划算法

参考高斯变异算子和柯西变异算子,提出了基于学生概率分布变异的进化规划算法。学生概率分布能够衔接高斯分布和柯西分布,其性能通过改变参数n来获得。通过仿真得到了学生概率分布变异的规律。仿真表明,基于学生概率分布变异的进化算法具有较好的性能。     

基于改进协同遗传算法的有效载荷系统功能序列规划方法

针对传统回溯算法在求解基于知识模型的有效载荷系统功能序列规划问题中搜索效率低的问题,提出一种基于"择劣变异"(Worst Individual Mutation,WIM)策略的协同遗传算法(Co-evolutionary Genetic Algorithm,CGA)的改进算法WIM-CGA。该算法在遗传过程中采用双路线进化方案,即"择优实施标准遗传过程,择劣实施变异操作",达到提高求解精确度及搜索效率的目的。仿真结果表明,同等测试条件下,当功能规模为50,约束密度为1.0时,WIM-CGA算法在限定时间内最优解的平均精确度比优化的回溯算法提高了54.15%,比CGA算法提高了6.18%,且当所得解的精确度大于90%时,WIM-CGA算法比CGA算法的迭代次数减少了65.79%,耗时降低了48.97%,显著提高了功能序列规划的效率。     

基于心理调查和空间干预的人群心理仿真

突发危机事件中人群心理评估是当前危机管理急需解决的难点问题.由于突发危机事件群体心理数据采集的困难性和人群心理变化的复杂性等原因,传统方法很难准确评估群体心理效果.随着计算机科学的发展,建模仿真成为解决这类问题的有效手段.以复杂适应系统理论为指导,采用基于Agent的建模与仿真方法,研究外部事件刺激下群体的心理行为,构...     

防毒面具的现状和发展趋势

扼要叙述了外军防毒面具及其技术的发展现状和趋势。     

基因遗传算法在三维数据场造型中的应用

将基因遗传算法应用于三维数据场的造型研究之中,提出了遗传三角剖分算法.针对三维三角剖分的特殊性,提出了虚拟交叉算子和三角变异算子,能够确保在遗传进化过程中,解群中的每一个串始终代表一个合法的三角剖分.     

单兵信息系统协同作战技术研究

协同作战是提高体系作战能力,发挥整体作战效能的关键,针对单兵班组在未来信息化条件下单兵作战单元协同作战的协同模式、协同流程、协同策略,协同指挥、协同作战效能评估等方面进行阐释,对未来单兵信息系统班组协同作战技术研究具有一定的指导意义。     

论侵犯军人个人信息的危害及其原因

侵犯军人个人信息的行为具有专业性、多样性和隐蔽性等特点。侵犯军人个人信息不但直接侵犯了军人的合法利益,而且还扰乱了信息管理秩序、危害了信息安全,甚至还危害了国防安全和国际军事交流。军人个人信息本身具有价值、对个人信息的保护意识和诚信意识较弱、法律保护缺位、权力的违法行使、信息市场利益的驱动、互联网的发展、取证困难都是侵犯军人个人信息的原因。     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017     

自适应变异遗传算法在通信网络时延和路由选择优化中的应用分析

在遗传算法中采用自适应的方法来控制变异操作,可以提高算法的全局搜索能力,加快收敛速度,从而可以迅速地求解组合优化问题,并在进一步求解计算机通信网优化问题中得到成功应用.