基于随机漫游模型的协同搜索力最优分配方法

针对多平台协同搜索的最优搜索问题,以多无人机区域搜索任务为背景,将搜索论和随机规划引入到编队协同搜索中,建立了环境模型、无人机模型、传感器模型;为了解决目标丢失后的“应召”搜索问题,建立了目标的随机漫游模型;通过对搜索力最优分配问题的分析,认为其实质为一类线性规划问题,提出了一种基于递归原理的解算方法;最后,通过仿真计算,证明了该随机漫游模型的合理性,并验证了所提算法的有效性。     

基于遗传算法的吊放声纳搜潜策略优化

针对吊放声纳搜潜策略问题,在平均分配每点的搜索时间的典型搜潜策略的基础上,采用遗传算法优化搜潜策略中的吊点选择,进而给出合理的吊放声纳搜潜路径。算法中,利用实数编码优化初始种群,采用轮盘赌和期望值相结合的混合选择策略优化种群的进化。仿真运算表明:采用遗传算法优化吊放声纳搜潜路径是一种具有研究价值的方法,但算法复杂,计算量大,工程实现还需要进一步研究简化。     

Optimizing barge utilization in hinterland container transportation

In hinterland container transportation the use of barges is getting more and more important. We propose a real‐life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near‐optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large‐sized instances.     

多平台协同搜索水雷效能分析

侦察水雷是水雷战的一项重要内容。在水下无人作战平台和航空反水雷直升机作战平台搜索水雷概率模型分析基础上,给出了多平台协同搜索水雷方案优化模型,经分析归纳得到多平台协同搜索水雷最优方案,可为实际作战中多平台协同搜索水雷方案的制定、优化提供决策支持,具有较高的实用性。     

基于启发式算法的复杂军事网络路径优化

使用一种启发式算法,使得复杂网络中最大介数最小化,可以达到接近最优化的路径,以改善复杂网络的信息容量。针对海上编队作战系统复杂网络的平均介数、最大介数与网络大小、迭代次数、介数分布情况的仿真发现,复杂网络容量超出比对文献中理论预测的最大值,这对于解决复杂军事网络的拥塞,提高复杂军事网络容量和作战效能重大意义。     

基于禁忌搜索算法的指挥控制系统网络组织优化方法

基于复杂网络的拓扑结构优化理论与禁忌搜索算法,结合指挥控制系统的特点,建立了优化最优指挥与控制系统网络结构（Command and Control Architecture Network,C2AN）模型,并以复杂网络的网络效率和网络成本分别描述C2AN中的信息传播效率及构建C2AN的资源消耗,建立优化的目标函数,通过禁忌搜索算法获得了最优的C2AN。最后通过仿真实例,分析了最优C2AN生成过程及其基本统计特征。     

Annealing adaptive search,cross‐entropy,and stochastic approximation in global optimization

The Annealing Adaptive Search (AAS) algorithm for global optimization searches the solution space by sampling from a sequence of Boltzmann distributions. For a class of optimization problems, it has been shown that the complexity of AAS increases at most linearly in the problem dimension. However, despite its desirable property, sampling from a Boltzmann distribution at each iteration of the algorithm remains a practical challenge. Prior work to address this issue has focused on embedding Markov chain‐based sampling techniques within the AAS framework. In this article, based on ideas from the recent Cross‐Entropy method and Model Reference Adaptive Search, we propose an algorithm, called Model‐based Annealing Random Search (MARS), that complements prior work by sampling solutions from a sequence of surrogate distributions that iteratively approximate the target Boltzmann distributions. We establish a novel connection between MARS and the well‐known Stochastic Approximation method. By exploiting this connection, we prove the global convergence of MARS and characterize its asymptotic convergence rate behavior. Our empirical results indicate promising performance of the algorithm in comparison with some of the existing methods. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

程序进化器

研究用模拟进化方法进行程序设计的途径。构造了以形式文法为遗传表示的程序进化器,提出了这个进化器使用的有关算法。本文用程序进化器解决了人工蚁问题。     

反潜编队应召搜索能力计算及效果评估

本文在分析反潜编队应召搜索特点的基础上,对应召搜索能力进行了必要的战术计算,对应召搜索的效果进行了评估,为实际反潜作战中提高对潜搜索的效果提供了可靠的依据。     

Detection of a Markovian target with optimization of the search efforts under generalized linear constraints

This paper deals with search for a target following a Markovian movement or a conditionally deterministic motion. The problem is to allocate the search efforts, when search resources renew with generalized linear constraints. The model obtained is extended to resource mixing management. New optimality equations of de Guenin's style are obtained. Practically, the problem is solved by using an algorithm derived from the FAB method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 117–142, 2002; DOI 10.1002/nav.10009