A metaheuristic scheduling procedure for resource-constrained projects with cash flows

Resource-constrained project scheduling problems with cash flows (RCPSPCF) are complex, combinatorial optimization problems. Many heuristics have been reported in the literature that produce reasonable schedules in limited project environments. However, the lack of a heuristic that dominates under differing project conditions can lead to a suboptimal choice of an appropriate heuristic for scheduling any given project. This may result in poor schedules and monetary losses. This paper reports on the application of the tabu search metaheuristic procedure for the RCPSPCF. Strategies for neighborhood generation and candidate selection that exploit the special features of the problem are combined with a simple multiheuristic start procedure. Extensive experimentation, with multiple data sets and comparison with an upper bound, indicates a significant improvement, both in project Net Present Value (NPV) as well as the number of projects, where the metaheuristic outperforms the best known heuristics in the literature. More specifically, this procedure produces the best schedules in over 85% of the projects tested, in contrast to the best single-pass heuristics which have been shown to dominate in at most 20% of the same cases. This iterative, general purpose heuristic is able to adapt significantly better to the complex interactions of the many critical parameters of the RCPSPCF than single-pass heuristics that use more specific information about each project environment. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 912–927, 1999     

入侵检测中频繁模式的有效挖掘算法

在基于数据挖掘的入侵检测系统中,为了在海量审计记录中有效地提取出相关规则,需要通过利用与入侵检测相关的特定领域知识。首先对关联规则挖掘问题中的相关概念给出几个规范化定义,介绍了基本的关联规则和情节规则挖掘算法,然后结合审计记录的特点,考虑其轴属性和参照属性以及规则兴趣度,对基本挖掘算法中的候选项目集产生函数进行了改进。分析结果表明,利用规则兴趣度能够大大减小候选项目集的大小,有效提高频繁模式挖掘算法的效率。     

舰舰导弹攻击样式选择的决策分析

根据舰舰导弹攻击时使用雷达方式的不同,可将舰舰导弹攻击主要归结为三种样式,即其他兵力引导攻击样式、被动雷达攻击样式和主动雷达发波攻击样式。衡量各个攻击样式优劣主要考虑攻击的隐蔽性、命中率和发挥武器最大射程等三个因素。为此建立舰舰导弹攻击样式选择问题的递阶层次结构模型,从衡量各攻击样式优劣的三个主要因素出发,对模型进行了分析。最后得出了以其他兵力引导攻击为最佳攻击样式的结论。     

Note: Two rendezvous search problems on the line

A new upper bound is obtained for the two‐person symmetric rendezvous value on the real line when the distribution function of their initial distance apart is bounded. A second result shows that if three players are placed randomly on adjacent integers on the real line facing in random directions and able to move at a speed of at most 1, then they can ensure a three‐way meeting time of at most 7/2; the fact that 7/2 is a best possible result follows from work already in the literature. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 335–340, 1999     

Locating a target from directional data

Statistical estimation plays an important role in locating a target in space, a task that has important applications in many areas. However, theoretical measures on the quality of various estimators reported in the literature have been difficult to obtain because of mathematical complications. As a result, choice of estimator in practice has been largely arbitrary. In this paper, we present a systematic study on major target estimators reported in the literature. Focus is on comparisons between the traditional angle method, the line method, and a recently developed line-to-point transformation method. Insights gained from the study directly lead to the development of a novel two-stage angle method that not only produces highly accurate target estimation among all known estimators but is also computationally efficient. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 353–364, 1998     

基于测试码并行的同步时序电路故障模拟方法

将组合电路故障模拟的一些加速技术推广到时序电路故障模拟中,提出并实现了一个功能块级的基于测试码并行的同步时序电路故障模拟方法,对部分ISCAS89 Benchmark电路的模拟结果表明,该故障模拟方法有较好的性能.     

不确定环境下无人机区域目标搜索及载荷参数影响

针对不确定环境下无人机区域搜索问题,建立了实时探测更新的搜索方法,提出了机载光电载荷参数优化配置策略。建立了基于二维离散网格的无人机区域搜索模型,采用概率地图描述目标信息的实时获取与更新;引入不确定度指标、目标网格的重访和网格探测次数控制,建立搜索目标函数;建立了基于粒子群算法的搜索路径滚动优化方法;通过对任务区域平均探测时间步数和误判概率的估计分析,建立了机载光电载荷参数优化配置策略。使用蒙特卡洛方法验证了区域搜索方法的有效性和光电载荷参数配置对搜索效率、误判概率的影响。     

人字齿轮传动的振动理论分析模型

通过研究分析直齿轮和斜齿轮等的扭转振动分析模型、啮合耦合型振动分析模型 ,结合人字齿轮传动的特点 ,建立了人字齿轮传动的振动理论分析模型 .     

人字齿轮振动模型的解算方法

对人字齿轮传动装置振动模型的解算方法进行了分析讨论 .从中得出在齿轮传动系统振动模型中 ,从参数的确定到模型定量的求解 ,经常不得不采用有限元计算方法 .对于齿轮箱体的分析模型 ,只能采用有限元法建立 ,而对于齿轮的固有振动特性的确定更是离不开有限元方法 ,因此齿轮箱的振动特性的求解除了试验方法之外 ,有限元法应作为基本方法 .     

Heuristics for the location of inspection stations on a network

This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin‐destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the total risk reduction. A greedy search heuristic as well as several variants of an ascent search heuristic and of a tabu search heuristic are presented for the FIP. Computational results indicate that the best versions of the latter heuristics consistently produce optimal or near optimal solutions on test problems. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 287–303, 2000