Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

Neighborhood search heuristics for selecting hierarchically well‐formulated subsets in polynomial regression

The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well‐formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于禁忌退火算法的巡航导弹航迹规划

针对巡航导弹航迹规划这个复杂的优化问题,一个禁忌退火混合优化算法被提出.首先,该算法是以基本模拟退火算法为基础.其次,为了加快该模拟退火算法的收敛速度,在恶化解的接受判断过程中,增加了一定动态的约束条件.最后,为了使最优解能够跳出局部最优的陷阱,使用了一个动态的禁忌表.仿真结果验证了该禁忌退火混合优化算法能够取得目标函数更优的航迹规划路径,从而有效提高巡航导弹的作战效能.     

LFM脉冲雷达距离维快速搜索处理算法

针对脉冲雷达近距离目标遮挡问题,从理论上分析了雷达最小作用距离不受限于脉冲宽度.在此基础上,以Chirp脉冲为例,提出了一种适合远近距离全程目标的快速搜索处理算法.该算法只需发射一种宽脉冲波形,而不必根据距离的变化改变脉宽,从而有效缩短了搜索时间,大大提高了搜索效率.仿真结果表明了理论分析的正确性和算法的有效性.     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

基于多目标的雷达组网传感器资源管理算法

在雷达组网系统的多目标跟踪过程中,当目标数量过多时,由于传感器资源不足,无法使用传统传感器的管理方法进行资源分配,且运算时间过长,不满足工程实际需求。针对以上问题,提出了一种新的多传感器多目标跟踪任务快速分配算法,该算法将跟踪目标个数和跟踪目标精度作为优化目标,首先按照设定的分配准则对传感器进行一次分配,最大化跟踪目标个数;然后利用一种基于传感器排序的启发式传感器分配方法进行二次分配,通过控制跟踪目标的协方差水平,使目标的跟踪精度尽量接近期望值。仿真结果表明,该算法能够在较短的时间内对多传感器进行有效快速地分配,既跟踪了更多的目标,又达到了期望目标的跟踪精度,并且在一定程度上控制资源消耗,减少系统的总耗能。     

双天线干涉SAR系统无控制点场景的高精度参考相位快速估计算法

为解决无控制点场景参考相位的快速估计问题,对影响参考相位的因素进行理论分析,给出参考相位与影响因素的解析关系式。结合系统参数进行仿真分析,分析参考相位对高程误差的影响。根据分析结果,结合外部粗精度高程数据、滤波后的干涉相位及相干系数,提出高精度参考相位快速估计算法,并给出算法详细实现流程。对实际机载双天线干涉合成孔径雷达系统获取的数据进行处理,结果表明:算法在文中的系统参数下可以达到优于2 m的相对高程精度,处理4096×6560像素的数据块时,参考相位估计速度至少增大20倍。     

脉冲激励下船舶结构谐振响应预报及其模态阻尼参数识别

从模态识别基本原理出发,对脉冲激励下的时-频域响应、谐振激励下的时域响应的表达式进行推导,找到了其时-频域下的幅值关系,认为一定条件下谐振响应中伴随自由振动成分短时间内难以衰减,指出谐振激励力幅值与脉冲力幅值相等时,脉冲响应频谱对应频率下的幅频与谐振下的强迫振动幅值相等。在建立响应等价关系的基础上,推导了仅通过脉冲响应频谱上有限个谱线信息所确定的某阶模态阻尼比的计算公式。利用船体梁模型验证了响应预报及阻尼比估算的准确性。完成了2块不同材料典型船体板单元模型的前8阶模态阻尼比测试,通过数值计算结合试验响应频谱验证了方法的快速性、可靠性。     

射频识别系统的多目标识别-反碰撞算法

对多目标识别技术的二进制搜索算法、时隙ALOHA算法进行了剖析,并对ALOHA算法用概率论和数理统计的方法进行了深入的理论分析,得出要根据所设计的射频识别系统的特点合理采用各种算法方可得到良好的效果.该算法的实现对提高高速公路上自动收费系统、人员和物流管理等各领域的工作效率具有一定的指导意义.     

数字化扩频接收机的自适应抗干扰滤波方案研究

讨论了自适应抗干扰滤波在最小频移键控的直接序列扩频(DS-MSK)数字化接收机中的应用问题,对非线性滤波加以改进,提出了部分解扩非线性滤波(PDNF)结构,将快速更新子带自适应滤波(FRSAF)算法用于PDNF结构以提高收敛速度。结合FRSAF算法的PDNF自适应抗干扰滤波方案在收敛速度、稳健性和输出信噪比等方面明显优于结合LMS算法的传统非线性抗干扰滤波方案,仿真结果验证了上述结论。