整数线性规划问题的一个新算法

本文给出求解整数线性规划问题的一个算法。基本思想是通过求出其伴随线性规划问题的最优单纯形表,把整数线性规划化成正整数系数的不定方程,然后从不定方程的非负整数解集中选取一组满足整数线性规划的约束条件的解,作为整数线性规划的最优解。     

A heuristic for maximizing the number of on‐time jobs on two uniform parallel machines

We consider the problem of maximizing the number of on‐time jobs on two uniform parallel machines. We show that a straightforward extension of an algorithm developed for the simpler two identical parallel machines problem yields a heuristic with a worst‐case ratio bound of at least . We then show that the infusion of a “look ahead” feature into the aforementioned algorithm results in a heuristic with the tight worst‐case ratio bound of , which, to our knowledge, is the tightest worst‐case ratio bound available for the problem. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

高分辨率雷达目标一维距离像的编码识别算法

文中提出了一种高分辨率雷达目标一维距离像的识别算法。该算法借用图像处理方法,先对雷达目标的一维距离像进行编码,经过傅里叶变换提取一组形状特征。这组特征精确地描述了一维距离像曲线的走向。而后,利用人工神经网络技术对一定姿态角变化范围内的这组形状特征进行识别。实验结果表明,可以获得良好的识别效果。该算法为雷达目标一维距离像识别算法的实时处理提供了一条有效途径。     

果蝇算法和5种群智能算法的寻优性能研究

截止到目前为止进化式算法主要有遗传算法、蚁群算法、鱼群算法、免疫算法、粒子群算法.这些算法已经被广泛地用于寻优,但都有各自的缺点,导致其不易被用于解决实际问题.某学者提出了一种新群智能算法——果蝇算法.对该算法的起源进行分析,并将该算法与其他算法对比,通过仿真分析各个算法寻优性能.重点分析果蝇算法的寻优性能,得出果蝇算法简单、参数少、易调节、计算量小、寻优精度较高,从而较容易被用于解决实际问题,对于复杂问题算法可能不稳定.指出该算法的缺点,提出应改进的地方,对其应用前景作了概括.     

舰船固定磁场分量分离的一种新方法

为了准确了解舰船的固定磁场分布,进而对舰船磁性防护作出指导,用等效磁偶极子的方法对舰船固定磁场分量分离的方法进行了研究,通过对固定磁场垂直分量总和的曲线进行分析,根据磁偶极子组合产生磁场规律的先验知识,选择最佳的磁偶极子的排列方式,然后对磁偶极子磁矩范围进行估计,最后利用遗传算法这种全局优化算法求出磁源的参数,进而分离出固定磁场各个分量。仿真计算结果表明,该方法能够比较好地搜索到磁偶极子的最佳数目、位置和磁矩,可以用于舰船固定磁场的分离。     

Interval scheduling: A survey

In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

多核数字信号处理器矩阵乘卷积算法性能评测

矩阵乘卷积算法能够为各种卷积配置提供高性能基础实现,是面向给定芯片进行卷积性能优化的首要选择。针对国防科技大学自主研制的飞腾异构多核数字信号处理器(digital signal processor, DSP)芯片的特征以及矩阵乘卷积算法自身的特点,提出了一种面向多核DSP架构的高性能并行矩阵乘卷积实现算法ftmEConv。该算法由输入特征图转换、卷积核转换、矩阵乘以及输出特征图转换这四个均运行在通用多核DSP上的并行化部分构成,通过有效挖掘通用DSP核中功能单元的潜力来提升各个部分的性能。实验结果表明,ftmEConv实现了高达42.90%的计算效率,与芯片上的其他矩阵乘卷积算法实现相比,获得了高达7.79倍的性能加速。     

基于预配装思想的物资混装配载优化策略

提出了一种基于预配载思想的装备物资混装配载策略,并应用模糊聚类和混合智能算法进行了实例仿真。研究对于组合优化策略在装备保障信息化系统建设中的应用具有积极意义。     

Efficient sequential decision‐making algorithms for container inspection operations

Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees that are more efficient computationally than those presented by Stroud and Saeger and Anand et al. We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on a space of potentially acceptable binary decision trees. The improvements enable us to analyze substantially larger applications than was previously possible. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于遗传算法的战时维修保障系统优化研究

分析了战时维修保障系统的结构功能,给出了维修保障系统的解析模型,提出了维修保障系统的可控参数及指标;为了使维修保障系统发挥最佳效能,以最小二乘准则作为系统的优化准则,建立了维修保障系统的优化模型,采用遗传算法对优化模型进行求解,给出了计算方法,并以计算实例验证了方法的可行性。