驱护舰编队对潜防御性搜索态势分析与方法

针对驱护舰武器装备的发展,结合驱护舰编队海上对潜防御作战的新特点,根据特定驱护舰编队的使命任务,提出了特定驱护舰编队对潜进攻性搜索与防御性搜索的新概念,并在战斗战场范围内对特定驱护舰编队对潜防御性搜索态势进行了分析,给出了编队对潜防御性搜索方法.对部队作战与训练具有一定的参考应用价值.     

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     

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     

跳跃-滑翔弹道扰动引力自适应网格快速赋值方法

为实现高超声速跳跃-滑翔弹道扰动引力的快速赋值,提出自适应网格赋值模型,并根据反距离加权理论,优化广义延拓逼近算法,对模型的逼近误差进行分析。该赋值模型的网格划分为两级,第一级网格根据标准弹道空域进行划分,第二级网格根据滑翔导弹实际弹道在线生成。根据一级网格节点数据,通过优化广义延拓逼近算法计算二级网格节点数据,最后根据二级单元内插计算实际弹道点的扰动引力值。仿真结果表明:在同等大小的网格划分下,优化广义延拓自适应网格模型的逼近精度高于一般赋值方法;在同等精度要求下,该赋值模型的最大单元格边长大于一般赋值方法,从而减少了单元格划分数量,进而降低弹上数据存储量;针对不同滑翔方向以及不同滑翔距离的跳跃-滑翔弹道,该模型逼近误差对应的落点偏差小于5 m,具有较好的适应性。该赋值模型在满足计算速度的前提下,提高了传统赋值方法的逼近精度,降低了弹上存储量,具有一定的工程应用价值。     

一种有效的神经网络检测器

本文提出了一种有效的神经网络检测方法。该方法通过高效的自组织学习过程,使该神经网络对各种噪声或杂波分布能够快速准确地建模,最终能使在各种噪声分布条件下检测效果均逼近最佳检测器的性能。实验结果验明了该方法的有效性     

基于遗传算法的湿陷性黄土地基灰土挤密桩优化设计

利用Visual C＋＋语言，定义了一个面向对象的基于实数编码遗传算法类。运用可最大限度保证遗传算法搜索到问题的全局最优解的深度搜索策略，编制了灰土挤密桩的优化设计和造价估算遗传算法程序，并针对兰州某地灰土挤密桩复合地基进行了计算分析，并与原有方案比较，结果表明：两种优化方案在满足承载力和变形的条件下，在降低造价成本方面优势非常明显。     

调运问题中基于栅格模型的快速路径规划方法

针对调运路径规划这一问题,采用栅格模型表示环境地图,通过设定路径搜索方向权重,剔除不必要的搜索区域,提高了搜索效率.仿真结果表明,该算法能有效地提高路径搜索效率,并能搜索到最优路径.     

Discrete search allocation game with false contacts

This paper deals with a two‐person zero‐sum game called a search allocation game, where a searcher and a target participate, taking account of false contacts. The searcher distributes his search effort in a search space in order to detect the target. On the other hand, the target moves to avoid the searcher. As a payoff of the game, we take the cumulative amount of search effort weighted by the target distribution, which can be derived as an approximation of the detection probability of the target. The searcher's strategy is a plan of distributing search effort and the target's is a movement represented by a path or transition probability across the search space. In the search, there are false contacts caused by environmental noises, signal processing noises, or real objects resembling true targets. If they happen, the searcher must take some time for their investigation, which interrupts the search for a while. There have been few researches dealing with search games with false contacts. In this paper, we formulate the game into a mathematical programming problem to obtain its equilibrium point. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007